Proposition 11.6.5 (Finite sums, products, and choice). Let \(S\) be a finite set and let \(T\colon S\to\Set\) be a family of finite sets. Then the dependent sum \(\sum_{s:S}T(s)\) and the dependent product \(\prod_{s:S}T(s)\) are finite. Moreover, for any family of animae \(X\colon S\to\An\), the canonical map \[ \truncation{-1}{\prod_{s:S}X(s)} \longrightarrow \prod_{s:S}\truncation{-1}{X(s)} \] is an equivalence.

Proof

All three assertions are propositions, so we may choose a cardinal presentation of \(S\) and argue by induction on its cardinal. We first prove the final assertion. For the empty set it is immediate. Adjoining one element reduces it to the canonical equivalence \[ \truncation{-1}{A\times B} \simeq \truncation{-1}{A}\times\truncation{-1}{B}. \] This equivalence follows by applying the induction principle for propositional truncation twice.

Apply the resulting finite-choice statement to the anima of cardinal presentations of each \(T(s)\). We may now, merely, choose cardinal presentations of all the \(T(s)\) simultaneously. The assertions about the dependent sum and dependent product then reduce to the corresponding elementary cardinal calculations for standard finite sets.

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