let x0 be Real; :: thesis: for f being PartFunc of REAL,REAL st ( f is_divergent_to+infty_in x0 or f is_divergent_to-infty_in x0 ) & ( for r1, r2 being Real st r1 < x0 & x0 < r2 holds
ex g1, g2 being Real st
( r1 < g1 & g1 < x0 & g1 in dom f & g2 < r2 & x0 < g2 & g2 in dom f & f . g1 <> 0 & f . g2 <> 0 ) ) holds
( f ^ is_convergent_in x0 & lim ((f ^),x0) = 0 )

let f be PartFunc of REAL,REAL; :: thesis: ( ( f is_divergent_to+infty_in x0 or f is_divergent_to-infty_in x0 ) & ( for r1, r2 being Real st r1 < x0 & x0 < r2 holds
ex g1, g2 being Real st
( r1 < g1 & g1 < x0 & g1 in dom f & g2 < r2 & x0 < g2 & g2 in dom f & f . g1 <> 0 & f . g2 <> 0 ) ) implies ( f ^ is_convergent_in x0 & lim ((f ^),x0) = 0 ) )

A1: (dom f) \ (f " {0}) = dom (f ^) by RFUNCT_1:def 2;
assume A2: ( f is_divergent_to+infty_in x0 or f is_divergent_to-infty_in x0 ) ; :: thesis: ( ex r1, r2 being Real st
( r1 < x0 & x0 < r2 & ( for g1, g2 being Real holds
( not r1 < g1 or not g1 < x0 or not g1 in dom f or not g2 < r2 or not x0 < g2 or not g2 in dom f or not f . g1 <> 0 or not f . g2 <> 0 ) ) ) or ( f ^ is_convergent_in x0 & lim ((f ^),x0) = 0 ) )

A3: now :: thesis: for seq being Real_Sequence st seq is convergent & lim seq = x0 & rng seq c= (dom (f ^)) \ {x0} holds
( (f ^) /* seq is convergent & lim ((f ^) /* seq) = 0 )
let seq be Real_Sequence; :: thesis: ( seq is convergent & lim seq = x0 & rng seq c= (dom (f ^)) \ {x0} implies ( (f ^) /* seq is convergent & lim ((f ^) /* seq) = 0 ) )
assume that
A4: seq is convergent and
A5: lim seq = x0 and
A6: rng seq c= (dom (f ^)) \ {x0} ; :: thesis: ( (f ^) /* seq is convergent & lim ((f ^) /* seq) = 0 )
rng seq c= dom (f ^) by A6, XBOOLE_1:1;
then A7: rng seq c= dom f by A1, XBOOLE_1:1;
A8: rng seq c= (dom f) \ {x0}
proof
let x be object ; :: according to TARSKI:def 3 :: thesis: ( not x in rng seq or x in (dom f) \ {x0} )
assume A9: x in rng seq ; :: thesis: x in (dom f) \ {x0}
then not x in {x0} by A6, XBOOLE_0:def 5;
hence x in (dom f) \ {x0} by A7, A9, XBOOLE_0:def 5; :: thesis: verum
end;
now :: thesis: ( (f ^) /* seq is convergent & lim ((f ^) /* seq) = 0 )end;
hence ( (f ^) /* seq is convergent & lim ((f ^) /* seq) = 0 ) ; :: thesis: verum
end;
assume A14: for r1, r2 being Real st r1 < x0 & x0 < r2 holds
ex g1, g2 being Real st
( r1 < g1 & g1 < x0 & g1 in dom f & g2 < r2 & x0 < g2 & g2 in dom f & f . g1 <> 0 & f . g2 <> 0 ) ; :: thesis: ( f ^ is_convergent_in x0 & lim ((f ^),x0) = 0 )
now :: thesis: for r1, r2 being Real st r1 < x0 & x0 < r2 holds
ex g1, g2 being Real st
( r1 < g1 & g1 < x0 & g1 in dom (f ^) & g2 < r2 & x0 < g2 & g2 in dom (f ^) )
let r1, r2 be Real; :: thesis: ( r1 < x0 & x0 < r2 implies ex g1, g2 being Real st
( r1 < g1 & g1 < x0 & g1 in dom (f ^) & g2 < r2 & x0 < g2 & g2 in dom (f ^) ) )

assume that
A15: r1 < x0 and
A16: x0 < r2 ; :: thesis: ex g1, g2 being Real st
( r1 < g1 & g1 < x0 & g1 in dom (f ^) & g2 < r2 & x0 < g2 & g2 in dom (f ^) )

consider g1, g2 being Real such that
A17: r1 < g1 and
A18: g1 < x0 and
A19: g1 in dom f and
A20: g2 < r2 and
A21: x0 < g2 and
A22: g2 in dom f and
A23: f . g1 <> 0 and
A24: f . g2 <> 0 by A14, A15, A16;
take g1 = g1; :: thesis: ex g2 being Real st
( r1 < g1 & g1 < x0 & g1 in dom (f ^) & g2 < r2 & x0 < g2 & g2 in dom (f ^) )

take g2 = g2; :: thesis: ( r1 < g1 & g1 < x0 & g1 in dom (f ^) & g2 < r2 & x0 < g2 & g2 in dom (f ^) )
not f . g2 in {0} by A24, TARSKI:def 1;
then A25: not g2 in f " {0} by FUNCT_1:def 7;
not f . g1 in {0} by A23, TARSKI:def 1;
then not g1 in f " {0} by FUNCT_1:def 7;
hence ( r1 < g1 & g1 < x0 & g1 in dom (f ^) & g2 < r2 & x0 < g2 & g2 in dom (f ^) ) by A1, A17, A18, A19, A20, A21, A22, A25, XBOOLE_0:def 5; :: thesis: verum
end;
hence f ^ is_convergent_in x0 by A3; :: thesis: lim ((f ^),x0) = 0
hence lim ((f ^),x0) = 0 by A3, Def4; :: thesis: verum