Implications

We have the following indirect implication of form equivalence classes:

27 \(\Rightarrow\) 373-n
given by the following sequence of implications, with a reference to its direct proof:

Implication Reference
27 \(\Rightarrow\) 31 clear
31 \(\Rightarrow\) 32 L’axiome de M. Zermelo et son rˆole dans la th´eorie des ensembles et l’analyse, Sierpi'nski, W. 1918, Bull. Int. Acad. Sci. Cracovie Cl. Math. Nat.
32 \(\Rightarrow\) 10 clear
10 \(\Rightarrow\) 288-n clear
288-n \(\Rightarrow\) 373-n clear

Here are the links and statements of the form equivalence classes referenced above:

Howard-Rubin Number Statement
27:

\((\forall \alpha)( UT(\aleph_{0},\aleph_{\alpha}, \aleph_{\alpha}))\): The  union of denumerably many sets each of power \(\aleph_{\alpha }\) has power \(\aleph_{\alpha}\). Moore, G. [1982], p 36.

31:

\(UT(\aleph_{0},\aleph_{0},\aleph_{0})\): The countable union theorem:  The union of a denumerable set of denumerable sets is denumerable.

32:

\(C(\aleph_0,\le\aleph_0)\): Every denumerable set of non-empty countable sets  has a choice function.

10:

\(C(\aleph_{0},< \aleph_{0})\):  Every denumerable family of non-empty finite sets has a choice function.

288-n:

If \(n\in\omega-\{0,1\}\), \(C(\aleph_0,n)\): Every denumerable set of \(n\)-element sets has a choice function.

373-n:

(For \(n\in\omega\), \(n\ge 2\).) \(PC(\aleph_0,n,\infty)\): Every denumerable set of \(n\)-element sets has an infinite subset with a choice function.

Comment:

Back