let X be set ; :: thesis: ( X is epsilon-transitive implies for A being Ordinal st A <> {} holds
Tarski-Class X,A is epsilon-transitive )

assume A1: for Y being set st Y in X holds
Y c= X ; :: according to ORDINAL1:def 2 :: thesis: for A being Ordinal st A <> {} holds
Tarski-Class X,A is epsilon-transitive

defpred S1[ Ordinal] means ( $1 <> {} implies Tarski-Class X,$1 is epsilon-transitive );
A2: 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 that
A3: for B being Ordinal st B in A holds
S1[B] and
A4: A <> {} ; :: thesis: Tarski-Class X,A is epsilon-transitive
let Y be set ; :: according to ORDINAL1:def 2 :: thesis: ( not Y in Tarski-Class X,A or Y c= Tarski-Class X,A )
assume A5: Y in Tarski-Class X,A ; :: thesis: Y c= Tarski-Class X,A
A6: now
given B being Ordinal such that A7: A = succ B ; :: thesis: Y c= Tarski-Class X,A
A8: B in A by A7, ORDINAL1:10;
A9: B c= A by A8, ORDINAL1:def 2;
A10: S1[B] by A3, A7, ORDINAL1:10;
A11: Tarski-Class X,B c= Tarski-Class X,A by A9, Th19;
A12: now
assume A13: not Y c= Tarski-Class X,B ; :: thesis: Y c= Tarski-Class X,A
consider Z being set such that
A14: Z in Tarski-Class X,B and
A15: ( Y c= Z or Y = bool Z ) by A5, A7, A13, Th13;
A16: now
assume A17: Y = bool Z ; :: thesis: Y c= Tarski-Class X,A
thus Y c= Tarski-Class X,A :: thesis: verum
proof
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in Y or x in Tarski-Class X,A )
assume A18: x in Y ; :: thesis: x in Tarski-Class X,A
thus x in Tarski-Class X,A by A7, A14, A17, A18, Th13; :: thesis: verum
end;
end;
A19: now end;
thus Y c= Tarski-Class X,A by A15, A16, A19; :: thesis: verum
end;
thus Y c= Tarski-Class X,A by A11, A12, XBOOLE_1:1; :: thesis: verum
end;
A32: now end;
thus Y c= Tarski-Class X,A by A6, A32; :: thesis: verum
end;
thus for A being Ordinal holds S1[A] from ORDINAL1:sch 2(A2); :: thesis: verum