Implications

This non-implication, Form 170 \( \not \Rightarrow \) Form 146, 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: 6906, whose string of implications is:
    337 \(\Rightarrow\) 92 \(\Rightarrow\) 170
  • A proven non-implication whose code is 5. In this case, it's Code 3: 689, Form 337 \( \not \Rightarrow \) Form 146 whose summary information is:
    Hypothesis Statement
    Form 337 <p> \(C(WO\), <strong>uniformly linearly ordered</strong>):  If \(X\) is a well ordered collection of non-empty sets and there is a function \(f\) defined on \(X\) such that for every \(x\in X\), \(f(x)\) is a linear ordering of \(x\), then there is a choice function for \(X\). </p>

    Conclusion Statement
    Form 146 <p> \(A(F,A1)\): For every \(T_2\) topological space \((X,T)\), if \(X\) is a continuous finite to one image of an A1 space then \((X,T)\) is  an A1 space. (\((X,T)\) is A1 means if \(U \subseteq  T\) covers \(X\) then \(\exists f : X\rightarrow U\) such that \((\forall x\in X) (x\in f(x)).)\) </p>

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

The conclusion Form 170 \( \not \Rightarrow \) Form 146 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\)

Edit | Back