This non-implication, Form 336-n \( \not \Rightarrow \) Form 224, 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: 491, whose string of implications is:
    43 \(\Rightarrow\) 8 \(\Rightarrow\) 9 \(\Rightarrow\) 336-n
  • A proven non-implication whose code is 3. In this case, it's Code 3: 242, Form 43 \( \not \Rightarrow \) Form 224 whose summary information is:
    Hypothesis Statement
    Form 43 <p> \(DC(\omega)\) (DC), <strong>Principle of Dependent Choices:</strong> If \(S\)  is  a relation on a non-empty set \(A\) and \((\forall x\in A) (\exists y\in A)(x S y)\)  then there is a sequence \(a(0), a(1), a(2), \ldots\) of elements of \(A\) such that \((\forall n\in\omega)(a(n)\mathrel S a(n+1))\).  See <a href="/articles/Tarski-1948">Tarski [1948]</a>, p 96, <a href="/articles/Levy-1964">Levy [1964]</a>, p. 136. </p>

    Conclusion Statement
    Form 224 <p> There is a partition of the real line into \(\aleph_1\) Borel sets \(\{B_\alpha: \alpha<\aleph_1\}\) such that for some \(\beta <\aleph_1\), \(\forall\alpha <\aleph_1\), \(B_{\alpha}\in G_{\beta}\). (\(G_\beta\) for \(\beta < \aleph_1\) is defined by induction, \(G_0=\{A: A\) is an open subset of \({\Bbb R}\}\) and for \(\beta > 0\), <ul type="none"> <li>\(G_\beta =\left\{\bigcup^\infty_{i=0}A_{i}: (\forall i\in\omega) (\exists\xi <\beta)(A_i\in G_\xi)\,\right\}\) if \(\beta\) is even and</li> <li>\(G_\beta = \left\{\bigcap^\infty_{i=0}A_{i}: (\forall i\in\omega) (\exists \xi < \beta)(A_{i}\in G_\xi)\,\right\}\) if \(\beta\) is odd.)</li> </ul> </p>

  • This non-implication was constructed without the use of this last code 2/1 implication

The conclusion Form 336-n \( \not \Rightarrow \) Form 224 then follows.

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

Name Statement
\(\cal M5(\aleph)\) Solovay's Model An inaccessible cardinal \(\aleph\) is collapsed to \(\aleph_1\) in the outer model and then \(\cal M5(\aleph)\) is the smallest model containing the ordinals and \(\Bbb R\)

Edit | Back