This non-implication, Form 32 \( \not \Rightarrow \) Form 215, whose code is 6, is constructed around a proven non-implication as follows:
Note: This non-implication is actually a code 4, as this non-implication satisfies the transferability criterion. Click Transfer details for all the details)

  • An (optional) implication of code 1 or code 2 is given. In this case, it's Code 2: 1709, whose string of implications is:
    16 \(\Rightarrow\) 352 \(\Rightarrow\) 32
  • A proven non-implication whose code is 5. In this case, it's Code 3: 10, Form 16 \( \not \Rightarrow \) Form 64 whose summary information is:
    Hypothesis Statement
    Form 16 <p> \(C(\aleph_{0},\le 2^{\aleph_{0}})\):  Every denumerable collection of non-empty sets  each with power \(\le  2^{\aleph_{0}}\) has a choice function. </p>

    Conclusion Statement
    Form 64 <p> \(E(I,Ia)\) There are no amorphous sets. (Equivalently, every infinite set is the union of two disjoint infinite sets.) </p>

  • An (optional) implication of code 1 or code 2 is given. In this case, it's Code 2: 6282, whose string of implications is:
    215 \(\Rightarrow\) 83 \(\Rightarrow\) 64

The conclusion Form 32 \( \not \Rightarrow \) Form 215 then follows.

Finally, the
List of models where hypothesis is true and the conclusion is false:

Name Statement
\(\cal N1\) The Basic Fraenkel Model The set of atoms, \(A\) is denumerable; \(\cal G\) is the group of all permutations on \(A\); and \(S\) isthe set of all finite subsets of \(A\)
\(\cal N24\) Hickman's Model I This model is a variation of \(\cal N2\)
\(\cal N24(n)\) An extension of \(\cal N24\) to \(n\)-element sets, \(n>1\).\(A=\bigcup B\), where \( B=\{b_i: i\in\omega\}\) is a pairwise disjoint setof \(n\)-element sets \(\cal G\) is the group of all permutations of \(A\)which are permutations of \(B\); and \(S\) is the set of all finite subsets of\(A\)
\(\cal N26\) Brunner/Pincus Model, a variation of \(\cal N2\) The set ofatoms \(A=\bigcup_{n\in\omega} P_n\), where the \(P_n\)'s are pairwisedisjoint denumerable sets; \(\cal G\) is the set of all permutations\(\sigma\) on \(A\) such that \(\sigma(P_n)=P_n\), for all \(n\in\omega\); and \(S\)is the set of all finite subsets of \(A\)

Edit | Back