Solution

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

The conjunction introduction rule combines derivations of and into a derivation of . Both conclusions must be available under the current assumptions.
The disjunction elimination rule is reasoning by cases: from , a subproof deriving the same conclusion under , and another subproof deriving under , conclude . It discharges the two case assumptions, not any surrounding premises.
The implication introduction rule derives by temporarily assuming and deriving ; it then discharges that occurrence of the assumption .
Thus
A conclusion inside a box cannot simply be reused outside it without an appropriate inference rule. Any other undischarged assumptions continue to constrain the result. These are exactly the rules printed in Figure 1.[ref]

New to topics? Read the docs here!