This non-implication, Form 132 \( \not \Rightarrow \) Form 107, 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: 9938, whose string of implications is:
    380 \(\Rightarrow\) 132
  • A proven non-implication whose code is 5. In this case, it's Code 3: 742, Form 380 \( \not \Rightarrow \) Form 146 whose summary information is:
    Hypothesis Statement
    Form 380 <p> \(PC(\infty,WO,\infty)\):  For every infinite family of non-empty well orderable sets, there is an infinite subfamily \(Y\) of \(X\) which has a choice function. </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>

  • An (optional) implication of code 1 or code 2 is given. In this case, it's Code 2: 4796, whose string of implications is:
    107 \(\Rightarrow\) 62 \(\Rightarrow\) 146

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