Allen W. answered 09/05/23
MS in Computer Science & Engineering with 2 years TA experience
You want to define all of the symbols that you introduce in your proof. For example:
Let s be the person "Shelley" and let L(x,y) be a predicate meaning person x loves person y.
There is some ambiguity in the problem statement so I'll assume person x is a lover if there exists a person y such that L(x,y). The first premise also could be reasonably interpreted as either a universal statement (everybody loves every lover) or an existential statement (everybody loves at least one lover), but only the latter will prove the conclusion.
To get started on the proof you have
- ∀x∀y∀z(L(x,y)→L(z,x)) (Premise 1)
- ∃x(L(s,x)) (Premise 2)
- L(s,a) (∃-elimination on 2)
- L(s,a)→L(z,s) (∀-elimination on 1)
- L(z,s) (3,4 Modus Ponens)
- L(z,s)→L(w,z) (∀-elimination on 1)
- L(w,z) (5,6 Modus Ponens)∀
- ∀x∀y(L(x,y)) (∀-introduction on 7)
The key points to review here would probably be the rules for quantifier introduction and elimination.
From a universal statement we can substitute an element of the domain or an arbitrary placeholder (in this proof only s is a real domain element, the rest of the variables used were arbitrary). From an existential statement we can substitute a placeholder as long as it has not been earlier in the proof.
From any predicate P(x) and argument we can introduce the existential statement ∃aP(a) and if the argument is an arbitrary variable we can introduce the universal statement ∀xP(x)