Using the auxiliary hypothesis metatheorem prove ⊢ (∃x)A → (∃x) ( A ∧ (A ∨ B) )
Join Matchmaticians Affiliate Marketing
Program to earn up to a 50% commission on every question that your affiliated users ask or answer.
- closed
- 469 views
- $4.92
Related Questions
- Logic quesiton A v ¬A
- 2 Player Limited Information Game
- Questions about computability Theory, Logic
- Logic Question 𝐴→(𝐵→𝐶),𝐴→𝐵,𝐴⊢𝐶
- Logic equation
- Combinatorics Questions: Card Pairs, Letter Arrangements, and Number Sequences
- Logic Question (𝐴→(𝐵→𝐶))→((𝐴→𝐵)→(𝐴→𝐶))
- Induction proof for an algorithm. Introductory level discrete math course. See attachment for details
The auxiliary hypothesis is: "Suppose that Γ ⊢ (∃x)A."
I don't understand the technique. Can you give a definition rather than an example?