Corollary 10.1.16 (Decidable equality implies being a set). Let \(X\) be an anima with decidable equality. Then \(X\) is a set.

Proof

By Hedberg’s lemma it suffices, for each \(x,y:X\), to construct a wildly constant map \(f\colon x=y \to x=y\). Decidable equality gives two cases.

  • • If \(p:x=y\), let \(f\) be the constant map with value \(p\).

  • • If \(e:x\neq y\), let \(f\) be the composite \(x=y \xrightarrow{e} \emptyset \to x=y\).

In the first case the map is constant by construction. In the second its domain is empty, so it is again wildly constant.

From Section 10.1, Sets and propositions.