defpred S1[ Ordinal] means ( $1 is natural implies P1[$1] );
A3: S1[ {} ] by A1;
A4: now
let A be Ordinal; :: thesis: ( S1[A] implies S1[ succ A] )
assume A5: S1[A] ; :: thesis: S1[ succ A]
now end;
hence S1[ succ A] ; :: thesis: verum
end;
A6: now
let A be Ordinal; :: thesis: ( A <> {} & A is limit_ordinal & ( for B being Ordinal st B in A holds
S1[B] ) implies S1[A] )

A7: {} c= A ;
assume A <> {} ; :: thesis: ( A is limit_ordinal & ( for B being Ordinal st B in A holds
S1[B] ) implies S1[A] )

then {} c< A by A7, XBOOLE_0:def 8;
then A8: {} in A by ORDINAL1:21;
assume A is limit_ordinal ; :: thesis: ( ( for B being Ordinal st B in A holds
S1[B] ) implies S1[A] )

then ( omega c= A & not A in A ) by A8, ORDINAL1:def 12;
then not A in omega ;
hence ( ( for B being Ordinal st B in A holds
S1[B] ) implies S1[A] ) by ORDINAL1:def 13; :: thesis: verum
end;
for A being Ordinal holds S1[A] from ORDINAL2:sch 1(A3, A4, A6);
hence P1[F1()] ; :: thesis: verum