nLab propositional extensionality



Type theory

natural deduction metalanguage, practical foundations

  1. type formation rule
  2. term introduction rule
  3. term elimination rule
  4. computation rule

type theory (dependent, intensional, observational type theory, homotopy type theory)

syntax object language

computational trinitarianism =
propositions as types +programs as proofs +relation type theory/category theory

logicset theory (internal logic of)category theorytype theory
predicatefamily of setsdisplay morphismdependent type
proofelementgeneralized elementterm/program
cut rulecomposition of classifying morphisms / pullback of display mapssubstitution
introduction rule for implicationcounit for hom-tensor adjunctionlambda
elimination rule for implicationunit for hom-tensor adjunctionapplication
cut elimination for implicationone of the zigzag identities for hom-tensor adjunctionbeta reduction
identity elimination for implicationthe other zigzag identity for hom-tensor adjunctioneta conversion
truesingletonterminal object/(-2)-truncated objecth-level 0-type/unit type
falseempty setinitial objectempty type
proposition, truth valuesubsingletonsubterminal object/(-1)-truncated objecth-proposition, mere proposition
logical conjunctioncartesian productproductproduct type
disjunctiondisjoint union (support of)coproduct ((-1)-truncation of)sum type (bracket type of)
implicationfunction set (into subsingleton)internal hom (into subterminal object)function type (into h-proposition)
negationfunction set into empty setinternal hom into initial objectfunction type into empty type
universal quantificationindexed cartesian product (of family of subsingletons)dependent product (of family of subterminal objects)dependent product type (of family of h-propositions)
existential quantificationindexed disjoint union (support of)dependent sum ((-1)-truncation of)dependent sum type (bracket type of)
logical equivalencebijection setobject of isomorphismsequivalence type
support setsupport object/(-1)-truncationpropositional truncation/bracket type
n-image of morphism into terminal object/n-truncationn-truncation modality
equalitydiagonal function/diagonal subset/diagonal relationpath space objectidentity type/path type
completely presented setsetdiscrete object/0-truncated objecth-level 2-type/set/h-set
setset with equivalence relationinternal 0-groupoidBishop set/setoid with its pseudo-equivalence relation an actual equivalence relation
equivalence class/quotient setquotientquotient type
inductioncolimitinductive type, W-type, M-type
higher inductionhigher colimithigher inductive type
-0-truncated higher colimitquotient inductive type
coinductionlimitcoinductive type
presettype without identity types
set of truth valuessubobject classifiertype of propositions
domain of discourseuniverseobject classifiertype universe
modalityclosure operator, (idempotent) monadmodal type theory, monad (in computer science)
linear logic(symmetric, closed) monoidal categorylinear type theory/quantum computation
proof netstring diagramquantum circuit
(absence of) contraction rule(absence of) diagonalno-cloning theorem
synthetic mathematicsdomain specific embedded programming language

homotopy levels


Equality and Equivalence


Disambiguation: This should not be confused with propositional extensionality in extensional type theory.



In formal logic propositional extensionality holds when any two propositions PP and QQ are identified, P=QP = Q, precisely if they imply each other, (PQ)(P \leftrightarrow Q) (hence if they are logically equivalent (PQ)(P \simeq Q)), i.e.

(P=Q)(PQ). (P=Q) \simeq (P\leftrightarrow Q) \,.


In type theory and Relation to univalence

In type theory the expression (P=Q)(P=Q) is the identity type Id Prop(P,Q)Id_{Prop}(P,Q) of the universe of propositions (or of the whole universe of types, under propositions as types), with PP and QQ substituted. One might more precisely write (P=Q)('P'='Q') here, with the quotation marks indicating that this is the name of the proposition, namely a term of the universe type, rather than the proposition/type itself.

On the other hand, the expression (PQ)(P \leftrightarrow Q) in homotopy type theory is the type of equivalences (PQ)(P \simeq Q) between the two propositions, hence the subtype of the function type (PQ)(P \to Q) on those terms that, in particular, have a homotopy inverse.

Hence propositional extensionality in type theory is the statement that

(P=Q)(PQ). ('P' = 'Q') \simeq (P \simeq Q) \,.

(e.g. Sozeau-Tabareau, section 3.2)

In homotopy type theory, the assertion of this equivalence is a special case of the univalence axiom which asserts this equivalence for all types PP,QQ, not necessarily propositions, with the identity type of the full universe of types on the left.

(e.g. Sozeau-Tabareau, section 3.9)


Specializing to the case where one of the propositions is ‘true’, George Boole can be taken (see Voevodsky 14, slide 8) to be talking about propositional extensionality when he writes (Boole 1853, p. 53):

If instead of the proposition, “The sun shines,” we say, “It is true that the sun shines,” we then speak not directly of things, but of a proposition concerning things, viz., of the proposition “The sun shines.” And, therefore, the proposition in which we thus speak is a secondary one. Every primary proposition may thus give rise to a secondary proposition, viz., to that secondary proposition which asserts its truth, or declares its falsehood.

Later this became Alfred Tarski‘s material adequacy condition, also known as Convention T:

any viable theory of truth must entail, for every sentence PP of a language, a sentence of the form:

P'P' is true if, and only if, PP.

(see Wikipedia – Semantic theory of truth – Tarski’s theory)

This may be regarded as the above equivalence of propositional extensionality for the case that QQ \coloneqq true:

(P=true)(Ptrue). ('P' = 'true') \simeq (P \simeq true) \,.

See also


  • George Boole, An Investigation of the Laws of Thought, (1853) (retyped pdf)

  • Matthieu Sozeau and Nicolas Tabareau, Univalence For Free (pdf)

  • Vladimir Voevodsky, Foundations of Mathematics: their past, present and future, Part II, (slides)

Last revised on January 2, 2024 at 23:56:19. See the history of this page for a list of all contributions to it.