let X be set ; card { {X,[x,X]} where x is Element of X : x in X } = card X
set uG = X;
set A = { {X,[x,X]} where x is Element of X : x in X } ;
deffunc H1( object ) -> set = {X,[$1,X]};
consider f being Function such that
A1:
dom f = X
and
A2:
for x being object st x in X holds
f . x = H1(x)
from FUNCT_1:sch 3();
then A6:
f is one-to-one
;
A7:
rng f = { {X,[x,X]} where x is Element of X : x in X }
proof
thus
rng f c= { {X,[x,X]} where x is Element of X : x in X }
XBOOLE_0:def 10 { {X,[x,X]} where x is Element of X : x in X } c= rng fproof
let y be
object ;
TARSKI:def 3 ( not y in rng f or y in { {X,[x,X]} where x is Element of X : x in X } )
assume
y in rng f
;
y in { {X,[x,X]} where x is Element of X : x in X }
then consider a being
object such that A8:
a in dom f
and A9:
f . a = y
by FUNCT_1:def 3;
y = {X,[a,X]}
by A8, A9, A1, A2;
hence
y in { {X,[x,X]} where x is Element of X : x in X }
by A8, A1;
verum
end;
thus
{ {X,[x,X]} where x is Element of X : x in X } c= rng f
verumproof
let a be
object ;
TARSKI:def 3 ( not a in { {X,[x,X]} where x is Element of X : x in X } or a in rng f )
assume
a in { {X,[x,X]} where x is Element of X : x in X }
;
a in rng f
then consider x being
Element of
X such that A10:
a = {X,[x,X]}
and A11:
x in X
;
f . x = a
by A10, A11, A2;
hence
a in rng f
by A1, A11, FUNCT_1:def 3;
verum
end;
end;
{ {X,[x,X]} where x is Element of X : x in X } ,X are_equipotent
by A1, A6, A7, WELLORD2:def 4;
hence
card { {X,[x,X]} where x is Element of X : x in X } = card X
by CARD_1:5; verum