let Y be non empty set ; for PA, PB being a_partition of Y holds
( PA '<' PB iff ERl PA c= ERl PB )
let PA, PB be a_partition of Y; ( PA '<' PB iff ERl PA c= ERl PB )
set RA = ERl PA;
set RB = ERl PB;
assume A7:
ERl PA c= ERl PB
; PA '<' PB
for x being set st x in PA holds
ex y being set st
( y in PB & x c= y )
proof
let x be
set ;
( x in PA implies ex y being set st
( y in PB & x c= y ) )
assume A9:
x in PA
;
ex y being set st
( y in PB & x c= y )
then A10:
x <> {}
by EQREL_1:def 6;
consider x0 being
Element of
x;
set y =
{ z where z is Element of Y : [x0,z] in ERl PB } ;
A11:
x c= { z where z is Element of Y : [x0,z] in ERl PB }
consider x1 being
Element of
x;
[x0,x1] in ERl PA
by A9, A10, Def6;
then consider B being
Subset of
Y such that A15:
B in PB
and A16:
x0 in B
and
x1 in B
by A7, Def6;
A17:
{ z where z is Element of Y : [x0,z] in ERl PB } c= B
B c= { z where z is Element of Y : [x0,z] in ERl PB }
then
{ z where z is Element of Y : [x0,z] in ERl PB } = B
by A17, XBOOLE_0:def 10;
hence
ex
y being
set st
(
y in PB &
x c= y )
by A11, A15;
verum
end;
hence
PA '<' PB
by SETFAM_1:def 2; verum