let L be non empty addLoopStr ; ( L is Loop-like iff ( ( for a, b being Element of L ex x being Element of L st a + x = b ) & ( for a, b being Element of L ex x being Element of L st x + a = b ) & ( for a, x, y being Element of L st a + x = a + y holds
x = y ) & ( for a, x, y being Element of L st x + a = y + a holds
x = y ) ) )
thus
( L is Loop-like implies ( ( for a, b being Element of L ex x being Element of L st a + x = b ) & ( for a, b being Element of L ex x being Element of L st x + a = b ) & ( for a, x, y being Element of L st a + x = a + y holds
x = y ) & ( for a, x, y being Element of L st x + a = y + a holds
x = y ) ) )
by Def3, Def4, ALGSTR_0:def 3, ALGSTR_0:def 4; ( ( for a, b being Element of L ex x being Element of L st a + x = b ) & ( for a, b being Element of L ex x being Element of L st x + a = b ) & ( for a, x, y being Element of L st a + x = a + y holds
x = y ) & ( for a, x, y being Element of L st x + a = y + a holds
x = y ) implies L is Loop-like )
assume that
A1:
( ( for a, b being Element of L ex x being Element of L st a + x = b ) & ( for a, b being Element of L ex x being Element of L st x + a = b ) )
and
A2:
for a, x, y being Element of L st a + x = a + y holds
x = y
and
A3:
for a, x, y being Element of L st x + a = y + a holds
x = y
; L is Loop-like
thus
L is left_add-cancelable
ALGSTR_1:def 5 ( L is right_add-cancelable & L is add-left-invertible & L is add-right-invertible )
thus
L is right_add-cancelable
( L is add-left-invertible & L is add-right-invertible )
thus
( L is add-left-invertible & L is add-right-invertible )
by A1; verum