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
- 729 views
- $4.92
Related Questions
- Logic Question 𝐴∨𝐵→𝐶⊢(𝐴→𝐶)∧(𝐵→𝐶)
- Logic Questions (𝐴→𝐶)∧(𝐵→𝐶)⊢(𝐴∧𝐵)→𝐶
- Logic equation
- Induction proof for an algorithm. Introductory level discrete math course. See attachment for details
- Logic Question ¬¬𝐴→𝐴
- Logic Question (𝐴→(𝐵→𝐶))→((𝐴→𝐵)→(𝐴→𝐶))
- I have a question for 0/0 being undefined and wonder if anybody has a refutation.
- Questions about computability Theory, Logic
The auxiliary hypothesis is: "Suppose that Γ ⊢ (∃x)A."
I don't understand the technique. Can you give a definition rather than an example?