Bourbaki

Example

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

Theory of Sets, chapter II, § 4. Union and intersection of a family of sets

For every non-empty set A, the family ({x})x∈A(\{x\})_{x \in \mathrm{A}} is a partition of A.

If (Xι)ι∈I(\mathrm{X}_\iota)_{\iota \in \mathrm{I}} is a partition of a set E, the mapping ι→Xι\iota \rightarrow \mathrm{X}_\iota of I onto the set F\mathfrak{F} of elements Xι\mathrm{X}_\iota of the partition is bijective. Hence, if F\mathfrak{F} is given, the partition is determined up to a one-to-one correspondence between index sets. Usually when we speak of a partition, it is the set of elements of the partition with which we are concerned.

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

Nothing.

Cites

Nothing.

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