let f be PartFunc of REAL,REAL; :: thesis: for g being Real st f is convergent_in+infty holds
( lim_in+infty f = g iff for g1 being Real st 0 < g1 holds
ex r being Real st
for r1 being Real st r < r1 & r1 in dom f holds
|.((f . r1) - g).| < g1 )
let g be Real; :: thesis: ( f is convergent_in+infty implies ( lim_in+infty f = g iff for g1 being Real st 0 < g1 holds
ex r being Real st
for r1 being Real st r < r1 & r1 in dom f holds
|.((f . r1) - g).| < g1 ) )
assume A1: f is convergent_in+infty ; :: thesis: ( lim_in+infty f = g iff for g1 being Real st 0 < g1 holds
ex r being Real st
for r1 being Real st r < r1 & r1 in dom f holds
|.((f . r1) - g).| < g1 )
thus ( lim_in+infty f = g implies for g1 being Real st 0 < g1 holds
ex r being Real st
for r1 being Real st r < r1 & r1 in dom f holds
|.((f . r1) - g).| < g1 ) :: thesis: ( ( for g1 being Real st 0 < g1 holds
ex r being Real st
for r1 being Real st r < r1 & r1 in dom f holds
|.((f . r1) - g).| < g1 ) implies lim_in+infty f = g )

proof

assume A2: lim_in+infty f = g ; :: thesis: for g1 being Real st 0 < g1 holds
ex r being Real st
for r1 being Real st r < r1 & r1 in dom f holds
|.((f . r1) - g).| < g1
given g1 being Real such that A3: 0 < g1 and
A4: for r being Real ex r1 being Real st
( r < r1 & r1 in dom f & |.((f . r1) - g).| >= g1 ) ; :: thesis: contradiction
defpred S₁[ Nat, Real] means ( $1 < $2 & $2 in dom f & |.((f . $2) - g).| >= g1 );
A5: for n being Element of NAT ex r being Element of REAL st S₁[n,r]

proof

let n be Element of NAT ; :: thesis: ex r being Element of REAL st S₁[n,r]
consider r being Real such that
A6: S₁[n,r] by A4;
reconsider r = r as Real ;
S₁[n,r] by A6;
hence ex r being Element of REAL st S₁[n,r] ; :: thesis: verum

end;

consider s being Real_Sequence such that
A7: for n being Element of NAT holds S₁[n,s . n] from FUNCT_2:sch 3(A5);

now :: thesis: for x being object st x in rng s holds
x in dom f

let x be object ; :: thesis: ( x in rng s implies x in dom f )
assume x in rng s ; :: thesis: x in dom f
then ex n being Element of NAT st s . n = x by FUNCT_2:113;
hence x in dom f by A7; :: thesis: verum

end;

then A8: rng s c= dom f ;

now :: thesis: for n being Nat holds s1 . n <= s . n

let n be Nat; :: thesis: s1 . n <= s . n
A9: n in NAT by ORDINAL1:def 12;
then n < s . n by A7;
hence s1 . n <= s . n by FUNCT_1:18, A9; :: thesis: verum

end;

then s is divergent_to+infty by Lm5, Th20, Th42;
then ( f /* s is convergent & lim (f /* s) = g ) by A1, A2, A8, Def12;
then consider n being Nat such that
A10: for m being Nat st n <= m holds
|.(((f /* s) . m) - g).| < g1 by A3, SEQ_2:def 7;
A11: n in NAT by ORDINAL1:def 12;
|.(((f /* s) . n) - g).| < g1 by A10;
then |.((f . (s . n)) - g).| < g1 by A8, FUNCT_2:108, A11;
hence contradiction by A7, A11; :: thesis: verum

end;

assume A12: for g1 being Real st 0 < g1 holds
ex r being Real st
for r1 being Real st r < r1 & r1 in dom f holds
|.((f . r1) - g).| < g1 ; :: thesis: lim_in+infty f = g
reconsider g = g as Real ;

now :: thesis: for s being Real_Sequence st s is divergent_to+infty & rng s c= dom f holds
( f /* s is convergent & lim (f /* s) = g )

let s be Real_Sequence; :: thesis: ( s is divergent_to+infty & rng s c= dom f implies ( f /* s is convergent & lim (f /* s) = g ) )
assume that
A13: s is divergent_to+infty and
A14: rng s c= dom f ; :: thesis: ( f /* s is convergent & lim (f /* s) = g )

A15: now :: thesis: for g1 being Real st 0 < g1 holds
ex n being Nat st
for m being Nat st n <= m holds
|.(((f /* s) . m) - g).| < g1

let g1 be Real; :: thesis: ( 0 < g1 implies ex n being Nat st
for m being Nat st n <= m holds
|.(((f /* s) . m) - g).| < g1 )
assume A16: 0 < g1 ; :: thesis: ex n being Nat st
for m being Nat st n <= m holds
|.(((f /* s) . m) - g).| < g1
consider r being Real such that
A17: for r1 being Real st r < r1 & r1 in dom f holds
|.((f . r1) - g).| < g1 by A12, A16;
consider n being Nat such that
A18: for m being Nat st n <= m holds
r < s . m by A13;
take n = n; :: thesis: for m being Nat st n <= m holds
|.(((f /* s) . m) - g).| < g1
let m be Nat; :: thesis: ( n <= m implies |.(((f /* s) . m) - g).| < g1 )
A19: s . m in rng s by VALUED_0:28;
A20: m in NAT by ORDINAL1:def 12;
assume n <= m ; :: thesis: |.(((f /* s) . m) - g).| < g1
then |.((f . (s . m)) - g).| < g1 by A14, A17, A18, A19;
hence |.(((f /* s) . m) - g).| < g1 by A14, FUNCT_2:108, A20; :: thesis: verum

end;

hence f /* s is convergent ; :: thesis: lim (f /* s) = g
hence lim (f /* s) = g by A15, SEQ_2:def 7; :: thesis: verum

end;

hence lim_in+infty f = g by A1, Def12; :: thesis: verum