Theorem 10.4.3 (Rigidity of the simplices). The functor \([-]\colon \N \to \Cat^{\simeq}\) is an embedding.
Proof
Since every simplex and the empty category are posets, Proposition 10.4.2 gives equivalences, for all \(m,n:\N\), \[ \Equiv([m+1],[n+1])\simeq\Equiv([m],[n]). \] Taking one of the two posets to be empty also gives \begin{align*} \Equiv([m+1],[0])&\simeq\Equiv([m],\emptyset)\simeq\emptyset,\\ \Equiv([0],[n+1])&\simeq\Equiv(\emptyset,[n])\simeq\emptyset, \end{align*} since every simplex has a cone point and is therefore nonempty. Finally, \(\Equiv([0],[0])\) is contractible. Double induction shows that \(\Equiv([m],[n])\) is contractible when \(m=n\) and empty otherwise.
Since \(\N\) is a set with decidable equality, the identity anima \(m=n\) has the same description. Consequently, the canonical map \[ (m=n)\longrightarrow\Equiv([m],[n]) \] is an equivalence for every \(m,n:\N\). The fiberwise characterization of embeddings now proves the claim.