LET A =/= empty set.........................

C-1
LET A=/= SET OF ALL SETS..............C-2
LET B = {b,such that b is a subset of A}---------------C-3
LET a belongs to A => a does not belong to B..................C-4
LET b belongs to B => b does not belong to A ..................C-5
THEASE ARE THE BASIC 5 CONDITIONS
LET c de a Bijective function such that c:A -------->B := c(a) =b, c(A)=B
LET B1,B2, be 2 subsets of A
WHERE B1 = {b1,such that b1 =c(a1), a1 belongs to A,a1 does not belong to b1}
B2 = {b2,such that b2 =c(a2), a1 belongs to A,a2 belongs to b1}
As c is a bijective function then c -1 exists
Let c-1 :B1 ---------->A := c-1(B1) IS A SUBSET OF A say A1,c-1(b1) =a1,a1 belongs to A1
Let c-1 :B2 ---------->A := c-1(B2) IS A SUBSET OF A say A2,c-1(b2) =a2,a1 belongs to A2
=> c-1(B1)=A1
=>c-1(B2) =A2
bY THE DEFINATION OF A1 ,A1 is a subset of A , hence A1 belongs to B
If A1 belongs to B then it either belongs to B1 or B2
SINCE IT IS OBVIOUS that B1UB2 =B, and B1 intersection B2 is an empty set.
i.e B1 and B2 are partitions on B
If A1 belongs to B1 then there exists e1 belongs to A1 such that c(e1)=A1
BUT IF e1 belongs a A1 =c(e1) then e1 does not belong to c(e1)=A1
THIS IS A CONTRADICTION
IT DOES NOT BELONGS TO B1
If A1 belongs to B2 THEN THERE EXISTS e2 belongs to A2 such that c(e2) =A1
BUT ACCORDING TO DEFINATION OF B2 ,e2 belongs to c(e2) =A1.
and e2 belongs to A1.
ACCORDING TO DEFINATION OF A1, c(e2) belongs to B1
THIS IMPLIES THAT c(e2) belongs to B1 AND B2.
THIS IS A CONTRADICTION since B1 and B2 are mutually DISJOINT subsets of Set B
To shew that B1 U B2 =B
Let x belongs to B1 UB2
THEN x belongs to either B1 OR B2
IF x BELONGS TO B1 then x belongs to B since B1 is a Subset of B
IF x BELONGS TO B2 then x belongs to B since B2 is a Subset of B
HENCE B1 U B2 is a Subset of B
LET y BELONGS TO B.
THEN y = c(m) .where m belongs to A.
IF m belongs to A then either m belongs to c(m) or m does not belongs to c(m)
IF m belongs to c(m) then c(m) belongs to B1.
IF c(m) belongs to B1 then c(m) belongs to B1U B2
Similarly if m does not belongs to c(m) then c(m) belongs to B2.
IF c(m) belongs to B2 then c(m) belongs to B1 U B2 1
This implies that y belongs to B1 U B2
THIS IMPLIES THAT B is a Subset of B1 UB2
HENCE B1 UB2 = B
To shew that B1 intersection B2 = EMPTY SET
Let z belongs to B1 INTERSECTION B2
Then z belongs to B1 and B2,WHERE EACH SET IS A SUB SET OF B
This implies that z = c(n) for some n belongs to A
By defination of B1 n belongs to z, and By defination of B2 n does not
belongs to z, where z = c(n).
THIS IS A CONTRADICTION.
hENCE A BIJECTION DOES NOT EXIST.
THIS IMPLIES THAT |A| IS LESS THAN | P(A)| IF a is not the sets of all sets.
If one of the basic condition is not satisfied the theorem may not be valid
IF THE SET A IS THE SET OF ALL SETS THEN C-2 is violated.
THE THEOREM IS NOT VALID IF SET A IS THE SET OF ALL SETS.
To Shew that P(A) = {X, such that X IS A SUBSET OF A} is a subset of A, IF a IA is a SET OF all
sets
Let A IS A Set of all sets.
LET E1 = { p, such that p is a subset of A}.
As each element of E1 is a set then each element of E1 belongs to A, SINCE A IS
THE SET OF ALL SETS.
IMPLIES THAT p belongs to A
IMPLIES THAT E1 Iis a Subset of A ,IF a IS A SET OF ALL SETS.
Hence
P(A) is a subset of A if A IS THE SET OF ALL SETS.
HENCE IF A is the set of all sets then |P(A)| is less than or equal to |A|
Not the readers may check the validity of the theorem by relaxing other basic conditions .
Q.E.D