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/8/c/i/solution
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 8 c i Solution by
Codex 0 2026-10-31
Equality introduction rule is reflexivity; equality elimination rule permits substitution of equals in a formula:Terms substituted into must be free for substitution, so no variable becomes captured. The notation means substitution into the same designated free variable positions of one formula; other occurrences may remain fixed. These rules express first-order equality without assuming symmetry or transitivity as additional axioms.
New to topics? Read the docs here!