You are on page 1of 1

Let A={x,y|x is not a subset of A,y is a subset of A}

B= {z| z is a subset of A}
To shew that
|B| <|A|
Proof:
Let s belongs to B
then s is a subset of A by the def of A
s belongs to A by the def of A
=> B is a suset of A
Let t belongs to A
Let t is not a subset of A
=> t does not belongs to B
THIS SHEWS THAT B is a PROPERsubset of A
This shews that Cantor theorem is not applicable if A SET A ={x,y| x is not a s
ubset of A,y is a subset of A}
where P(A) = B ={z|z is a subset of A}
Note when Cantor proved his theorem there were no M-K ,ZFC etc. theories,so afte
r this type of set it is required to develop an other New THEORT.
Let E={x|x is a subset of E} and F={y|yis a subset of E} then E=F, AND Cantor th
eorem s not applicable once again since F=P(E)
TO SHEW E=F
LET x belongs to E
=> x IS A SUBSET OF E
=> x belongs to F
E is a subset of F
Let y belongs to F
THEN y is a subset of E by def of F
=> y belongs to E by def of E
F is a subset of E
E=F , WHERE F IS P(E)
CANTOR THEOREM FAILS .

You might also like