Solution

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

Choose arbitrary fresh variables and assume under label . The conjunction elimination rule gives and . Apply the disjunction elimination rule to the equality disjunction.
In the case , the supplied symmetry rule gives , and the equality elimination rule applied to gives . Disjunction introduction rule gives . In the case , equality elimination rule applied directly to gives ; the other disjunction introduction rule gives the same conclusion . Discharge the two equality case assumptions by disjunction elimination rule.
Discharge with the implication introduction rule. There are now no undischarged assumptions. Use the universal quantifier introduction rule successively for , then , then , yielding
Freshness holds at every generalization because the sole temporary assumption has already been discharged; the arbitrary variables are not tied to any premise.

New to topics? Read the docs here!