let f be PartFunc of (REAL 2),REAL; :: thesis:
let z0 be Element of REAL 2; :: thesis:
let N be Neighbourhood of (proj (1,2)) . z0; :: thesis:
assume that
A1: f is_partial_differentiable_in z0,1 and
A2: N c= dom (SVF1 (1,f,z0)) ; :: thesis:
consider x0, y0 being Real such that
A3: z0 = <*x0,y0*> and
A4: ex N1 being Neighbourhood of x0 st
( N1 c= dom (SVF1 (1,f,z0)) & ex L being LINEAR ex R being REST st
for x being Real st x in N1 holds
((SVF1 (1,f,z0)) . x) - ((SVF1 (1,f,z0)) . x0) = (L . (x - x0)) + (R . (x - x0)) ) by A1, Th9;
consider N1 being Neighbourhood of x0 such that
N1 c= dom (SVF1 (1,f,z0)) and
A5: ex L being LINEAR ex R being REST st
for x being Real st x in N1 holds
((SVF1 (1,f,z0)) . x) - ((SVF1 (1,f,z0)) . x0) = (L . (x - x0)) + (R . (x - x0)) by A4;
A6: (proj (1,2)) . z0 = x0 by A3, Th1;
then consider N2 being Neighbourhood of x0 such that
A7: N2 c= N and
A8: N2 c= N1 by RCOMP_1:17;
A9: N2 c= dom (SVF1 (1,f,z0)) by A2, A7, XBOOLE_1:1;
let h be convergent_to_0 Real_Sequence; :: thesis:
let c be constant Real_Sequence; :: thesis:
assume that
A10: rng c = {((proj (1,2)) . z0)} and
A11: rng (h + c) c= N ; :: thesis:
consider g being real number such that
A12: 0 < g and
A13: N2 = ].(x0 - g),(x0 + g).[ by RCOMP_1:def 6;
( x0 + 0 < x0 + g & x0 - g < x0 - 0 ) by A12, XREAL_1:8, XREAL_1:44;
then A14: x0 in N2 by A13;
A15: rng c c= dom (SVF1 (1,f,z0))

let y be set ; :: according to TARSKI:def 3 :: thesis:
assume y in rng c ; :: thesis:
then y = x0 by A10, A6, TARSKI:def 1;
then y in N by A7, A14;
hence y in dom (SVF1 (1,f,z0)) by A2; :: thesis:

end;

ex n being Element of NAT st
( rng (c ^\ n) c= N2 & rng ((h + c) ^\ n) c= N2 )

proof

x0 in rng c by A10, A6, TARSKI:def 1;
then A16: lim c = x0 by SEQ_4:25;
A17: h is convergent by FDIFF_1:def 1;
then A18: h + c is convergent by SEQ_2:5;
lim h = 0 by FDIFF_1:def 1;
then lim (h + c) = 0 + x0 by A16, A17, SEQ_2:6
.= x0 ;
then consider n being Element of NAT such that
A19: for m being Element of NAT st n <= m holds
abs (((h + c) . m) - x0) < g by A12, A18, SEQ_2:def 7;
take n ; :: thesis:
A20: rng (c ^\ n) = {x0} by A10, A6, VALUED_0:26;
thus rng (c ^\ n) c= N2 :: thesis:

proof

let y be set ; :: according to TARSKI:def 3 :: thesis:
assume y in rng (c ^\ n) ; :: thesis:
hence y in N2 by A14, A20, TARSKI:def 1; :: thesis:

end;

let y be set ; :: according to TARSKI:def 3 :: thesis:
assume y in rng ((h + c) ^\ n) ; :: thesis:
then consider m being Element of NAT such that
A21: y = ((h + c) ^\ n) . m by FUNCT_2:113;
n + 0 <= n + m by XREAL_1:7;
then A22: abs (((h + c) . (n + m)) - x0) < g by A19;
then ((h + c) . (m + n)) - x0 < g by SEQ_2:1;
then (((h + c) ^\ n) . m) - x0 < g by NAT_1:def 3;
then A23: ((h + c) ^\ n) . m < x0 + g by XREAL_1:19;
- g < ((h + c) . (m + n)) - x0 by A22, SEQ_2:1;
then - g < (((h + c) ^\ n) . m) - x0 by NAT_1:def 3;
then x0 + (- g) < ((h + c) ^\ n) . m by XREAL_1:20;
hence y in N2 by A13, A21, A23; :: thesis:

end;

then consider n being Element of NAT such that
rng (c ^\ n) c= N2 and
A24: rng ((h + c) ^\ n) c= N2 ;
consider L being LINEAR, R being REST such that
A25: for x being Real st x in N1 holds
((SVF1 (1,f,z0)) . x) - ((SVF1 (1,f,z0)) . x0) = (L . (x - x0)) + (R . (x - x0)) by A5;
A26: rng (c ^\ n) c= dom (SVF1 (1,f,z0))

proof

let y be set ; :: according to TARSKI:def 3 :: thesis:
assume A27: y in rng (c ^\ n) ; :: thesis:
rng (c ^\ n) = rng c by VALUED_0:26;
then y = x0 by A10, A6, A27, TARSKI:def 1;
then y in N by A7, A14;
hence y in dom (SVF1 (1,f,z0)) by A2; :: thesis:

end;

A28: L is total by FDIFF_1:def 3;
A29: ( ((L /* (h ^\ n)) + (R /* (h ^\ n))) (#) ((h ^\ n) ") is convergent & lim (((L /* (h ^\ n)) + (R /* (h ^\ n))) (#) ((h ^\ n) ")) = L . 1 )

proof

deffunc H₁( Element of NAT ) -> Element of REAL = (L . 1) + (((R /* (h ^\ n)) (#) ((h ^\ n) ")) . $1);
consider s1 being Real_Sequence such that
A30: for k being Element of NAT holds s1 . k = H₁(k) from SEQ_1:sch 1();

A31: now

A32: ( ((h ^\ n) ") (#) (R /* (h ^\ n)) is convergent & lim (((h ^\ n) ") (#) (R /* (h ^\ n))) = 0 ) by FDIFF_1:def 2;
let r be real number ; :: thesis:
assume 0 < r ; :: thesis:
then consider m being Element of NAT such that
A33: for k being Element of NAT st m <= k holds
abs (((((h ^\ n) ") (#) (R /* (h ^\ n))) . k) - 0) < r by A32, SEQ_2:def 7;
take n1 = m; :: thesis:
let k be Element of NAT ; :: thesis:
assume A34: n1 <= k ; :: thesis:
abs ((s1 . k) - (L . 1)) = abs (((L . 1) + (((R /* (h ^\ n)) (#) ((h ^\ n) ")) . k)) - (L . 1)) by A30
.= abs (((((h ^\ n) ") (#) (R /* (h ^\ n))) . k) - 0) ;
hence abs ((s1 . k) - (L . 1)) < r by A33, A34; :: thesis:

end;

consider s being Real such that
A35: for p1 being Real holds L . p1 = s * p1 by FDIFF_1:def 3;
A36: L . 1 = s * 1 by A35
.= s ;

now

let m be Element of NAT ; :: thesis:
h ^\ n is non-empty by FDIFF_1:def 1;
then A37: (h ^\ n) . m <> 0 by SEQ_1:5;
thus (((L /* (h ^\ n)) + (R /* (h ^\ n))) (#) ((h ^\ n) ")) . m = (((L /* (h ^\ n)) + (R /* (h ^\ n))) . m) * (((h ^\ n) ") . m) by SEQ_1:8
.= (((L /* (h ^\ n)) . m) + ((R /* (h ^\ n)) . m)) * (((h ^\ n) ") . m) by SEQ_1:7
.= (((L /* (h ^\ n)) . m) * (((h ^\ n) ") . m)) + (((R /* (h ^\ n)) . m) * (((h ^\ n) ") . m))
.= (((L /* (h ^\ n)) . m) * (((h ^\ n) ") . m)) + (((R /* (h ^\ n)) (#) ((h ^\ n) ")) . m) by SEQ_1:8
.= (((L /* (h ^\ n)) . m) * (((h ^\ n) . m) ")) + (((R /* (h ^\ n)) (#) ((h ^\ n) ")) . m) by VALUED_1:10
.= ((L . ((h ^\ n) . m)) * (((h ^\ n) . m) ")) + (((R /* (h ^\ n)) (#) ((h ^\ n) ")) . m) by A28, FUNCT_2:115
.= ((s * ((h ^\ n) . m)) * (((h ^\ n) . m) ")) + (((R /* (h ^\ n)) (#) ((h ^\ n) ")) . m) by A35
.= (s * (((h ^\ n) . m) * (((h ^\ n) . m) "))) + (((R /* (h ^\ n)) (#) ((h ^\ n) ")) . m)
.= (s * 1) + (((R /* (h ^\ n)) (#) ((h ^\ n) ")) . m) by A37, XCMPLX_0:def 7
.= s1 . m by A30, A36 ; :: thesis:

end;

then A38: ((L /* (h ^\ n)) + (R /* (h ^\ n))) (#) ((h ^\ n) ") = s1 by FUNCT_2:63;
hence ((L /* (h ^\ n)) + (R /* (h ^\ n))) (#) ((h ^\ n) ") is convergent by A31, SEQ_2:def 6; :: thesis:
hence lim (((L /* (h ^\ n)) + (R /* (h ^\ n))) (#) ((h ^\ n) ")) = L . 1 by A38, A31, SEQ_2:def 7; :: thesis:

end;

A39: rng ((h + c) ^\ n) c= dom (SVF1 (1,f,z0))

proof

let y be set ; :: according to TARSKI:def 3 :: thesis:
assume y in rng ((h + c) ^\ n) ; :: thesis:
then y in N2 by A24;
then y in N by A7;
hence y in dom (SVF1 (1,f,z0)) by A2; :: thesis:

end;

A40: rng (h + c) c= dom (SVF1 (1,f,z0))

proof

let y be set ; :: according to TARSKI:def 3 :: thesis:
assume y in rng (h + c) ; :: thesis:
then y in N by A11;
hence y in dom (SVF1 (1,f,z0)) by A2; :: thesis:

end;

A41: for k being Element of NAT holds ((SVF1 (1,f,z0)) . (((h + c) ^\ n) . k)) - ((SVF1 (1,f,z0)) . ((c ^\ n) . k)) = (L . ((h ^\ n) . k)) + (R . ((h ^\ n) . k))

proof

let k be Element of NAT ; :: thesis:
((h + c) ^\ n) . k in rng ((h + c) ^\ n) by VALUED_0:28;
then A42: ((h + c) ^\ n) . k in N2 by A24;
( (c ^\ n) . k in rng (c ^\ n) & rng (c ^\ n) = rng c ) by VALUED_0:26, VALUED_0:28;
then A43: (c ^\ n) . k = x0 by A10, A6, TARSKI:def 1;
(((h + c) ^\ n) . k) - ((c ^\ n) . k) = (((h ^\ n) + (c ^\ n)) . k) - ((c ^\ n) . k) by SEQM_3:15
.= (((h ^\ n) . k) + ((c ^\ n) . k)) - ((c ^\ n) . k) by SEQ_1:7
.= (h ^\ n) . k ;
hence ((SVF1 (1,f,z0)) . (((h + c) ^\ n) . k)) - ((SVF1 (1,f,z0)) . ((c ^\ n) . k)) = (L . ((h ^\ n) . k)) + (R . ((h ^\ n) . k)) by A25, A8, A42, A43; :: thesis:

end;

A44: R is total by FDIFF_1:def 2;

now

let k be Element of NAT ; :: thesis:
thus (((SVF1 (1,f,z0)) /* ((h + c) ^\ n)) - ((SVF1 (1,f,z0)) /* (c ^\ n))) . k = (((SVF1 (1,f,z0)) /* ((h + c) ^\ n)) . k) - (((SVF1 (1,f,z0)) /* (c ^\ n)) . k) by RFUNCT_2:1
.= ((SVF1 (1,f,z0)) . (((h + c) ^\ n) . k)) - (((SVF1 (1,f,z0)) /* (c ^\ n)) . k) by A39, FUNCT_2:108
.= ((SVF1 (1,f,z0)) . (((h + c) ^\ n) . k)) - ((SVF1 (1,f,z0)) . ((c ^\ n) . k)) by A26, FUNCT_2:108
.= (L . ((h ^\ n) . k)) + (R . ((h ^\ n) . k)) by A41
.= ((L /* (h ^\ n)) . k) + (R . ((h ^\ n) . k)) by A28, FUNCT_2:115
.= ((L /* (h ^\ n)) . k) + ((R /* (h ^\ n)) . k) by A44, FUNCT_2:115
.= ((L /* (h ^\ n)) + (R /* (h ^\ n))) . k by SEQ_1:7 ; :: thesis:

end;

then ((SVF1 (1,f,z0)) /* ((h + c) ^\ n)) - ((SVF1 (1,f,z0)) /* (c ^\ n)) = (L /* (h ^\ n)) + (R /* (h ^\ n)) by FUNCT_2:63;
then A45: ((L /* (h ^\ n)) + (R /* (h ^\ n))) (#) ((h ^\ n) ") = ((((SVF1 (1,f,z0)) /* (h + c)) ^\ n) - ((SVF1 (1,f,z0)) /* (c ^\ n))) (#) ((h ^\ n) ") by A40, VALUED_0:27
.= ((((SVF1 (1,f,z0)) /* (h + c)) ^\ n) - (((SVF1 (1,f,z0)) /* c) ^\ n)) (#) ((h ^\ n) ") by A15, VALUED_0:27
.= ((((SVF1 (1,f,z0)) /* (h + c)) - ((SVF1 (1,f,z0)) /* c)) ^\ n) (#) ((h ^\ n) ") by SEQM_3:17
.= ((((SVF1 (1,f,z0)) /* (h + c)) - ((SVF1 (1,f,z0)) /* c)) ^\ n) (#) ((h ") ^\ n) by SEQM_3:18
.= ((((SVF1 (1,f,z0)) /* (h + c)) - ((SVF1 (1,f,z0)) /* c)) (#) (h ")) ^\ n by SEQM_3:19 ;
then A46: L . 1 = lim ((h ") (#) (((SVF1 (1,f,z0)) /* (h + c)) - ((SVF1 (1,f,z0)) /* c))) by A29, SEQ_4:22;
thus (h ") (#) (((SVF1 (1,f,z0)) /* (h + c)) - ((SVF1 (1,f,z0)) /* c)) is convergent by A29, A45, SEQ_4:21; :: thesis:
for x being Real st x in N2 holds
((SVF1 (1,f,z0)) . x) - ((SVF1 (1,f,z0)) . x0) = (L . (x - x0)) + (R . (x - x0)) by A25, A8;
hence partdiff (f,z0,1) = lim ((h ") (#) (((SVF1 (1,f,z0)) /* (h + c)) - ((SVF1 (1,f,z0)) /* c))) by A1, A3, A9, A46, Th11; :: thesis: