Implications

We have the following indirect implication of form equivalence classes:

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

Implication Reference
107 \(\Rightarrow\) 62 clear
62 \(\Rightarrow\) 10 clear
10 \(\Rightarrow\) 80 clear
80 \(\Rightarrow\) 389 clear

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

Howard-Rubin Number Statement
107:  

M. Hall's Theorem: Let \(\{S(\alpha): \alpha\in A\}\) be a collection of finite subsets (of a set \(X\)) then if

(*) for each finite \(F \subseteq  A\) there is an injective choice function on \(F\)
then there is an injective choice function on \(A\). (That is, a 1-1 function \(f\) such that \((\forall\alpha\in A)(f(\alpha)\in S(\alpha))\).) (According to a theorem of P. Hall (\(*\)) is equivalent to \(\left |\bigcup_{\alpha\in F} S(\alpha)\right|\ge |F|\). P. Hall's theorem does not require the axiom of choice.)

62:

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

10:

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

80:

\(C(\aleph_{0},2)\):  Every denumerable set of  pairs has  a  choice function.

389:

\(C(\aleph_0,2,\cal P({\Bbb R}))\): Every denumerable family of two element subsets of \(\cal P({\Bbb R})\) has a choice function.  \ac{Keremedis} \cite{1999b}.

Comment:

Back