Axioms regularizing the use of the equality relation in mathematical proofs. These axioms assert the reflexivity of the equality relation and the possibility of substituting equals for equals. Symbolically the equality axioms are written:
where is a formula and is a term in the language in question, , and are variables having the same non-empty domain of variation, and expressions of the form and denote the result of replacing all free occurrences of in or by .
Using equality axioms, the symmetry and transitivity of the equality relation can be proved. To do this take to be the formula in the first case and the formula in the second.
If the formulas and terms of the language in question are constructed from atomic formulas and terms using logical connectives and superposition, then the reduced equality axioms can be derived from their particular cases when and are atomic formulas and terms. Symbolically:
where and are -place predicate and function symbols.
|[a1]||S.C. Kleene, "Introduction to metamathematics" , North-Holland (1950) pp. Chapt. XIV|
Equality axioms. Encyclopedia of Mathematics. URL: http://www.encyclopediaofmath.org/index.php?title=Equality_axioms&oldid=36634