let A be Ordinal; :: thesis: for X being set st X is epsilon-transitive & A in the_rank_of X holds
ex Y being set st
( Y in X & the_rank_of Y = A )

let X be set ; :: thesis: ( X is epsilon-transitive & A in the_rank_of X implies ex Y being set st
( Y in X & the_rank_of Y = A ) )

assume A1: ( X is epsilon-transitive & A in the_rank_of X ) ; :: thesis: ex Y being set st
( Y in X & the_rank_of Y = A )

assume A2: for Y being set holds
( not Y in X or not the_rank_of Y = A ) ; :: thesis: contradiction
defpred S2[ Ordinal] means ex Y being set st
( A in $1 & Y in X & the_rank_of Y = $1 );
A3: ex B being Ordinal st S2[B]
proof
assume A4: for B being Ordinal
for Y being set st A in B & Y in X holds
the_rank_of Y <> B ; :: thesis: contradiction
X c= Rank A
proof end;
then the_rank_of X c= A by CLASSES1:73;
hence contradiction by A1, ORDINAL1:7; :: thesis: verum
end;
consider B being Ordinal such that
A6: S2[B] and
A7: for C being Ordinal st S2[C] holds
B c= C from ORDINAL1:sch 1(A3);
consider Y being set such that
A8: ( A in B & Y in X & the_rank_of Y = B ) by A6;
Y c= Rank A
proof end;
then the_rank_of Y c= A by CLASSES1:73;
hence contradiction by A8, ORDINAL1:7; :: thesis: verum