let X, Y be non empty set ; card { [:X,{y}:] where y is Element of Y : verum } = card Y
set Z = { [:X,{y}:] where y is Element of Y : verum } ;
deffunc H1( object ) -> set = [:X,{$1}:];
ex f being Function st
( dom f = Y & ( for x being object st x in Y holds
f . x = H1(x) ) )
from FUNCT_1:sch 3();
then consider f being Function such that
A1:
dom f = Y
and
A2:
for x being object st x in Y holds
f . x = H1(x)
;
for y being object holds
( y in { [:X,{y}:] where y is Element of Y : verum } iff ex x being object st
( x in dom f & y = f . x ) )
then A6:
rng f = { [:X,{y}:] where y is Element of Y : verum }
by FUNCT_1:def 3;
for x1, x2 being object st x1 in dom f & x2 in dom f & f . x1 = f . x2 holds
x1 = x2
then
f is one-to-one
by FUNCT_1:def 4;
then
{ [:X,{y}:] where y is Element of Y : verum } ,Y are_equipotent
by A1, A6, WELLORD2:def 4;
hence
card { [:X,{y}:] where y is Element of Y : verum } = card Y
by CARD_1:5; verum