Lemma 12.1.5. The category \(\mathtt{hasInitial}(C)\) is a proposition.
Proof
Note that the type \(\mathtt{isEquiv}(C_{x/} \to C)\) is a proposition for every \(x\). So we get an embedding \(\mathtt{hasInitial}(C) \to C^{\simeq}\), and thus we obtain a full subcategory \(\lra{\mathtt{hasInitial}(C)} \hookrightarrow C\) consisting of all initial objects of \(C\). Notice that every morphism in this subcategory is automatically an isomorphism, hence it is actually equivalent to the anima \(\mathtt{hasInitial}(C)\). It remains to show that the functor \(\mathtt{hasInitial}(C) \to *\) is fully faithful, since all fully faithful functors are embeddings. The mapping animae on both sides are contractible by the defining property of initial objects.