set f0 = x_+_ 0;
set f1 = x_+_ 1;
set f2 = ln * ((x_+_ 1) | rohl);
A1: x_+_ 0 is_differentiable_on rohl by Lm33;
A2: x_+_ 1 is_differentiable_on rohl by Lm33;
A3: ln * ((x_+_ 1) | rohl) is_differentiable_on rohl by Th14, Lm47;
then A4: ( (x_+_ 1) (#) (ln * ((x_+_ 1) | rohl)) is_differentiable_on rohl & ((x_+_ 1) (#) (ln * ((x_+_ 1) | rohl))) `| rohl = (((x_+_ 1) `| rohl) (#) (ln * ((x_+_ 1) | rohl))) + ((x_+_ 1) (#) ((ln * ((x_+_ 1) | rohl)) `| rohl)) ) by A2, FDIFF_2:20;
A5: dom ((x_+_ 1) (#) (((x_+_ 1) ^) | rohl)) = (dom (x_+_ 1)) /\ (dom (((x_+_ 1) ^) | rohl)) by VALUED_1:def 4
.= REAL /\ rohl by Lm42, FUNCT_2:def 1
.= rohl by XBOOLE_1:28 ;
A6: (x_+_ 1) (#) (((x_+_ 1) ^) | rohl) = rohl --> 1
proof
for x being object st x in dom ((x_+_ 1) (#) (((x_+_ 1) ^) | rohl)) holds
((x_+_ 1) (#) (((x_+_ 1) ^) | rohl)) . x = (rohl --> 1) . x
proof
let x be object ; :: thesis: ( x in dom ((x_+_ 1) (#) (((x_+_ 1) ^) | rohl)) implies ((x_+_ 1) (#) (((x_+_ 1) ^) | rohl)) . x = (rohl --> 1) . x )
assume A7: x in dom ((x_+_ 1) (#) (((x_+_ 1) ^) | rohl)) ; :: thesis: ((x_+_ 1) (#) (((x_+_ 1) ^) | rohl)) . x = (rohl --> 1) . x
then A8: x in ].(- 1),+infty.[ by A5, LIMFUNC1:def 3;
reconsider x1 = x as Real by A7;
(x_+_ 1) . x1 = (1 * x1) + 1 by FCONT_1:def 4
.= x1 + 1 ;
then A9: (x_+_ 1) . x1 <> 0 by A8, XXREAL_1:4;
then x in support (x_+_ 1) by PRE_POLY:def 7;
then A10: x in dom ((x_+_ 1) ^) by Lm40;
((x_+_ 1) (#) (((x_+_ 1) ^) | rohl)) . x = ((x_+_ 1) . x1) * ((((x_+_ 1) ^) | rohl) . x1) by A7, VALUED_1:def 4
.= ((x_+_ 1) . x1) * (((x_+_ 1) ^) . x1) by A7, A5, FUNCT_1:49
.= ((x_+_ 1) . x1) * (1 / ((x_+_ 1) . x1)) by A10, RFUNCT_1:def 2
.= 1 by A9, XCMPLX_1:106
.= (rohl --> 1) . x by A7, A5, FUNCOP_1:7 ;
hence ((x_+_ 1) (#) (((x_+_ 1) ^) | rohl)) . x = (rohl --> 1) . x ; :: thesis: verum
end;
hence (x_+_ 1) (#) (((x_+_ 1) ^) | rohl) = rohl --> 1 by A5; :: thesis: verum
end;
A11: ((x_+_ 1) (#) (ln * ((x_+_ 1) | rohl))) `| rohl = (((x_+_ 1) `| rohl) (#) (ln * ((x_+_ 1) | rohl))) + ((x_+_ 1) (#) ((ln * ((x_+_ 1) | rohl)) `| rohl)) by A2, A3, FDIFF_2:20
.= ((rohl --> 1) (#) (ln * ((x_+_ 1) | rohl))) + (rohl --> 1) by A6, Th15, Lm35 ;
A12: (- (1 (#) (x_+_ 0))) `| rohl = - (1 (#) ((x_+_ 0) `| rohl)) by A1, FDIFF_2:19
.= - (1 (#) (rohl --> 1)) by Lm35 ;
A13: ( - (1 (#) (x_+_ 0)) is_differentiable_on rohl & (- (1 (#) (x_+_ 0))) `| rohl = - (1 (#) ((x_+_ 0) `| rohl)) ) by A1, FDIFF_2:19;
1 is Element of REAL by NUMBERS:19;
then reconsider h = rohl --> 1 as Function of rohl,REAL by FUNCOP_1:46;
A14: dom ((rohl --> 1) (#) (ln * ((x_+_ 1) | rohl))) = (dom (rohl --> 1)) /\ (dom (ln * ((x_+_ 1) | rohl))) by VALUED_1:def 4
.= rohl by Lm47 ;
A15: dom (((rohl --> 1) (#) (ln * ((x_+_ 1) | rohl))) + (rohl --> 1)) = (dom ((rohl --> 1) (#) (ln * ((x_+_ 1) | rohl)))) /\ (dom (rohl --> 1)) by VALUED_1:def 1
.= rohl by A14 ;
then A16: dom ((((rohl --> 1) (#) (ln * ((x_+_ 1) | rohl))) + (rohl --> 1)) + ((- 1) (#) (rohl --> 1))) = rohl /\ (dom ((- 1) (#) (rohl --> 1))) by VALUED_1:def 1
.= rohl /\ (dom (rohl --> 1)) by VALUED_1:def 5
.= rohl ;
(((rohl --> 1) (#) (ln * ((x_+_ 1) | rohl))) + (rohl --> 1)) + ((- 1) (#) (rohl --> 1)) = ln * ((x_+_ 1) | rohl)
proof
for o being object st o in dom (ln * ((x_+_ 1) | rohl)) holds
((((rohl --> 1) (#) (ln * ((x_+_ 1) | rohl))) + (rohl --> 1)) + ((- 1) (#) (rohl --> 1))) . o = (ln * ((x_+_ 1) | rohl)) . o
proof
let o be object ; :: thesis: ( o in dom (ln * ((x_+_ 1) | rohl)) implies ((((rohl --> 1) (#) (ln * ((x_+_ 1) | rohl))) + (rohl --> 1)) + ((- 1) (#) (rohl --> 1))) . o = (ln * ((x_+_ 1) | rohl)) . o )
assume A18: o in dom (ln * ((x_+_ 1) | rohl)) ; :: thesis: ((((rohl --> 1) (#) (ln * ((x_+_ 1) | rohl))) + (rohl --> 1)) + ((- 1) (#) (rohl --> 1))) . o = (ln * ((x_+_ 1) | rohl)) . o
then reconsider x1 = o as Real ;
((rohl --> 1) (#) (ln * ((x_+_ 1) | rohl))) . x1 = ((rohl --> 1) . x1) * ((ln * ((x_+_ 1) | rohl)) . x1) by A18, Lm47, A14, VALUED_1:def 4
.= 1 * ((ln * ((x_+_ 1) | rohl)) . x1) by A18, Lm47, FUNCOP_1:7
.= (ln * ((x_+_ 1) | rohl)) . x1 ;
then A20: (((rohl --> 1) (#) (ln * ((x_+_ 1) | rohl))) + (rohl --> 1)) . x1 = ((ln * ((x_+_ 1) | rohl)) . x1) + ((rohl --> 1) . x1) by A18, Lm47, A15, VALUED_1:def 1
.= ((ln * ((x_+_ 1) | rohl)) . x1) + 1 by A18, Lm47, FUNCOP_1:7 ;
A21: dom ((- 1) (#) (rohl --> 1)) = rohl by VALUED_1:def 5;
((((rohl --> 1) (#) (ln * ((x_+_ 1) | rohl))) + (rohl --> 1)) + ((- 1) (#) (rohl --> 1))) . x1 = (((ln * ((x_+_ 1) | rohl)) . x1) + 1) + (((- 1) (#) (rohl --> 1)) . x1) by A20, A16, A18, Lm47, VALUED_1:def 1
.= (((ln * ((x_+_ 1) | rohl)) . x1) + 1) + ((- 1) * ((rohl --> 1) . x1)) by A21, A18, Lm47, VALUED_1:def 5
.= (((ln * ((x_+_ 1) | rohl)) . x1) + 1) + ((- 1) * 1) by A18, Lm47, FUNCOP_1:7
.= (ln * ((x_+_ 1) | rohl)) . x1 ;
hence ((((rohl --> 1) (#) (ln * ((x_+_ 1) | rohl))) + (rohl --> 1)) + ((- 1) (#) (rohl --> 1))) . o = (ln * ((x_+_ 1) | rohl)) . o ; :: thesis: verum
end;
hence (((rohl --> 1) (#) (ln * ((x_+_ 1) | rohl))) + (rohl --> 1)) + ((- 1) (#) (rohl --> 1)) = ln * ((x_+_ 1) | rohl) by A16, Lm47; :: thesis: verum
end;
hence (((x_+_ 1) (#) (ln * ((x_+_ 1) | rohl))) + (- (1 (#) (x_+_ 0)))) `| rohl = ln * ((x_+_ 1) | rohl) by A12, A11, A4, A13, FDIFF_2:17; :: thesis: verum