Definition 11.6.6. Let \(X\) be an anima. We define recursively what it means for \(X\) to be \(n\)-finite, for \(n:\N\).

  1. (1) The anima \(X\) is \(0\)-finite if it is a finite set.

  2. (2) The anima \(X\) is \((n+1)\)-finite if its set of components \(\truncation{0}{X}\) is finite and, for every \(x,y:X\), the identity anima \(x=y\) is \(n\)-finite.

We denote the resulting proposition by \(\mathtt{isFinite}_n(X)\).

From Section 11.6, Finite and \(\pi\)-finite animae.