let m be Nat; :: thesis: for f being Function holds iter (f,(m + 1)) c= f [*]
let f be Function; :: thesis: iter (f,(m + 1)) c= f [*]
set RH = f [*] ;
defpred S₁[ Nat] means iter (f,($1 + 1)) c= f [*] ;
B0: S₁[ 0 ]

proof

C0: iter (f,1) = f by FUNCT_7:70;
thus S₁[ 0 ] by C0, LANG1:18; :: thesis: verum

end;

B1: for n being Nat st S₁[n] holds
S₁[n + 1]

proof

let n be Nat; :: thesis: ( S₁[n] implies S₁[n + 1] )
assume S₁[n] ; :: thesis: S₁[n + 1]
then ( iter (f,(n + 1)) c= f [*] & f c= f [*] ) by LANG1:18;
then C0: (iter (f,(n + 1))) * f c= (f [*]) * (f [*]) by RELAT_1:31;
(f [*]) * (f [*]) c= f [*] by RELAT_2:27;
then (iter (f,(n + 1))) * f c= f [*] by C0, XBOOLE_1:1;
hence S₁[n + 1] by FUNCT_7:69; :: thesis: verum

end;

for n being Nat holds S₁[n] from NAT_1:sch 2(B0, B1);
hence iter (f,(m + 1)) c= f [*] ; :: thesis: verum