Proposition 11.6.3 (Finite sets and finite enumerations). A set is finite if and only if it is finitely enumerable and has decidable equality.
Proof
The standard sets \(\{1,\ldots,n\}\) have decidable equality, by induction on \(n\). Hence a cardinal presentation of \(S\) gives both a finite enumeration and decidable equality on \(S\). These are properties of \(S\), so the same conclusion follows from the mere existence of a cardinal presentation.
Conversely, assume that \(S\) has decidable equality. Given a finite enumeration \(f\colon\{1,\ldots,n\}\to S\), we may remove repetitions from the list \(f(1),\ldots,f(n)\): at each step, decidable equality determines whether the next value has already occurred. This produces a natural number \(m\), an embedding \(\{1,\ldots,m\}\to S\), and the same image as \(f\). Since \(f\) is a cover, the resulting embedding is also a cover and hence an equivalence by Proposition 11.2.10. It is therefore a cardinal presentation of \(S\). Again, the desired conclusion is a proposition, so a merely given finite enumeration suffices.