Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2014/digital-systems-linear-algebra-introduction-to-formal-proof/8/c/ii/solution

Eliminate the existential premise with fresh witness . Its first conjunct gives and its second gives . For a fresh arbitrary , one direction of the desired logical biconditional follows by universal elimination. For the other, must be reversed before transporting to using the supplied oriented equality elimination rule.
LineContextFormulaJustification
1Premise
2Temporary assumption
3conjunction elimination rule on 2
4conjunction elimination rule on 2
5universal elimination on 4; instantiate at
6Temporary assumption
7equality introduction rule
8equality elimination rule on 6, 7
9equality elimination rule on 8, 3
10implication introduction rule on 9; discharge 6
11biconditional introduction rule on 5, 10
12universal introduction on 11; fresh
13existential quantifier introduction rule on 12; witness
14existential quantifier elimination rule on 1, 13; discharge 2; fresh
Here is absent from every open assumption when line 12 uses universal introduction. In line 13 the existential quantifier binds the witness position occupied by ; the conclusion then has no free , allowing line 14 to close its witness subproof. Hence
The premise says an object satisfying exists and every object satisfying equals it. The logical biconditional adds the converse explicitly: every object equal to that witness also satisfies .

New to topics? Read the docs here!