let m be non empty Element of NAT ; :: thesis: for i being Element of NAT
for X being Subset of (REAL m)
for f being PartFunc of (REAL m),REAL
for g being PartFunc of (REAL m),(REAL 1) st <>* f = g & X is open & 1 <= i & i <= m holds
( f is_partial_differentiable_on X,i iff g is_partial_differentiable_on X,i )

let i be Element of NAT ; :: thesis: for X being Subset of (REAL m)
for f being PartFunc of (REAL m),REAL
for g being PartFunc of (REAL m),(REAL 1) st <>* f = g & X is open & 1 <= i & i <= m holds
( f is_partial_differentiable_on X,i iff g is_partial_differentiable_on X,i )

let X be Subset of (REAL m); :: thesis: for f being PartFunc of (REAL m),REAL
for g being PartFunc of (REAL m),(REAL 1) st <>* f = g & X is open & 1 <= i & i <= m holds
( f is_partial_differentiable_on X,i iff g is_partial_differentiable_on X,i )

let f be PartFunc of (REAL m),REAL; :: thesis: for g being PartFunc of (REAL m),(REAL 1) st <>* f = g & X is open & 1 <= i & i <= m holds
( f is_partial_differentiable_on X,i iff g is_partial_differentiable_on X,i )

let g be PartFunc of (REAL m),(REAL 1); :: thesis: ( <>* f = g & X is open & 1 <= i & i <= m implies ( f is_partial_differentiable_on X,i iff g is_partial_differentiable_on X,i ) )
assume AS: ( <>* f = g & X is open & 1 <= i & i <= m ) ; :: thesis: ( f is_partial_differentiable_on X,i iff g is_partial_differentiable_on X,i )
hereby :: thesis: ( g is_partial_differentiable_on X,i implies f is_partial_differentiable_on X,i ) end;
hereby :: thesis: verum end;