This non-implication,
Form 357 \( \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)
Hypothesis | Statement |
---|---|
Form 322 | <p> \(KW(WO,\infty)\), <strong>The Kinna-Wagner Selection Principle for a well ordered family of sets:</strong> For every well ordered set \(M\) there is a function \(f\) such that for all \(A\in M\), if \(|A|>1\) then \(\emptyset\neq f(A)\subsetneq A\). (See <a href="/form-classes/howard-rubin-15">Form 15</a>). </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> |
The conclusion Form 357 \( \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\) |