Bourbaki

Proposition 9

Tag 03M7, permanent. Cite it as [Bourbaki, Tag 03M7].

Theory of Sets, chapter III, § 5. Properties of integers

Let E\mathrm{E} and F\mathrm{F} be two sets, a\mathfrak{a} and b\mathfrak{b} their cardinals, ff a surjection of E\mathrm{E} onto F\mathrm{F} such that the sets f−1(y)\overset{-1}{f}(y), where y∈Fy \in \mathrm{F}, all have the same cardinal c\mathfrak{c}. Then a=bc\mathfrak{a} = \mathfrak{b}\mathfrak{c}.

For the family (f−1(y))y∈F(\overset{-1}{f}(y))_{y \in \mathrm{F}} is a partition of E\mathrm{E}, each element of which partition is a set of cardinal c\mathfrak{c}; hence the result (§ 3, no. 4, Proposition 6, Corollary 2).

Bourbaki sets the proof directly after the statement, and the corpus does not separate them, so what is above is the statement and its proof together.

Cited by

Cites

Transcribed from the printed edition, 2004, Springer. Not translated.