Implications

We have the following indirect implication of form equivalence classes:

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

Implication Reference
359 \(\Rightarrow\) 20 clear
20 \(\Rightarrow\) 121
121 \(\Rightarrow\) 122 clear
122 \(\Rightarrow\) 250 clear

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

Howard-Rubin Number Statement
359:

If \(\{A_{x}: x\in S\}\) and \(\{B_{x}: x\in S\}\) are families  of pairwise disjoint sets and \( |A_{x}| \le |B_{x}|\) for all \(x\in S\), then \(|\bigcup_{x\in S}A_{x}| \le |\bigcup_{x\in S} B_{x}|\).

20:

If \(\{A_{x}: x \in S \}\) and \(\{B_{x}: x \in  S\}\) are families  of pairwise disjoint sets and \( |A_{x}| = |B_{x}|\) for all \(x\in S\), then \(|\bigcup_{x\in S}A_{x}| = |\bigcup_{x\in S} B_{x}|\). Moore [1982] (1.4.12 and 1.7.8).

121:

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

122:

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

250:

\((\forall n\in\omega-\{0,1\})(C(WO,n))\): For every natural number \(n\ge 2\), every well ordered family of \(n\) element sets has a choice function.

Comment:

Back