This non-implication, Form 209 \( \not \Rightarrow \) Form 71-alpha, whose code is 4, is constructed around a proven non-implication as follows:

  • An (optional) implication of code 1 or code 2 is given. In this case, it's Code 2: 10166, whose string of implications is:
    31 \(\Rightarrow\) 209
  • A proven non-implication whose code is 3. In this case, it's Code 3: 125, Form 31 \( \not \Rightarrow \) Form 13 whose summary information is:
    Hypothesis Statement
    Form 31 <p>\(UT(\aleph_{0},\aleph_{0},\aleph_{0})\): <strong>The countable union theorem:</strong>  The union of a denumerable set of denumerable sets is denumerable. </p>

    Conclusion Statement
    Form 13 <p> Every Dedekind finite subset of \({\Bbb R}\) is finite. </p>

  • An (optional) implication of code 1 or code 2 is given. In this case, it's Code 2: 920, whose string of implications is:
    71-alpha \(\Rightarrow\) 9 \(\Rightarrow\) 13

The conclusion Form 209 \( \not \Rightarrow \) Form 71-alpha then follows.

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

Name Statement
\(\cal M1\) Cohen's original model Add a denumerable number of generic reals (subsets of \(\omega\)), \(a_1\), \(a_2\), \(\cdots\), along with the set \(b\) containing them

Edit | Back