natural deduction metalanguage, practical foundations
type theory (dependent, intensional, observational type theory, homotopy type theory)
computational trinitarianism =
propositions as types +programs as proofs +relation type theory/category theory
equality (definitional, propositional, computational, judgemental, extensional, intensional, decidable)
identity type, equivalence of types, definitional isomorphism
isomorphism, weak equivalence, homotopy equivalence, weak homotopy equivalence, equivalence in an (∞,1)-category
Examples.
In any predicate logic over type theory, propositional equality is the notion of equality which is defined to be a proposition. Propositional equality is most commonly used in set theories like ZFC and ETCS and dependently sorted set theories, but it could also be used for definitional equality and conversional equality in logic over dependent type theory in place of judgmental equality.
Propositional equality can be contrasted with judgmental equality, where equality is a judgment, and typal equality, where equality is a type.
Historically in the dependent type theory community, the term propositional equality was used for typal equality. This was because under the principle of propositions as types, one interprets all types in a single-layer type theory as being propositions. However, we choose to make a distinction between propositional equality and typal equality. First, propositional equality as defined in this article is used in the most common foundations of mathematics, such as ZFC and ETCS, and is clearly not a type. Additionally, in some logics over type theory, one can have three distinct notions of equality: judgmental equality, propositional equality, and typal equality. Finally, in the advent of homotopy type theory and other type theoretic higher foundations, typal equality is no longer required to be a subsingleton or h-proposition, and the alternative principle of propositions as some types has become the primary interpretation of dependent type theory, where only the subsingletons or h-propositions are interpreted as propositions.
In any two-layer type theory with a layer of types and a layer of propositions, or equivalently a first order logic over type theory or a first-order theory, every type has a binary relation according to which two elements and of are related if and only if they are equal; in this case we write . Since relations are propositions in the context of a term variable judgment in the type layer, this is called propositional equality. The formation and introduction rules for propositional equality is as follows
Then we have the elimination rules for propositional equality:
Something similar occurs in untyped first-order logic, where the domain of discourse has a binary relation according to which two elements and are related if and only if they are equal; in this case we write . Since relations are propositions in the context of a term variable judgment in the type layer, this is similarly called propositional equality. The formation and introduction rules for propositional equality is as follows
Then we have the elimination rules for propositional equality:
The introduction rule of propositional equality says that propositional equality is reflexive.
We can show that propositional equality is symmetric, that for all and such that , we have . By the introduction rule, we have that for all , we have that , and because all propositions imply themselves, we have that implies . Thus, by the elimination rules for propositional equality, for all and such that , we have .
We can also show that propositional equality is transitive, that for all , , and such that , implies that . By the introduction rule, we have that for all and , we have that , and because all propositions imply themselves, we have that implies , and because true propositions imply true propositions, we have that implies that implies . Thus, by the elimination rules for propositional equality, for all , , and such that , implies that .
Thus, propositional equality is an equivalence relation.
For all function and elements and such that , :
This is because for all functions , by the introduction rule for propositional equality, for all elements , , and the elimination rule for propositional equality states that if for all elements , , then for all elements and such that , .
The extensionality principle for function types (function extensionality) states that for all functions and , if and only if for all and such that ,
Given a set and elements and and a family of sets , and , if , then we can define transport functions whose inverse function is by symmetry of propositional equality.
The heterogeneous propositional equality is given by the logically equivalent relations
Transport and heterogeneous propositional equality are important in some set theories which do not have equality between sets themselves, and the only way to compare sets for equality is through isomorphisms. The same is true of logic over dependent type theory which do not have definitional equality between types, and one has to use definitional isomorphisms instead. In the presence of equality between sets, transport is simply the identity function on the equal set.
Propositional equality can be used in the computation rules and uniqueness rules of types in logic over dependent type theory:
The usual notion of equality as a proposition is discussed in
Last revised on May 16, 2025 at 21:24:35. See the history of this page for a list of all contributions to it.