let m, n be non zero Element of NAT ; for f being PartFunc of (REAL-NS m),(REAL-NS n)
for X being Subset of (REAL-NS m) st X is open holds
( ( for i being Nat st 1 <= i & i <= m holds
( f is_partial_differentiable_on X,i & f `partial| (X,i) is_continuous_on X ) ) iff ( f is_differentiable_on X & f `| X is_continuous_on X ) )
let f be PartFunc of (REAL-NS m),(REAL-NS n); for X being Subset of (REAL-NS m) st X is open holds
( ( for i being Nat st 1 <= i & i <= m holds
( f is_partial_differentiable_on X,i & f `partial| (X,i) is_continuous_on X ) ) iff ( f is_differentiable_on X & f `| X is_continuous_on X ) )
let X be Subset of (REAL-NS m); ( X is open implies ( ( for i being Nat st 1 <= i & i <= m holds
( f is_partial_differentiable_on X,i & f `partial| (X,i) is_continuous_on X ) ) iff ( f is_differentiable_on X & f `| X is_continuous_on X ) ) )
assume A1:
X is open
; ( ( for i being Nat st 1 <= i & i <= m holds
( f is_partial_differentiable_on X,i & f `partial| (X,i) is_continuous_on X ) ) iff ( f is_differentiable_on X & f `| X is_continuous_on X ) )
hereby ( f is_differentiable_on X & f `| X is_continuous_on X implies for i being Nat st 1 <= i & i <= m holds
( f is_partial_differentiable_on X,i & f `partial| (X,i) is_continuous_on X ) )
assume A2:
for
i being
Nat st 1
<= i &
i <= m holds
(
f is_partial_differentiable_on X,
i &
f `partial| (
X,
i)
is_continuous_on X )
;
( f is_differentiable_on X & f `| X is_continuous_on X )now for j being Nat st 1 <= j & j <= n holds
( (Proj (j,n)) * f is_differentiable_on X & ((Proj (j,n)) * f) `| X is_continuous_on X )let j be
Nat;
( 1 <= j & j <= n implies ( (Proj (j,n)) * f is_differentiable_on X & ((Proj (j,n)) * f) `| X is_continuous_on X ) )assume A3:
( 1
<= j &
j <= n )
;
( (Proj (j,n)) * f is_differentiable_on X & ((Proj (j,n)) * f) `| X is_continuous_on X )now for i being Nat st 1 <= i & i <= m holds
( (Proj (j,n)) * f is_partial_differentiable_on X,i & ((Proj (j,n)) * f) `partial| (X,i) is_continuous_on X )let i be
Nat;
( 1 <= i & i <= m implies ( (Proj (j,n)) * f is_partial_differentiable_on X,i & ((Proj (j,n)) * f) `partial| (X,i) is_continuous_on X ) )assume A4:
( 1
<= i &
i <= m )
;
( (Proj (j,n)) * f is_partial_differentiable_on X,i & ((Proj (j,n)) * f) `partial| (X,i) is_continuous_on X )then
(
f is_partial_differentiable_on X,
i &
f `partial| (
X,
i)
is_continuous_on X )
by A2;
hence
(
(Proj (j,n)) * f is_partial_differentiable_on X,
i &
((Proj (j,n)) * f) `partial| (
X,
i)
is_continuous_on X )
by Th20, A1, A3, A4;
verum end; hence
(
(Proj (j,n)) * f is_differentiable_on X &
((Proj (j,n)) * f) `| X is_continuous_on X )
by A1, PDIFF_7:49;
verum end; hence
(
f is_differentiable_on X &
f `| X is_continuous_on X )
by A1, Th21;
verum
end;
assume A5:
( f is_differentiable_on X & f `| X is_continuous_on X )
; for i being Nat st 1 <= i & i <= m holds
( f is_partial_differentiable_on X,i & f `partial| (X,i) is_continuous_on X )
let i be Nat; ( 1 <= i & i <= m implies ( f is_partial_differentiable_on X,i & f `partial| (X,i) is_continuous_on X ) )
assume A6:
( 1 <= i & i <= m )
; ( f is_partial_differentiable_on X,i & f `partial| (X,i) is_continuous_on X )
now for j being Nat st 1 <= j & j <= n holds
( (Proj (j,n)) * f is_partial_differentiable_on X,i & ((Proj (j,n)) * f) `partial| (X,i) is_continuous_on X )let j be
Nat;
( 1 <= j & j <= n implies ( (Proj (j,n)) * f is_partial_differentiable_on X,i & ((Proj (j,n)) * f) `partial| (X,i) is_continuous_on X ) )assume
( 1
<= j &
j <= n )
;
( (Proj (j,n)) * f is_partial_differentiable_on X,i & ((Proj (j,n)) * f) `partial| (X,i) is_continuous_on X )then
(
(Proj (j,n)) * f is_differentiable_on X &
((Proj (j,n)) * f) `| X is_continuous_on X )
by A1, A5, Th21;
hence
(
(Proj (j,n)) * f is_partial_differentiable_on X,
i &
((Proj (j,n)) * f) `partial| (
X,
i)
is_continuous_on X )
by A1, A6, PDIFF_7:49;
verum end;
hence
( f is_partial_differentiable_on X,i & f `partial| (X,i) is_continuous_on X )
by A6, A1, Th20; verum