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
- 1336 views
- $4.92
Related Questions
- Combinatorics Questions: Card Pairs, Letter Arrangements, and Number Sequences
- Logic equation
- Logic Questions (𝐴→𝐶)∧(𝐵→𝐶)⊢(𝐴∧𝐵)→𝐶
- Logic Question 𝐴→(𝐵→𝐶),𝐴→𝐵,𝐴⊢𝐶
- I have a question for 0/0 being undefined and wonder if anybody has a refutation.
- Logic Question (𝐴→(𝐵→𝐶))→((𝐴→𝐵)→(𝐴→𝐶))
- Logic Question 𝐴∧(𝐵∨𝐶)⊢(𝐴∧𝐵)∨(𝐴∧𝐶)
- 2 Player Limited Information Game
The auxiliary hypothesis is: "Suppose that Γ ⊢ (∃x)A."
I don't understand the technique. Can you give a definition rather than an example?