Proposition 5.4.1.5. Let $\operatorname{\mathcal{C}}$ be a $2$-category. Then the Duskin nerve $\operatorname{N}_{\bullet }^{\operatorname{D}}(\operatorname{\mathcal{C}})$ is an $(\infty ,2)$-category.
Proof. Condition $(1)$ of Definition 5.4.1.1 follows immediately from Theorem 2.3.2.5, and condition $(2)$ from Corollary 2.3.2.7. We will verify $(4)$; the proof of $(3)$ is similar. Suppose we are given an integer $n \geq 3$ and a map $\sigma _0: \Lambda ^{n}_{n} \rightarrow \operatorname{N}_{\bullet }^{\operatorname{D}}(\operatorname{\mathcal{C}})$. for which the restriction $\sigma _0|_{ \operatorname{N}_{\bullet }( \{ 0 < n-1 < n\} ) }$ is right-degenerate. We wish to show that $\sigma _0$ can be extended to an $n$-simplex of $\operatorname{N}_{\bullet }^{\operatorname{D}}(\operatorname{\mathcal{C}})$. We now consider three cases:
Suppose that $n = 3$. Then $\sigma _0$ can be identified with a collection of objects $\{ X_ i \} _{ 0 \leq i \leq 3}$, $1$-morphisms $\{ f_{ji}: X_ i \rightarrow X_ j \} _{0 \leq i < j \leq 3}$, and $2$-morphisms
\[ \mu _{321}: f_{32} \circ f_{21} \Rightarrow f_{31} \quad \quad \mu _{320}: f_{32} \circ f_{20} \Rightarrow f_{30} \quad \quad \mu _{310}: f_{31} \circ f_{10} \Rightarrow f_{30} \]in the $2$-category $\operatorname{\mathcal{C}}$. The assumption that $\sigma _0|_{ \operatorname{N}_{\bullet }( \{ 0 < n-1 < n\} ) }$ is right-degenerate guarantees that $X_2 = X_3$, that $f_{20} = f_{30}$, that the $1$-morphism $f_{32}$ is the identity $\operatorname{id}_{X_2}$, and that $\mu _{320}$ is the left unit constraint $\lambda _{ f_{20} }$. To extend $\sigma _0$ to a $3$-simplex of $\operatorname{N}_{\bullet }^{\operatorname{D}}$, we must show that there exists a $2$-morphism $\mu _{210}: f_{21} \circ f_{10} \Rightarrow f_{20}$ for which the diagram
5.36\begin{equation} \begin{gathered}\label{equation:3-simplex-of-Dusk} \xymatrix@R =50pt@C=50pt{ f_{32} \circ (f_{21} \circ f_{10} ) \ar@ {=>}[rr]^-{\alpha }_-{\sim } \ar@ {=>}[d]_{ \operatorname{id}_{ f_{32}} \circ \mu _{210} } & & ( f_{32} \circ f_{21} ) \circ f_{10} \ar@ {=>}[d]^{ \mu _{321} \circ \operatorname{id}_{ f_{10} }} \\ f_{32} \circ f_{20} \ar@ {=>}[dr]_{ \mu _{320} } & & f_{31} \circ f_{10} \ar@ {=>}[dl]^{ \mu _{310} } \\ & f_{30} & } \end{gathered} \end{equation}is commutative, where $\alpha = \alpha _{f_{32}, f_{21}, f_{10} }$ is the associativity constraint for the composition of $1$-morphisms in $\operatorname{\mathcal{C}}$ (Proposition 2.3.1.9). This commutativity can be rewritten as an equation
\[ \mu _{320}(\operatorname{id}_{ f_{32} } \circ \mu _{210}) = \mu _{310} (\mu _{321} \circ \operatorname{id}_{ f_{10}} ) \alpha . \]This equation has a unique solution, because $\mu _{320}$ is invertible and horizontal composition with $\operatorname{id}_{f_{32}}$ induces an equivalence of categories $\underline{\operatorname{Hom}}_{\operatorname{\mathcal{C}}}( X_0, X_2) \rightarrow \underline{\operatorname{Hom}}_{\operatorname{\mathcal{C}}}( X_0, X_3 )$.
Suppose that $n=4$. The restriction of $\sigma _0$ to the $2$-skeleton of $\Delta ^4$ can be identified with a collection of objects $\{ X_ i \} _{0 \leq i \leq 4}$, $1$-morphisms $\{ f_{ji}: X_ i \rightarrow X_ j \} _{0 \leq i < j \leq 4}$, and $2$-morphisms $\{ \mu _{kji}: f_{kj} \circ f_{ji} \Rightarrow f_{ki} \} _{0 \leq i < j < k \leq 4}$ in the $2$-category $\operatorname{\mathcal{C}}$. The assumption that $\sigma _0|_{ \operatorname{N}_{\bullet }(\{ 0 < n-1 < n\} ) }$ is right-degenerate guarantees that $X_3 = X_4$, that $f_{30} = f_{40}$, that the $1$-morphism $f_{43}$ is the identity $\operatorname{id}_{X_3}$, and that $\mu _{430}$ is the left unit constraint $\lambda _{ f_{30} }$. Consider the diagram
\[ \xymatrix@C =0pt{ f_{43} (f_{31} f_{10} ) \ar@ {=>}[rrrr]^{\sim } \ar@ {=>}[ddddd]^{ \mu _{310} } & & & & (f_{43} f_{31}) f_{10} \ar@ {=>}[ddddd]^{\mu _{431} } \\ & f_{43}( (f_{32} f_{21} ) f_{10} ) \ar@ {=>}[ul]_{\mu _{321}} \ar@ {=>}[rr]^{\sim } & & (f_{43} (f_{32} f_{21})) f_{10} \ar@ {=>}[ur]^{\mu _{321}} \ar@ {=>}[d]^{\sim } & \\ & f_{43} ( f_{32} (f_{21} f_{10} ) ) \ar@ {=>}[u]^{\sim } \ar@ {=>}[dr]^{ \sim } \ar@ {=>}[d]^{\mu _{210}} & & (( f_{43} f_{32}) f_{21}) f_{10} \ar@ {=>}[d]^{\mu _{432} } & \\ & f_{43} ( f_{32} f_{20} ) \ar@ {=>}[d]^{\sim } \ar@ {=>}[ddl]_{ \mu _{320} } & (f_{43} f_{32} ) (f_{21} f_{10}) \ar@ {=>}[dl]_{\mu _{210} } \ar@ {=>}[dr]^{ \mu _{432} } \ar@ {=>}[ur]^{\sim } & ( f_{42} f_{21} ) f_{10} \ar@ {=>}[ddr]^{ \mu _{421} } \ar@ {=>}[d]_-{\sim } & \\ & (f_{43} f_{32} ) f_{20} \ar@ {=>}[r]_-{\mu _{432}} & f_{42} f_{20} \ar@ {=>}[d]^{\mu _{420}} & f_{42} (f_{21} f_{10} ) \ar@ {=>}[l]^-{\mu _{210}} & \\ f_{43} f_{30} \ar@ {=>}[rr]^{\mu _{430}}_-{\sim } & & f_{04} & & f_{41} f_{10}; \ar@ {=>}[ll]_{ \mu _{410} } } \]in the category $\underline{\operatorname{Hom}}_{\operatorname{\mathcal{C}}}(X_0, X_4)$, where the unlabeled $2$-morphisms are given by the associativity constraints. Note that the $4$-cycles in this diagram commute by functoriality, and the central $5$-cycle commutes by the pentagon identity of $\operatorname{\mathcal{C}}$. Our assumption that $\sigma _0$ is defined on the horn $\Lambda ^{4}_{4}$ guarantees that pentagonal cycles on the right and bottom of the diagram are commutative and that the outer cycle commutes. Since the $2$-morphism $\mu _{430}$ is invertible, a diagram chase shows that the pentagonal cycle on the left of the diagram also commutes. Since $f_{43}$ is an identity $1$-morphism, horizontal composition with $f_{43}$ is isomorphic to the identity (via the left unit constraint of Construction 2.2.1.11) and is therefore faithful. It follows that the diagram (5.36) is commutative, so that $\sigma _0$ extends (uniquely) to a $4$-simplex of $\operatorname{N}_{\bullet }^{\operatorname{D}}(\operatorname{\mathcal{C}})$.
If $n \geq 5$, then the horn $\Lambda ^{n}_{n}$ contains the $3$-skeleton of $\Delta ^ n$. In this case, the morphism $\sigma _0: \Lambda ^ n_ n \rightarrow \operatorname{N}_{\bullet }^{\operatorname{D}}(\operatorname{\mathcal{C}})$ extends uniquely to an $n$-simplex of $\operatorname{N}_{\bullet }^{\operatorname{D}}(\operatorname{\mathcal{C}})$ by virtue of Corollary 2.3.1.10.