Lemma 11.3.7 (Truncation levels are cumulative). Let \(-2 \leq n \leq m\). Then every \(n\)-truncated morphism is also \(m\)-truncated.

Proof

It suffices to prove the case \(m=n+1\). Induct on \(n\): the diagonal of an equivalence is an equivalence, and the induction step follows by applying the induction hypothesis to the relative diagonal.

From Section 11.3, Truncated categories and functors.