Proposition 5
Tag 03NB, permanent. Cite it as [Bourbaki, Tag 03NB].
Theory of Sets, chapter III, § 6. Infinite sets
The set F(E) of finite subsets of an infinite set E is equipotent to E.
For each integer n, let Fn denote the set of subsets of E which have n elements. For each X∈Fn there exists a bijection of [1,n] onto X. Hence the cardinal of Fn is at most equal to that of the set of mappings of [1,n] into E, i.e., to Card(En)=Card(E) (no. 3, Theorem 2, Corollary 1). Therefore
Card(F(E))=n∈N∑Card(Fn)⩽Card(E)Card(N)=Card(E).
On the other hand, since x→{x} is an injective mapping of E into F(E), we have Card(E)⩽Card(F(E)).
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