let f, g be PartFunc of REAL,REAL; :: thesis:
let x0 be Real; :: thesis:
given N being Neighbourhood of x0 such that A1: N c= dom f and
A2: N c= dom g and
A3: f is_differentiable_on N and
A4: g is_differentiable_on N and
A5: N \ {x0} c= dom (f / g) and
A6: N c= dom ((f `| N) / (g `| N)) and
A7: ( f . x0 = 0 & g . x0 = 0 ) and
A8: (f `| N) / (g `| N) is_convergent_in x0 ; :: thesis:
consider r being Real such that
A9: 0 < r and
A10: N = ].(x0 - r),(x0 + r).[ by RCOMP_1:def 6;
A11: for x being Real st x0 < x & x < x0 + r holds
ex c being Real st
( c in ].x0,x.[ & (f / g) . x = ((f `| N) / (g `| N)) . c )

proof

A51: now :: thesis:

assume g . x = 0 ; :: thesis:
then g . x in {0} by TARSKI:def 1;
hence contradiction by A50, FUNCT_1:def 7; :: thesis:

end;

A52: [.x0,x.] c= dom ((f `| N) / (g `| N)) by A6, A20;
then [.x0,x.] c= (dom (f `| N)) /\ ((dom (g `| N)) \ ((g `| N) " {0})) by RFUNCT_1:def 1;
then [.x0,x.] c= (dom (g `| N)) \ ((g `| N) " {0}) by A14;
then A53: ( t in dom (g `| N) & not t in (g `| N) " {0} ) by A48, XBOOLE_0:def 5;

A54: now :: thesis:

assume diff (g,t) = 0 ; :: thesis:
then (g `| N) . t = 0 by A4, A20, A48, FDIFF_1:def 7;
then (g `| N) . t in {0} by TARSKI:def 1;
hence contradiction by A53, FUNCT_1:def 7; :: thesis:

end;

g is_differentiable_in t by A4, A27, A43, FDIFF_1:9;
then 0 = ((f . x) * (diff (g,t))) - ((g . x) * (diff (f,t))) by A47, FDIFF_1:15;
then (f . x) / (g . x) = (diff (f,t)) / (diff (g,t)) by A51, A54, XCMPLX_1:94;
then (f . x) * ((g . x) ") = (diff (f,t)) / (diff (g,t)) by XCMPLX_0:def 9;
then (f . x) * ((g . x) ") = (diff (f,t)) * ((diff (g,t)) ") by XCMPLX_0:def 9;
then (f / g) . x = (diff (f,t)) * ((diff (g,t)) ") by A49, A37, RFUNCT_1:def 1;
then (f / g) . x = ((f `| N) . t) * ((diff (g,t)) ") by A3, A20, A48, FDIFF_1:def 7;
then (f / g) . x = ((f `| N) . t) * (((g `| N) . t) ") by A4, A20, A48, FDIFF_1:def 7;
hence ( t in ].x0,x.[ & (f / g) . x = ((f `| N) / (g `| N)) . t ) by A43, A52, A48, RFUNCT_1:def 1; :: thesis:

end;

A55: for a being Real_Sequence st a is convergent & lim a = x0 & rng a c= (dom (f / g)) /\ (right_open_halfline x0) holds
( (f / g) /* a is convergent & lim ((f / g) /* a) = lim (((f `| N) / (g `| N)),x0) )

proof

reconsider xx0 = x0 as Element of REAL by XREAL_0:def 1;
set d = seq_const x0;
let a be Real_Sequence; :: thesis:
assume that
A56: a is convergent and
A57: lim a = x0 and
A58: rng a c= (dom (f / g)) /\ (right_open_halfline x0) ; :: thesis:
consider k being Element of NAT such that
A59: for n being Element of NAT st k <= n holds
( x0 - r < a . n & a . n < x0 + r ) by A9, A56, A57, LIMFUNC3:7;
set a1 = a ^\ k;
defpred S₁[ Element of NAT , Real] means ( $2 in ].x0,((a ^\ k) . $1).[ & (((f / g) /* a) ^\ k) . $1 = ((f `| N) / (g `| N)) . $2 );

A60: now :: thesis:

let n be Element of NAT ; :: thesis:
a . (n + k) in rng a by VALUED_0:28;
then a . (n + k) in right_open_halfline x0 by A58, XBOOLE_0:def 4;
then a . (n + k) in { g1 where g1 is Real : x0 < g1 } by XXREAL_1:230;
then ex g1 being Real st
( a . (n + k) = g1 & x0 < g1 ) ;
hence x0 < (a ^\ k) . n by NAT_1:def 3; :: thesis:
( (a ^\ k) . n = a . (n + k) & k <= n + k ) by NAT_1:12, NAT_1:def 3;
hence (a ^\ k) . n < x0 + r by A59; :: thesis:

end;

A61: for n being Element of NAT ex c being Element of REAL st S₁[n,c]

proof

let n be Element of NAT ; :: thesis:
A62: rng (a ^\ k) c= rng a by VALUED_0:21;
( x0 < (a ^\ k) . n & (a ^\ k) . n < x0 + r ) by A60;
then consider c being Real such that
A63: c in ].x0,((a ^\ k) . n).[ and
A64: (f / g) . ((a ^\ k) . n) = ((f `| N) / (g `| N)) . c by A11;
take c ; :: thesis:
A65: (dom (f / g)) /\ (right_open_halfline x0) c= dom (f / g) by XBOOLE_1:17;
then rng a c= dom (f / g) by A58;
then ((f / g) /* (a ^\ k)) . n = ((f `| N) / (g `| N)) . c by A64, A62, FUNCT_2:108, XBOOLE_1:1;
hence ( c is set & c is Element of REAL & S₁[n,c] ) by A58, A63, A65, VALUED_0:27, XBOOLE_1:1; :: thesis:

end;

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

A67: now :: thesis:

let n be Nat; :: thesis:
A68: n in NAT by ORDINAL1:def 12;
b . n in ].x0,((a ^\ k) . n).[ by A66, A68;
then b . n in { g1 where g1 is Real : ( x0 < g1 & g1 < (a ^\ k) . n ) } by RCOMP_1:def 2;
then ex g1 being Real st
( g1 = b . n & x0 < g1 & g1 < (a ^\ k) . n ) ;
hence ( (seq_const x0) . n <= b . n & b . n <= (a ^\ k) . n ) by SEQ_1:57; :: thesis:

end;

A69: lim (seq_const x0) = (seq_const x0) . 0 by SEQ_4:26
.= x0 by SEQ_1:57 ;
lim (a ^\ k) = x0 by A56, A57, SEQ_4:20;
then A70: ( b is convergent & lim b = x0 ) by A56, A69, A67, SEQ_2:19, SEQ_2:20;
A71: x0 - r < x0 by A9, XREAL_1:44;
x0 < x0 + r by A9, XREAL_1:29;
then x0 in { g2 where g2 is Real : ( x0 - r < g2 & g2 < x0 + r ) } by A71;
then A72: x0 in ].(x0 - r),(x0 + r).[ by RCOMP_1:def 2;
A73: rng b c= (dom ((f `| N) / (g `| N))) \ {x0}

proof

let x be object ; :: according to TARSKI:def 3 :: thesis:
assume x in rng b ; :: thesis:
then consider n being Element of NAT such that
A74: x = b . n by FUNCT_2:113;
x0 < (a ^\ k) . n by A60;
then A75: x0 - r < (a ^\ k) . n by A71, XXREAL_0:2;
(a ^\ k) . n < x0 + r by A60;
then (a ^\ k) . n in { g3 where g3 is Real : ( x0 - r < g3 & g3 < x0 + r ) } by A75;
then (a ^\ k) . n in ].(x0 - r),(x0 + r).[ by RCOMP_1:def 2;
then ( ].x0,((a ^\ k) . n).[ c= [.x0,((a ^\ k) . n).] & [.x0,((a ^\ k) . n).] c= ].(x0 - r),(x0 + r).[ ) by A72, XXREAL_1:25, XXREAL_2:def 12;
then ].x0,((a ^\ k) . n).[ c= ].(x0 - r),(x0 + r).[ ;
then A76: ].x0,((a ^\ k) . n).[ c= dom ((f `| N) / (g `| N)) by A6, A10;
A77: x in ].x0,((a ^\ k) . n).[ by A66, A74;
then x in { g1 where g1 is Real : ( x0 < g1 & g1 < (a ^\ k) . n ) } by RCOMP_1:def 2;
then ex g1 being Real st
( g1 = x & x0 < g1 & g1 < (a ^\ k) . n ) ;
then not x in {x0} by TARSKI:def 1;
hence x in (dom ((f `| N) / (g `| N))) \ {x0} by A77, A76, XBOOLE_0:def 5; :: thesis:

end;

A78: (dom ((f `| N) / (g `| N))) \ {x0} c= dom ((f `| N) / (g `| N)) by XBOOLE_1:36;

A79: now :: thesis:

reconsider m = 0 as Nat ;
take m = m; :: thesis:
let n be Nat; :: thesis:
assume m <= n ; :: thesis:
A80: n in NAT by ORDINAL1:def 12;
(((f / g) /* a) ^\ k) . n = ((f `| N) / (g `| N)) . (b . n) by A66, A80;
hence (((f / g) /* a) ^\ k) . n = (((f `| N) / (g `| N)) /* b) . n by A73, A78, FUNCT_2:108, XBOOLE_1:1, A80; :: thesis:

end;

lim (((f `| N) / (g `| N)),x0) = lim (((f `| N) / (g `| N)),x0) ;
then A81: ((f `| N) / (g `| N)) /* b is convergent by A8, A70, A73, LIMFUNC3:def 4;
then A82: ((f / g) /* a) ^\ k is convergent by A79, SEQ_4:18;
lim (((f `| N) / (g `| N)) /* b) = lim (((f `| N) / (g `| N)),x0) by A8, A70, A73, LIMFUNC3:def 4;
then lim (((f / g) /* a) ^\ k) = lim (((f `| N) / (g `| N)),x0) by A81, A79, SEQ_4:19;
hence ( (f / g) /* a is convergent & lim ((f / g) /* a) = lim (((f `| N) / (g `| N)),x0) ) by A82, SEQ_4:21, SEQ_4:22; :: thesis:

end;

A83: 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 / g) & g2 < r2 & x0 < g2 & g2 in dom (f / g) ) by A5, Th4;
then for r1 being Real st x0 < r1 holds
ex t being Real st
( t < r1 & x0 < t & t in dom (f / g) ) by LIMFUNC3:8;
then A84: ( f / g is_right_convergent_in x0 & lim_right ((f / g),x0) = lim (((f `| N) / (g `| N)),x0) ) by A55, Th2;
A85: for x being Real st x0 - r < x & x < x0 holds
ex c being Real st
( c in ].x,x0.[ & (f / g) . x = ((f `| N) / (g `| N)) . c )

proof

A125: now :: thesis:

assume g . x = 0 ; :: thesis:
then g . x in {0} by TARSKI:def 1;
hence contradiction by A124, FUNCT_1:def 7; :: thesis:

end;

A126: [.x,x0.] c= dom ((f `| N) / (g `| N)) by A6, A94;
then [.x,x0.] c= (dom (f `| N)) /\ ((dom (g `| N)) \ ((g `| N) " {0})) by RFUNCT_1:def 1;
then [.x,x0.] c= (dom (g `| N)) \ ((g `| N) " {0}) by A88;
then A127: ( t in dom (g `| N) & not t in (g `| N) " {0} ) by A122, XBOOLE_0:def 5;

A128: now :: thesis:

assume diff (g,t) = 0 ; :: thesis:
then (g `| N) . t = 0 by A4, A94, A122, FDIFF_1:def 7;
then (g `| N) . t in {0} by TARSKI:def 1;
hence contradiction by A127, FUNCT_1:def 7; :: thesis:

end;

g is_differentiable_in t by A4, A101, A117, FDIFF_1:9;
then 0 = ((f . x) * (diff (g,t))) - ((g . x) * (diff (f,t))) by A121, FDIFF_1:15;
then (f . x) / (g . x) = (diff (f,t)) / (diff (g,t)) by A125, A128, XCMPLX_1:94;
then (f . x) * ((g . x) ") = (diff (f,t)) / (diff (g,t)) by XCMPLX_0:def 9;
then (f . x) * ((g . x) ") = (diff (f,t)) * ((diff (g,t)) ") by XCMPLX_0:def 9;
then (f / g) . x = (diff (f,t)) * ((diff (g,t)) ") by A123, A111, RFUNCT_1:def 1;
then (f / g) . x = ((f `| N) . t) * ((diff (g,t)) ") by A3, A94, A122, FDIFF_1:def 7;
then (f / g) . x = ((f `| N) . t) * (((g `| N) . t) ") by A4, A94, A122, FDIFF_1:def 7;
hence ( t in ].x,x0.[ & (f / g) . x = ((f `| N) / (g `| N)) . t ) by A117, A126, A122, RFUNCT_1:def 1; :: thesis:

end;

A129: for a being Real_Sequence st a is convergent & lim a = x0 & rng a c= (dom (f / g)) /\ (left_open_halfline x0) holds
( (f / g) /* a is convergent & lim ((f / g) /* a) = lim (((f `| N) / (g `| N)),x0) )

proof

reconsider xx0 = x0 as Element of REAL by XREAL_0:def 1;
set d = seq_const x0;
let a be Real_Sequence; :: thesis:
assume that
A130: a is convergent and
A131: lim a = x0 and
A132: rng a c= (dom (f / g)) /\ (left_open_halfline x0) ; :: thesis:
consider k being Element of NAT such that
A133: for n being Element of NAT st k <= n holds
( x0 - r < a . n & a . n < x0 + r ) by A9, A130, A131, LIMFUNC3:7;
set a1 = a ^\ k;
defpred S₁[ Element of NAT , Real] means ( $2 in ].((a ^\ k) . $1),x0.[ & (((f / g) /* a) ^\ k) . $1 = ((f `| N) / (g `| N)) . $2 );

A134: now :: thesis:

let n be Element of NAT ; :: thesis:
a . (n + k) in rng a by VALUED_0:28;
then a . (n + k) in left_open_halfline x0 by A132, XBOOLE_0:def 4;
then a . (n + k) in { g1 where g1 is Real : g1 < x0 } by XXREAL_1:229;
then ex g1 being Real st
( a . (n + k) = g1 & g1 < x0 ) ;
hence (a ^\ k) . n < x0 by NAT_1:def 3; :: thesis:
( (a ^\ k) . n = a . (n + k) & k <= n + k ) by NAT_1:12, NAT_1:def 3;
hence x0 - r < (a ^\ k) . n by A133; :: thesis:

end;

A135: for n being Element of NAT ex c being Element of REAL st S₁[n,c]

proof

let n be Element of NAT ; :: thesis:
A136: rng (a ^\ k) c= rng a by VALUED_0:21;
( x0 - r < (a ^\ k) . n & (a ^\ k) . n < x0 ) by A134;
then consider c being Real such that
A137: c in ].((a ^\ k) . n),x0.[ and
A138: (f / g) . ((a ^\ k) . n) = ((f `| N) / (g `| N)) . c by A85;
take c ; :: thesis:
A139: (dom (f / g)) /\ (left_open_halfline x0) c= dom (f / g) by XBOOLE_1:17;
then rng a c= dom (f / g) by A132;
then ((f / g) /* (a ^\ k)) . n = ((f `| N) / (g `| N)) . c by A138, A136, FUNCT_2:108, XBOOLE_1:1;
hence ( c is set & c is Element of REAL & S₁[n,c] ) by A132, A137, A139, VALUED_0:27, XBOOLE_1:1; :: thesis:

end;

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

A141: now :: thesis:

let n be Nat; :: thesis:
A142: n in NAT by ORDINAL1:def 12;
b . n in ].((a ^\ k) . n),x0.[ by A140, A142;
then b . n in { g1 where g1 is Real : ( (a ^\ k) . n < g1 & g1 < x0 ) } by RCOMP_1:def 2;
then ex g1 being Real st
( g1 = b . n & (a ^\ k) . n < g1 & g1 < x0 ) ;
hence ( (a ^\ k) . n <= b . n & b . n <= (seq_const x0) . n ) by SEQ_1:57; :: thesis:

end;

A143: lim (seq_const x0) = (seq_const x0) . 0 by SEQ_4:26
.= x0 by SEQ_1:57 ;
lim (a ^\ k) = x0 by A130, A131, SEQ_4:20;
then A144: ( b is convergent & lim b = x0 ) by A130, A143, A141, SEQ_2:19, SEQ_2:20;
A145: x0 < x0 + r by A9, XREAL_1:29;
x0 - r < x0 by A9, XREAL_1:44;
then x0 in { g2 where g2 is Real : ( x0 - r < g2 & g2 < x0 + r ) } by A145;
then A146: x0 in ].(x0 - r),(x0 + r).[ by RCOMP_1:def 2;
A147: rng b c= (dom ((f `| N) / (g `| N))) \ {x0}

proof

let x be object ; :: according to TARSKI:def 3 :: thesis:
assume x in rng b ; :: thesis:
then consider n being Element of NAT such that
A148: x = b . n by FUNCT_2:113;
(a ^\ k) . n < x0 by A134;
then A149: (a ^\ k) . n < x0 + r by A145, XXREAL_0:2;
x0 - r < (a ^\ k) . n by A134;
then (a ^\ k) . n in { g3 where g3 is Real : ( x0 - r < g3 & g3 < x0 + r ) } by A149;
then (a ^\ k) . n in ].(x0 - r),(x0 + r).[ by RCOMP_1:def 2;
then ( ].((a ^\ k) . n),x0.[ c= [.((a ^\ k) . n),x0.] & [.((a ^\ k) . n),x0.] c= ].(x0 - r),(x0 + r).[ ) by A146, XXREAL_1:25, XXREAL_2:def 12;
then ].((a ^\ k) . n),x0.[ c= ].(x0 - r),(x0 + r).[ ;
then A150: ].((a ^\ k) . n),x0.[ c= dom ((f `| N) / (g `| N)) by A6, A10;
A151: x in ].((a ^\ k) . n),x0.[ by A140, A148;
then x in { g1 where g1 is Real : ( (a ^\ k) . n < g1 & g1 < x0 ) } by RCOMP_1:def 2;
then ex g1 being Real st
( g1 = x & (a ^\ k) . n < g1 & g1 < x0 ) ;
then not x in {x0} by TARSKI:def 1;
hence x in (dom ((f `| N) / (g `| N))) \ {x0} by A151, A150, XBOOLE_0:def 5; :: thesis:

end;

A152: (dom ((f `| N) / (g `| N))) \ {x0} c= dom ((f `| N) / (g `| N)) by XBOOLE_1:36;

A153: now :: thesis:

reconsider m = 0 as Nat ;
take m = m; :: thesis:
let n be Nat; :: thesis:
assume m <= n ; :: thesis:
A154: n in NAT by ORDINAL1:def 12;
(((f / g) /* a) ^\ k) . n = ((f `| N) / (g `| N)) . (b . n) by A140, A154;
hence (((f / g) /* a) ^\ k) . n = (((f `| N) / (g `| N)) /* b) . n by A147, A152, FUNCT_2:108, XBOOLE_1:1, A154; :: thesis:

end;

lim (((f `| N) / (g `| N)),x0) = lim (((f `| N) / (g `| N)),x0) ;
then A155: ((f `| N) / (g `| N)) /* b is convergent by A8, A144, A147, LIMFUNC3:def 4;
then A156: ((f / g) /* a) ^\ k is convergent by A153, SEQ_4:18;
lim (((f `| N) / (g `| N)) /* b) = lim (((f `| N) / (g `| N)),x0) by A8, A144, A147, LIMFUNC3:def 4;
then lim (((f / g) /* a) ^\ k) = lim (((f `| N) / (g `| N)),x0) by A155, A153, SEQ_4:19;
hence ( (f / g) /* a is convergent & lim ((f / g) /* a) = lim (((f `| N) / (g `| N)),x0) ) by A156, SEQ_4:21, SEQ_4:22; :: thesis:

end;

for r1 being Real st r1 < x0 holds
ex t being Real st
( r1 < t & t < x0 & t in dom (f / g) ) by A83, LIMFUNC3:8;
then A157: ( f / g is_left_convergent_in x0 & lim_left ((f / g),x0) = lim (((f `| N) / (g `| N)),x0) ) by A129, Th3;
hence f / g is_convergent_in x0 by A84, LIMFUNC3:30; :: thesis:
take N ; :: thesis:
thus lim ((f / g),x0) = lim (((f `| N) / (g `| N)),x0) by A84, A157, LIMFUNC3:30; :: thesis: