Proposition 11.6.7 (Basic properties of \(n\)-finite animae). Let \(n:\N\) and let \(X\) be an anima.
(1) If \(X\) is \(n\)-finite, then it is \(n\)-truncated.
(2) If \(X\) is \(n\)-finite, then it is \((n+1)\)-finite.
(3) Being \(n\)-finite is invariant under equivalence.
(4) Finite coproducts and finite products of \(n\)-finite animae are \(n\)-finite.
Proof
All four statements follow by induction on \(n\). At height zero, the first statement is part of the definition, the second uses decidable equality of finite sets, and the remaining statements follow from Proposition 11.6.5. At the successor step, apply the induction hypothesis to the identity animae. The set of components remains finite under equivalence and under finite sums and products. For products, use \[ (x_1,x_2)=(y_1,y_2) \simeq (x_1=y_1)\times(x_2=y_2), \] and for coproducts use that identity animae between distinct summands are empty.