defpred S1[ Ordinal] means for X being set st X in Rank $1 holds
not X, Rank $1 are_equipotent ;
A1: for A being Ordinal st ( for B being Ordinal st B in A holds
S1[B] ) holds
S1[A]
proof
let A be Ordinal; :: thesis: ( ( for B being Ordinal st B in A holds
S1[B] ) implies S1[A] )

assume A2: for B being Ordinal st B in A holds
S1[B] ; :: thesis: S1[A]
let X be set ; :: thesis: ( X in Rank A implies not X, Rank A are_equipotent )
assume A3: X in Rank A ; :: thesis: not X, Rank A are_equipotent
A4: now end;
now end;
hence not X, Rank A are_equipotent by A3, A4, Lm2; :: thesis: verum
end;
A20: for A being Ordinal holds S1[A] from ORDINAL1:sch 2(A1);
let A be Ordinal; :: thesis: for X being set st X in Rank A holds
( not X, Rank A are_equipotent & card X in card (Rank A) )

let X be set ; :: thesis: ( X in Rank A implies ( not X, Rank A are_equipotent & card X in card (Rank A) ) )
assume A21: X in Rank A ; :: thesis: ( not X, Rank A are_equipotent & card X in card (Rank A) )
then A22: X c= Rank A by ORDINAL1:def 2;
A23: not X, Rank A are_equipotent by A20, A21;
A24: card X c= card (Rank A) by A22, CARD_1:27;
card X <> card (Rank A) by A23, CARD_1:21;
hence ( not X, Rank A are_equipotent & card X in card (Rank A) ) by A20, A21, A24, CARD_1:13; :: thesis: verum