Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2016/digital-systems-linear-algebra-introduction-to-formal-proof-resit/7/a/solution

Implication introduction assumes temporarily, derives , and discharges that assumption to conclude . Disjunction elimination starts from and derives the same conclusion in two separate branches, one assuming and the other assuming .
The boxes delimit subproofs: a locally assumed formula is available inside its box but cannot be used unconditionally outside it. Discharging a box records exactly which dependency has been removed. The proofs below use a vertical bar to mark each active box.

New to topics? Read the docs here!