let a, b be Real; :: thesis: for Z being open Subset of REAL
for f, f1 being PartFunc of REAL,REAL st Z c= dom ((id Z) + ((a + b) (#) f)) & f = ln * f1 & ( for x being Real st x in Z holds
( f1 . x = x - b & f1 . x > 0 ) ) holds
( (id Z) + ((a + b) (#) f) is_differentiable_on Z & ( for x being Real st x in Z holds
(((id Z) + ((a + b) (#) f)) `| Z) . x = (x + a) / (x - b) ) )
let Z be open Subset of REAL; :: thesis: for f, f1 being PartFunc of REAL,REAL st Z c= dom ((id Z) + ((a + b) (#) f)) & f = ln * f1 & ( for x being Real st x in Z holds
( f1 . x = x - b & f1 . x > 0 ) ) holds
( (id Z) + ((a + b) (#) f) is_differentiable_on Z & ( for x being Real st x in Z holds
(((id Z) + ((a + b) (#) f)) `| Z) . x = (x + a) / (x - b) ) )
let f, f1 be PartFunc of REAL,REAL; :: thesis: ( Z c= dom ((id Z) + ((a + b) (#) f)) & f = ln * f1 & ( for x being Real st x in Z holds
( f1 . x = x - b & f1 . x > 0 ) ) implies ( (id Z) + ((a + b) (#) f) is_differentiable_on Z & ( for x being Real st x in Z holds
(((id Z) + ((a + b) (#) f)) `| Z) . x = (x + a) / (x - b) ) ) )
assume that
A1: Z c= dom ((id Z) + ((a + b) (#) f)) and
A2: f = ln * f1 and
A3: for x being Real st x in Z holds
( f1 . x = x - b & f1 . x > 0 ) ; :: thesis: ( (id Z) + ((a + b) (#) f) is_differentiable_on Z & ( for x being Real st x in Z holds
(((id Z) + ((a + b) (#) f)) `| Z) . x = (x + a) / (x - b) ) )
A4: Z c= (dom (id Z)) /\ (dom ((a + b) (#) f)) by A1, VALUED_1:def 1;
then A5: Z c= dom ((a + b) (#) f) by XBOOLE_1:18;
then A6: Z c= dom (ln * f1) by A2, VALUED_1:def 5;
then A7: f is_differentiable_on Z by A2, A3, Th2;
then A8: (a + b) (#) f is_differentiable_on Z by A5, FDIFF_1:20;
A9: for x being Real st x in Z holds
(id Z) . x = (1 * x) + 0 by FUNCT_1:18;
A10: Z c= dom (id Z) by A4, XBOOLE_1:18;
then A11: id Z is_differentiable_on Z by A9, FDIFF_1:23;
A12: for x being Real st x in Z holds
(((a + b) (#) f) `| Z) . x = (a + b) / (x - b)

proof

let x be Real; :: thesis: ( x in Z implies (((a + b) (#) f) `| Z) . x = (a + b) / (x - b) )
assume A13: x in Z ; :: thesis: (((a + b) (#) f) `| Z) . x = (a + b) / (x - b)
hence (((a + b) (#) f) `| Z) . x = (a + b) * (diff (f,x)) by A5, A7, FDIFF_1:20
.= (a + b) * ((f `| Z) . x) by A7, A13, FDIFF_1:def 7
.= (a + b) * (1 / (x - b)) by A2, A3, A6, A13, Th2
.= (a + b) / (x - b) by XCMPLX_1:99 ;
:: thesis: verum

end;

for x being Real st x in Z holds
(((id Z) + ((a + b) (#) f)) `| Z) . x = (x + a) / (x - b)

proof

let x be Real; :: thesis: ( x in Z implies (((id Z) + ((a + b) (#) f)) `| Z) . x = (x + a) / (x - b) )
assume A14: x in Z ; :: thesis: (((id Z) + ((a + b) (#) f)) `| Z) . x = (x + a) / (x - b)
then A15: ( f1 . x = x - b & f1 . x > 0 ) by A3;
(((id Z) + ((a + b) (#) f)) `| Z) . x = (diff ((id Z),x)) + (diff (((a + b) (#) f),x)) by A1, A11, A8, A14, FDIFF_1:18
.= (((id Z) `| Z) . x) + (diff (((a + b) (#) f),x)) by A11, A14, FDIFF_1:def 7
.= (((id Z) `| Z) . x) + ((((a + b) (#) f) `| Z) . x) by A8, A14, FDIFF_1:def 7
.= 1 + ((((a + b) (#) f) `| Z) . x) by A10, A9, A14, FDIFF_1:23
.= 1 + ((a + b) / (x - b)) by A12, A14
.= ((1 * (x - b)) + (a + b)) / (x - b) by A15, XCMPLX_1:113
.= (x + a) / (x - b) ;
hence (((id Z) + ((a + b) (#) f)) `| Z) . x = (x + a) / (x - b) ; :: thesis: verum

end;

hence ( (id Z) + ((a + b) (#) f) is_differentiable_on Z & ( for x being Real st x in Z holds
(((id Z) + ((a + b) (#) f)) `| Z) . x = (x + a) / (x - b) ) ) by A1, A11, A8, FDIFF_1:18; :: thesis: verum