We have the following indirect implication of form equivalence classes:

44 \(\Rightarrow\) 182
given by the following sequence of implications, with a reference to its direct proof:

Implication Reference
44 \(\Rightarrow\) 39 The Axiom of Choice, Jech, 1973b, page 120 theorem 8.1
39 \(\Rightarrow\) 8 clear
8 \(\Rightarrow\) 27 clear
27 \(\Rightarrow\) 31 clear
31 \(\Rightarrow\) 34 clear
34 \(\Rightarrow\) 104 clear
104 \(\Rightarrow\) 182 clear

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

Howard-Rubin Number Statement
44:

\(DC(\aleph _{1})\):  Given a relation \(R\) such that for every  subset \(Y\) of a set \(X\) with \(|Y| < \aleph_{1}\) there is an \(x \in  X\)  with \(Y \mathrel R x\), then there is a function \(f: \aleph_{1} \rightarrow  X\) such that \((\forall\beta < \aleph_{1}) (\{f(\gamma ): \gamma < b \} \mathrel R f(\beta))\).

39:

\(C(\aleph_{1},\infty)\): Every set \(A\) of non-empty sets such that \(\vert A\vert = \aleph_{1}\) has a choice function. Moore, G. [1982], p. 202.

8:

\(C(\aleph_{0},\infty)\):

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.

34:

\(\aleph_{1}\) is regular.

104:

There is a regular uncountable aleph. Jech [1966b], p 165 prob 11.26.

182:

There is an aleph whose cofinality is greater than \(\aleph_{0}\).

Comment:

Back