let x, y be R_eal; :: thesis: ( 0 <= x * y implies |.(x + y).| = |.x.| + |.y.| )
assume A1: 0 <= x * y ; :: thesis: |.(x + y).| = |.x.| + |.y.|

per cases ( ( ( 0 <= x or 0 < x ) & ( 0 <= y or 0 < y ) ) or ( ( x <= 0 or x < 0 ) & ( y <= 0 or y < 0 ) ) ) by A1, Th44;

suppose A2: ( ( 0 <= x or 0 < x ) & ( 0 <= y or 0 < y ) ) ; :: thesis: |.(x + y).| = |.x.| + |.y.|

then A3: ( |.x.| = x & |.y.| = y ) by EXTREAL1:def 3;
0 <= x + y by A2, Th7;
hence |.(x + y).| = |.x.| + |.y.| by A3, EXTREAL1:def 3; :: thesis: verum

end;

suppose A4: ( ( x <= 0 or x < 0 ) & ( y <= 0 or y < 0 ) ) ; :: thesis: |.(x + y).| = |.x.| + |.y.|

then A5: ( |.x.| = - x & |.y.| = - y ) by Th55;
|.(x + y).| = - (x + y) by A4, Th9, Th55
.= (- x) - y by Th14 ;
hence |.(x + y).| = |.x.| + |.y.| by A5; :: thesis: verum

end;

end;