let x0 be Element of COMPLEX ; :: thesis:
let f be PartFunc of COMPLEX ,COMPLEX ; :: thesis:
thus ( f is_continuous_in x0 implies ( x0 in dom f & ( for r being Real st 0 < r holds
ex s being Real st
( 0 < s & ( for x1 being Element of COMPLEX st x1 in dom f & |.(x1 - x0).| < s holds
|.((f /. x1) - (f /. x0)).| < r ) ) ) ) ) :: thesis:

assume A1: f is_continuous_in x0 ; :: thesis:
hence x0 in dom f by Def2; :: thesis:
given r being Real such that A2: ( 0 < r & ( for s being Real holds
( not 0 < s or ex x1 being Element of COMPLEX st
( x1 in dom f & |.(x1 - x0).| < s & not |.((f /. x1) - (f /. x0)).| < r ) ) ) ) ; :: thesis:
defpred S₁[ Element of NAT , Element of COMPLEX ] means ( $2 in dom f & |.($2 - x0).| < 1 / ($1 + 1) & not |.((f /. $2) - (f /. x0)).| < r );
A3: for n being Element of NAT ex g being Element of COMPLEX st S₁[n,g]

let n be Element of NAT ; :: thesis:
0 < n + 1 by NAT_1:3;
then 0 < (n + 1) " by XREAL_1:124;
then 0 < 1 / (n + 1) by XCMPLX_1:217;
then consider g being Element of COMPLEX such that
A4: ( g in dom f & |.(g - x0).| < 1 / (n + 1) & not |.((f /. g) - (f /. x0)).| < r ) by A2;
take g ; :: thesis:
thus S₁[n,g] by A4; :: thesis:

end;

consider s1 being Complex_Sequence such that
A5: for n being Element of NAT holds S₁[n,s1 . n] from CFCONT_1:sch 1(A3);
A6: rng s1 c= dom f

let x be set ; :: according to TARSKI:def 3 :: thesis:
assume x in rng s1 ; :: thesis:
then ex n being Element of NAT st x = s1 . n by FUNCT_2:190;
hence x in dom f by A5; :: thesis:

end;

A7: now

let n be Element of NAT ; :: thesis:
not |.((f /. (s1 . n)) - (f /. x0)).| < r by A5;
hence not |.(((f /* s1) . n) - (f /. x0)).| < r by A6, FUNCT_2:186; :: thesis:

end;

A8: now

let s be Real; :: thesis:
assume 0 < s ; :: thesis:
then A9: 0 < s " by XREAL_1:124;
consider n being Element of NAT such that
A10: s " < n by SEQ_4:10;
take k = n; :: thesis:
let m be Element of NAT ; :: thesis:
assume A11: k <= m ; :: thesis:
(s " ) + 0 < n + 1 by A10, XREAL_1:10;
then 1 / (n + 1) < 1 / (s " ) by A9, XREAL_1:78;
then A12: 1 / (n + 1) < s by XCMPLX_1:218;
k + 1 <= m + 1 by A11, XREAL_1:8;
then 1 / (m + 1) <= 1 / (k + 1) by NAT_1:3, XREAL_1:120;
then A13: 1 / (m + 1) < s by A12, XXREAL_0:2;
|.((s1 . m) - x0).| < 1 / (m + 1) by A5;
hence |.((s1 . m) - x0).| < s by A13, XXREAL_0:2; :: thesis:

end;

then A14: s1 is convergent by COMSEQ_2:def 4;
then lim s1 = x0 by A8, COMSEQ_2:def 5;
then ( f /* s1 is convergent & f /. x0 = lim (f /* s1) ) by A1, A6, A14, Def2;
then consider n being Element of NAT such that
A15: for m being Element of NAT st n <= m holds
|.(((f /* s1) . m) - (f /. x0)).| < r by A2, COMSEQ_2:def 5;
|.(((f /* s1) . n) - (f /. x0)).| < r by A15;
hence contradiction by A7; :: thesis:

end;

assume A16: ( x0 in dom f & ( for r being Real st 0 < r holds
ex s being Real st
( 0 < s & ( for x1 being Element of COMPLEX st x1 in dom f & |.(x1 - x0).| < s holds
|.((f /. x1) - (f /. x0)).| < r ) ) ) ) ; :: thesis:

let s1 be Complex_Sequence; :: thesis:
assume A17: ( rng s1 c= dom f & s1 is convergent & lim s1 = x0 ) ; :: thesis:

A18: now

let p be Real; :: thesis:
assume 0 < p ; :: thesis:
then consider s being Real such that
A19: ( 0 < s & ( for x1 being Element of COMPLEX st x1 in dom f & |.(x1 - x0).| < s holds
|.((f /. x1) - (f /. x0)).| < p ) ) by A16;
consider n being Element of NAT such that
A20: for m being Element of NAT st n <= m holds
|.((s1 . m) - x0).| < s by A17, A19, COMSEQ_2:def 5;
take k = n; :: thesis:
let m be Element of NAT ; :: thesis:
assume A21: k <= m ; :: thesis:
A22: s1 . m in rng s1 by VALUED_0:28;
|.((s1 . m) - x0).| < s by A20, A21;
then |.((f /. (s1 . m)) - (f /. x0)).| < p by A17, A19, A22;
hence |.(((f /* s1) . m) - (f /. x0)).| < p by A17, FUNCT_2:186; :: thesis:

end;

then f /* s1 is convergent by COMSEQ_2:def 4;
hence ( f /* s1 is convergent & f /. x0 = lim (f /* s1) ) by A18, COMSEQ_2:def 5; :: thesis:

end;

hence f is_continuous_in x0 by A16, Def2; :: thesis: