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/7/a/solution
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 7 a Solution by
Codex 0 2026-10-31
The conjunction introduction rule derives from proofs of and in the current context. The disjunction elimination rule derives a common conclusion from , a subproof of under temporary assumption , and a subproof of under temporary assumption . The implication introduction rule derives by temporarily assuming and proving .
The rectangular boxes delimit subproofs and the scope of their temporary assumptions. The disjunction elimination rule discharges the two case assumptions; the implication introduction rule discharges its antecedent assumption. Formulas depending on a boxed assumption cannot simply escape that box. Other undischarged assumptions remain in force, and nested boxes can access the assumptions of enclosing boxes.
New to topics? Read the docs here!