Implications

We have the following indirect implication of form equivalence classes:

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

Implication Reference
391 \(\Rightarrow\) 392 clear
392 \(\Rightarrow\) 393 clear
393 \(\Rightarrow\) 121 clear
121 \(\Rightarrow\) 33-n clear
33-n \(\Rightarrow\) 47-n clear
47-n \(\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
391:

\(C(\infty,LO)\): Every set of non-empty linearly orderable sets has a choice function.

392:

\(C(LO,LO)\): Every linearly ordered set of linearly orderable sets has a choice function.

393:

\(C(LO,WO)\): Every linearly ordered set of non-empty well orderable sets has a choice function.

121:

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

33-n:

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

47-n:

If \(n\in\omega-\{0,1\}\), \(C(WO,n)\): Every well ordered collection of \(n\)-element 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