Type equivalence
Type
(A≃B)≡Σf:A→B isequiv(f) |
where
isequiv(f)≡(Σg:B→A(f∘g∼idB))×(Σg:B→A(h∘f∼idA))
where
(k∼l)≡Πx:C(k(x)=P(x)l(x))
where
P:C→U and k,l:Πx:CP(x).
Discussion
We see how equivalence of types (A≃B) eventually comes down to equality of terms.
(The univalence axiom then says that to find those term-equalities, one can construct an equivalence on of these terms.)
This is in analogy to how equivalences of categories (defined via natural isomorphisms) comes down to isomorphisms of objects.