let Z be open Subset of REAL; :: thesis: ( Z c= dom (ln * ((x_+_ 1) | rohl)) implies ( ln * ((x_+_ 1) | rohl) is_differentiable_on Z & ( for x being Real st x in Z holds
((ln * ((x_+_ 1) | rohl)) `| Z) . x = 1 / (1 + x) ) ) )

set f = (x_+_ 1) | rohl;
assume A1: Z c= dom (ln * ((x_+_ 1) | rohl)) ; :: thesis: ( ln * ((x_+_ 1) | rohl) is_differentiable_on Z & ( for x being Real st x in Z holds
((ln * ((x_+_ 1) | rohl)) `| Z) . x = 1 / (1 + x) ) )

for x being Real st x in Z holds
( ((x_+_ 1) | rohl) . x = 1 + x & ((x_+_ 1) | rohl) . x > 0 )
proof
let x be Real; :: thesis: ( x in Z implies ( ((x_+_ 1) | rohl) . x = 1 + x & ((x_+_ 1) | rohl) . x > 0 ) )
assume A2: x in Z ; :: thesis: ( ((x_+_ 1) | rohl) . x = 1 + x & ((x_+_ 1) | rohl) . x > 0 )
then x in rohl by Lm47, A1;
then x in ].(- 1),+infty.[ by LIMFUNC1:def 3;
then ( - 1 < x & x < +infty ) by XXREAL_1:4;
then A3: (- 1) + 1 < x + 1 by XREAL_1:8;
((x_+_ 1) | rohl) . x = (x_+_ 1) . x by A2, Lm47, A1, FUNCT_1:49
.= (1 * x) + 1 by FCONT_1:def 4
.= x + 1 ;
hence ( ((x_+_ 1) | rohl) . x = 1 + x & ((x_+_ 1) | rohl) . x > 0 ) by A3; :: thesis: verum
end;
hence ( ln * ((x_+_ 1) | rohl) is_differentiable_on Z & ( for x being Real st x in Z holds
((ln * ((x_+_ 1) | rohl)) `| Z) . x = 1 / (1 + x) ) ) by A1, FDIFF_4:1; :: thesis: verum