ScalingStacks

Proof.

Consider the commuting diagram where we have used that truncated and connected maps are stable under pullback. By Lemma 5.2.4, the map \(A \rightarrow B \times_D C\) is both \(n\)-connected and \(n\)-truncated, and so is an equivalence. ◻