defpred S1[ Nat] means F2() . $1 = F3() . $1;
A8: for n being Nat st S1[n] holds
S1[ succ n]
proof
let n be Nat; :: thesis: ( S1[n] implies S1[ succ n] )
assume F2() . n = F3() . n ; :: thesis: S1[ succ n]
then A9: P1[n,F2() . n,F3() . (succ n)] by A6;
P1[n,F2() . n,F2() . (succ n)] by A3;
hence S1[ succ n] by A7, A9; :: thesis: verum
end;
A10: S1[ 0 ] by A2, A5;
for n being Nat holds S1[n]
proof end;
then for x being object st x in omega holds
F2() . x = F3() . x ;
hence F2() = F3() by A1, A4, FUNCT_1:2; :: thesis: verum