Matthews 1

MA 385
Assignment 10
Caden Matthews
Section A
3.
{1} 1. (∀𝑥)(φ → ψ) P (For CP)

{1} 2. φ →ψ 1US [x|x]

{2} 3. φ P (For CP)

{1,2} 4. ψ 2,3T

{1,2} 5. (∀𝑥)ψ 4UG

{1} 6. φ → (∀𝑥)ψ 3,5CP

{} 7. (∀𝑥)(φ → ψ)→ (φ → (∀𝑥)ψ) 1,6CP

{3} 8. φ → (∀𝑥)ψ P (For CP)

{2,3} 9. (∀𝑥)ψ 3,8T

{2,3} 10. ψ 9US [x|x]

{3} 11. φ →ψ 3,10CP

{3} 12. (∀𝑥)(φ → ψ) 11UG

{} 13. (φ → (∀𝑥)ψ) → (∀𝑥)(φ → ψ) 8,12CP

{} 14. (∀𝑥)(φ → ψ)↔ [φ → (∀𝑥)ψ] 7,13T

 Matthews 2

4.
{1} 1. (∃𝑥)(ψ → φ) ∧ ¬((∀𝑥)ψ → φ) P (For IP)

{1} 2. (∃𝑥)(ψ → φ) 1T

{1} 3. ¬((∀𝑥)ψ → φ) 1T

{1} 4. ¬(¬(∀𝑥)ψ ∨ φ) 3LE (T)

{1} 5. (∀𝑥)ψ ∧ ¬φ 4T

{1} 6. (∀𝑥)ψ 5T

{1} 7. ¬φ 5T

{1} 8. (∀𝑥)¬φ 7UG

{2} 9. ψ[𝑦|𝑥] → φ[𝑦|𝑥] 𝑦 P (For EP)

{1} 10. ψ[𝑦|𝑥] 6US [y|x]

{1,2} 11. φ[𝑦|𝑥] 𝑦 9,10T

{1} 12. ¬φ[𝑦|𝑥] 8US [y|x]

{1,2} 13. φ[𝑦|𝑥] ∧ ¬φ[𝑦|𝑥] 𝑦 11,12T

{1,2} 14. 𝑃 ∧ ¬𝑃 13T

{1} 15. 𝑃 ∧ ¬𝑃 2,9,14EP [y|x]

{} 16. ¬[(∃𝑥)(ψ → φ) ∧ ¬((∀𝑥)ψ → φ)] 1,15IP

{} 17. ¬(∃𝑥)(ψ → φ) ∨ ((∀𝑥)ψ → φ) 16T

{} 18. (∃𝑥)(ψ → φ) → [(∀𝑥)ψ → φ] 17T

Proof continued on next page
 Matthews 3

{3} 19. ¬(∃𝑥)(ψ → φ) ∧ ((∀𝑥)ψ → φ) P (For IP)

{3} 20. ¬(∃𝑥)(ψ → φ) 19T

{3} 21. (∀𝑥)¬(ψ → φ) 20LT (1)

{3} 22. (∀𝑥)(ψ ∧ ¬φ) 21LE (T)

{3} 23. (∀𝑥)ψ → φ 19T

{3} 24. ψ ∧ ¬φ 22US [x|x]

{3} 25. ¬(∀𝑥)ψ 23,24T

{3} 26. (∃𝑥)¬ψ 25LT (2)

{4} 27. ¬ψ[𝑧|𝑥] 𝑧 P (For EP)

{3} 28. ψ[𝑧|𝑥] ∧ ¬φ[𝑧|𝑥] 22US [z|x]

{3} 29. ψ[𝑧|𝑥] 28T

{3,4} 30. ψ[𝑧|𝑥] ∧ ¬ψ[𝑧|𝑥] 𝑧 27,29T

{3,4} 31. 𝑃 ∧ ¬𝑃 30T

{3} 32. 𝑃 ∧ ¬𝑃 26,27,31EP [z|x]

{} 33. ¬[¬(∃𝑥)(ψ → φ) ∧ ((∀𝑥)ψ → φ)] 19,32IP

{} 34. (∃𝑥)(ψ → φ) ∨ ¬[(∀𝑥)ψ → φ] 33T

{} 35. [(∀𝑥)ψ → φ] → (∃𝑥)(ψ → φ) 34T

{} 36. (∃𝑥)(ψ → φ) ↔ [(∀𝑥)ψ → φ] 18,35T

 Matthews 4

Section B
2.
{1} 1. (∀𝑥)𝑃𝑥 ∨ (∀𝑦)𝑄𝑦 P (For CP)

{1} 2. (∀𝑦)[(∀𝑥)𝑃𝑥 ∨ 𝑄𝑦] 1LT (14)

{2} 3. ¬(∀𝑧)(𝑃𝑧 ∨ 𝑄𝑧) P (For IP)

{2} 4. (∃𝑧)¬(𝑃𝑧 ∨ 𝑄𝑧) 3LT (2)

{2} 5. (∃𝑧)(¬𝑃𝑧 ∧ ¬𝑄𝑧) 4LE (T)

{3} 6. ¬𝑃𝑣 ∧ ¬𝑄𝑣 𝑣 P (For EP)

{1} 7. (∀𝑥)𝑃𝑥 ∨ 𝑄𝑣 2US [v|y]

{1,3} 8. (∀𝑥)𝑃𝑥 6,7T

{1,3} 9. 𝑃𝑣 𝑣 8US [v|x]

{1,3} 10. 𝑃𝑣 ∧ ¬𝑃𝑣 𝑣 6,9T

{1,3} 11. φ ∧ ¬φ 10T

{1,2} 12. φ ∧ ¬φ 5,6,11EP [v|z]

{1} 13. (∀𝑧)(𝑃𝑧 ∨ 𝑄𝑧) 3,12IP

{} 14. [(∀𝑥)𝑃𝑥 ∨ (∀𝑦)𝑄𝑦] → (∀𝑧)(𝑃𝑧 ∨ 𝑄𝑧) 1,13CP

 Matthews 5

6.
{1} 1. (∃𝑥)((∃𝑦)𝑃𝑦 → 𝑄𝑥) P (For CP)

{1} 2. (∃𝑦)𝑃𝑦 → (∃𝑥)𝑄𝑥 1LT (17)

{2} 3. 𝑃𝑥 𝑥 P (For CP)

{2} 4. (∃𝑦)𝑃𝑦 3EG [x|y]

{1,2} 5. (∃𝑥)𝑄𝑥 2,4T

{1,2} 6. (∃𝑦)𝑄𝑦 5LT (8)

{1} 7. 𝑃𝑥 → (∃𝑦)𝑄𝑦 3,6CP

{1} 8. (∀𝑥)[𝑃𝑥 → (∃𝑦)𝑄𝑦] 7UG

{} 9. (∃𝑥)((∃𝑦)𝑃𝑦 → 𝑄𝑥) → (∀𝑥)[𝑃𝑥 → (∃𝑦)𝑄𝑦] 1,8CP

10.
S=<U, R>=<{a,b,c}, {(a,b),(b,c)}>
Consider x=a, y=b, z=c. We note that the antecedent is true as (a,b) and (b,c) are in R.
However, since (a,c) is not in R, the consequent is false. True implies false is false.

13.
S=<U, P, Q, a>=<{a,b,c}, {b}, {b}, a>
Dealing first with “For all x, Px implies Qx,” we note that for x=a and x=c, Px implies Qx is
true as a and c are not in
 Matthews 6

18.
{1} 1. ¬(∀𝑥)(∃𝑦)𝑅𝑥𝑦 ∧ ¬(∃𝑦)(∀𝑥)¬𝑅𝑦𝑥 P (For IP)

{1} 2. (∃𝑥)(∀𝑦)¬𝑅𝑥𝑦 ∧ (∀𝑦)(∃𝑥)𝑅𝑦𝑥 1LE (1,2)

{2} 3. (∀𝑦)¬𝑅𝑣𝑦 𝑣 P (For EP)

{1} 4. (∃𝑥)𝑅𝑣𝑥 2US [v|y]

{3} 5. 𝑅𝑣𝑤 𝑣𝑤 P (For EP)

{2} 6. ¬𝑅𝑣𝑤 𝑣 3US [w|y]

{2,3} 7. 𝑅𝑣𝑤 ∧ ¬𝑅𝑣𝑤 𝑣𝑤 5,6T

{2,3} 8. 𝑃 ∧ ¬𝑃 7T

{1,2} 9. 𝑃 ∧ ¬𝑃 4,5,8EP [w|x]

{1} 10. 𝑃 ∧ ¬𝑃 2,3,9EP [v|x]

{} 11. ¬[¬(∀𝑥)(∃𝑦)𝑅𝑥𝑦 ∧ ¬(∃𝑦)(∀𝑥)¬𝑅𝑦𝑥] 1IP

{} 12. (∀𝑥)(∃𝑦)𝑅𝑥𝑦 ∨ (∃𝑦)(∀𝑥)¬𝑅𝑦𝑥 11T

 Matthews 7

Section D
4.
{1} 1. ¬(∃𝑥)(∀𝑦)(𝑃𝑦 ∧ ¬𝑄𝑥) P

{1} 2. (∀𝑥)¬(∀𝑦)(𝑃𝑦 ∧ ¬𝑄𝑥) 1LT (1)

{1} 3. (∀𝑥)(∃𝑦)¬(𝑃𝑦 ∧ ¬𝑄𝑥) 2LE (2)

{1} 4. (∀𝑥)(∃𝑦)(¬𝑃𝑦 ∨ 𝑄𝑥) 3LE (T)

{1} 5. (∀𝑥)(𝑄𝑥 ∨ (∃𝑦)¬𝑃𝑦) 4LE (15)

{1} 6. (∀𝑥)𝑄𝑥 ∨ (∃𝑦)¬𝑃𝑦 5LT (14)

{1} 7. (∀𝑥)𝑄𝑥 ∨ ¬(∀𝑦)𝑃𝑦 6LE (2)

{1} 8. (∀𝑥)𝑄𝑥 ∨ ¬(∀𝑥)𝑃𝑥 7LE (7)

{1} 9. (∀𝑥)𝑃𝑥 → (∀𝑥)𝑄𝑥 8T

 Matthews 8

13.
{1} 1. (∀𝑥)(∀𝑦)[𝑃𝑥 ∧ (∃𝑧)(𝑄𝑧 ∧ 𝑅𝑦𝑧) → 𝑆𝑥𝑦] P

{2} 2. (∀𝑥)[(∃𝑦)(𝑃𝑦 ∧ 𝑆𝑦𝑥) → 𝑇𝑥] P

{3} 3. ¬𝑇𝑎 P

{4} 4. (∃𝑥)𝑃𝑥 P (For CP)

{5} 5. 𝑄𝑦 𝑦 P (For CP)

{2} 6. (∃𝑦)(𝑃𝑦 ∧ 𝑆𝑦𝑎) → 𝑇𝑎 2US [a|x]

{2,3} 7. ¬(∃𝑦)(𝑃𝑦 ∧ 𝑆𝑦𝑎) 3,6T

{2,3} 8. (∀𝑦)(¬𝑃𝑦 ∨ ¬𝑆𝑦𝑎) 7LE (1,T)

{2,3} 9. ¬𝑃𝑣 ∨ ¬𝑆𝑣𝑎 8US [v|y]

{1} 10. (∀𝑦)[𝑃𝑣 ∧ (∃𝑧)(𝑄𝑧 ∧ 𝑅𝑦𝑧) → 𝑆𝑣𝑦] 1US [v|x]

{1} 11. 𝑃𝑣 ∧ (∃𝑧)(𝑄𝑧 ∧ 𝑅𝑎𝑧) → 𝑆𝑣𝑎 10US [a|y]

{6} 12. 𝑃𝑣 𝑣 P (For EP)

{2,3,6} 13. ¬𝑆𝑣𝑎 𝑣 9,12T

{1} 14. ¬𝑃𝑣 ∨ ¬(∃𝑧)(𝑄𝑧 ∧ 𝑅𝑎𝑧) ∨ 𝑆𝑣𝑎 11T

{1,2,3,6} 15. ¬(∃𝑧)(𝑄𝑧 ∧ 𝑅𝑎𝑧) 12,13,14T

{1,2,3,6} 16. (∀𝑧)¬(𝑄𝑧 ∧ 𝑅𝑎𝑧) 15LT (1)

{1,2,3,6} 17. (∀𝑧)(¬𝑄𝑧 ∨ ¬𝑅𝑎𝑧) 16LE (T)

{1,2,3,4} 18. (∀𝑧)(¬𝑄𝑧 ∨ ¬𝑅𝑎𝑧) 4,12,17EP [v|x]

{1,2,3,4} 19. ¬𝑄𝑦 ∨ ¬𝑅𝑎𝑦 18US [y|z]

{1,2,3,4,5} 20. ¬𝑅𝑎𝑦 𝑦 5,19T

{1,2,3,4} 21. 𝑄𝑦 → ¬𝑅𝑎𝑦 5,20CP

{1,2,3,4} 22. (∀𝑦)(𝑄𝑦 → ¬𝑅𝑎𝑦) 21UG

{1,2,3} 23. (∃𝑥)𝑃𝑥 → (∀𝑦)(𝑄𝑦 → ¬𝑅𝑎𝑦) 4,22CP

 Matthews 9

Section F
3.
(∀𝑥)(𝐹𝑥 → 𝐺𝑥𝑦) → ¬(∃𝑦)𝐻𝑦 Given

(∀𝑥)(𝐹𝑥 → 𝐺𝑥𝑦) → (∀𝑦)¬𝐻𝑦 LE (1)

(∀𝑥)(¬𝐹𝑥 ∨ 𝐺𝑥𝑦) → (∀𝑦)¬𝐻𝑦 LE (T)

¬(∀𝑦)¬𝐻𝑦 → ¬(∀𝑥)(¬𝐹𝑥 ∨ 𝐺𝑥𝑦) T

(∃𝑦)𝐻𝑦 → (∃𝑥)(𝐹𝑥 ∧ ¬𝐺𝑥𝑦) LE (1,2,T)

(∃𝑥)((∃𝑦)𝐻𝑦 → (𝐹𝑥 ∧ ¬𝐺𝑥𝑦)) LT (17)

(∃𝑥)((∃𝑧)𝐻𝑧 → (𝐹𝑥 ∧ ¬𝐺𝑥𝑦)) LE (8)

(∃𝑥)(∀𝑧)[𝐻𝑧 → (𝐹𝑥 ∧ ¬𝐺𝑥𝑦)] LE (18)

7.
¬(∀𝑥)(𝑃𝑥 → 𝑄𝑥) ∧ ¬(∃𝑦)(∃𝑧)(𝑃𝑧 ∧ 𝑅𝑥𝑧 ∧ 𝑆𝑦𝑥) Given

¬(∀𝑥)(𝑃𝑥 → 𝑄𝑥) ∧ (∀𝑦)(∀𝑧)¬(𝑃𝑧 ∧ 𝑅𝑥𝑧 ∧ 𝑆𝑦𝑥) LE (1)

(∀𝑦)(∀𝑧)[¬(∀𝑥)(𝑃𝑥 → 𝑄𝑥) ∧ ¬(𝑃𝑧 ∧ 𝑅𝑥𝑧 ∧ 𝑆𝑦𝑥)] LT (12)

(∀𝑦)(∀𝑧)[(∃𝑥)¬(𝑃𝑥 → 𝑄𝑥) ∧ ¬(𝑃𝑧 ∧ 𝑅𝑥𝑧 ∧ 𝑆𝑦𝑥)] LE (2)

(∀𝑦)(∀𝑧)[(∃𝑣)(𝑃𝑣 ∧ ¬𝑄𝑣) ∧ ¬(𝑃𝑧 ∧ 𝑅𝑥𝑧 ∧ 𝑆𝑦𝑥)] LE (8,T)

(∀𝑦)(∀𝑧)(∃𝑣)[(𝑃𝑣 ∧ ¬𝑄𝑣) ∧ ¬(𝑃𝑧 ∧ 𝑅𝑥𝑧 ∧ 𝑆𝑦𝑥)] LE (13)

13. This one is complicated and I believe would be too wide to write each step.
Starting from the given equation, I used rule T to split it into the conjunction of two
conditionals. I then used the list of logical theorems to change various variables and “pull
out” quantifiers. This is the answer I found:
(∀𝑣)(∀𝑧)(∃𝑢)(∃𝑤)[(𝐴𝑧 ∧ 𝐵𝑧𝑦 → ¬𝐶𝑣 ∧ ¬𝐷𝑥𝑣) ∧ (¬𝐶𝑢 ∧ ¬𝐷𝑥𝑢 → 𝐴𝑤 ∧ 𝐵𝑤𝑦)]