Bourbaki

Corollary 2

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

Theory of Sets, chapter III, § 4. Natural integers. Finite sets

If X is a subset of a finite set E and X ≠\neq E, then

Card (X) < Card (E).\mathrm{Card}\ (\mathrm{X})\ <\ \mathrm{Card}\ (\mathrm{E}).

For X is contained in the complement X′' of a subset of E consisting of a single element; we have Card (X)⩽Card (X′)\mathrm{Card}\,(\mathrm{X}) \leqslant \mathrm{Card}\,(\mathrm{X}') and Card (E)=Card (X′)+1\mathrm{Card}\,(\mathrm{E}) = \mathrm{Card}\,(\mathrm{X}') + 1, hence (Proposition 2) Card (X′)<Card (E)\mathrm{Card}\,(\mathrm{X}') < \mathrm{Card}\,(\mathrm{E}) and a fortiori Card (X)<Card (E)\mathrm{Card}\,(\mathrm{X}) < \mathrm{Card}\,(\mathrm{E}).

Definition 1 shows that, conversely, if E is a set such that

Card (X)<Card (E)\mathrm{Card}\ (\mathrm{X}) < \mathrm{Card}\ (\mathrm{E})

for every subset X of E such that X ≠\neq E, then E is finite.

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.