This non-implication, Form 167 \( \not \Rightarrow \) Form 84, whose code is 6, 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: 9946, whose string of implications is:
    379 \(\Rightarrow\) 167
  • A proven non-implication whose code is 5. In this case, it's Code 3: 722, Form 379 \( \not \Rightarrow \) Form 84 whose summary information is:
    Hypothesis Statement
    Form 379 <p> \(PKW(\infty,\infty,\infty)\): For every infinite family \(X\) of sets each of which has at least two elements, there is an infinite subfamily \(Y\) of \(X\) and a function \(f\) such that for all \(y\in Y\), \(f(y)\) is a non-empty proper subset of \(y\). </p>

    Conclusion Statement
    Form 84 <p> \(E(II,III)\) (<a href="/articles/Howard-Yorke-1989">Howard/Yorke [1989]</a>): \((\forall x)(x\) is \(T\)-finite  if and only if \(\cal P(x)\) is Dedekind finite). </p>

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

The conclusion Form 167 \( \not \Rightarrow \) Form 84 then follows.

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

Name Statement
\(\cal N3\) Mostowski's Linearly Ordered Model \(A\) is countably infinite;\(\precsim\) is a dense linear ordering on \(A\) without first or lastelements (\((A,\precsim) \cong (\Bbb Q,\le)\)); \(\cal G\) is the group of allorder automorphisms on \((A,\precsim)\); and \(S\) is the set of all finitesubsets of \(A\)

Edit | Back