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/a/i/solution

Apply the universal quantifier elimination rule to the universal premise with term , obtaining . The left biconditional elimination rule gives . Use the premise and the modus ponens rule to derive . The existential quantifier introduction rule with witness yields . Substitution of a constant is capture-free here, so both quantifier side conditions hold.

New to topics? Read the docs here!