(13steps)
PrintForm
Definitions
Lemmas
int
2
Sections
StandardLIB
Doc
At:
mul
cancel
in
eq
1
2
2
1.
a:
2.
b:
3.
n:
4.
m:
. m
a = m
b
a = b
5.
n
a = n
b
6.
n > 0
a = b
By:
Assert ((-n)
(-a) = (-n)
(-b))
Generated subgoals:
1
(-n)
(-a) = (-n)
(-b)
2
7.
(-n)
(-a) = (-n)
(-b)
a = b
About:
(13steps)
PrintForm
Definitions
Lemmas
int
2
Sections
StandardLIB
Doc
(-n)
(-a) = (-n)(-b)(-a) = (-n)(-b) a = b
m:
. ma = mb 
a = ba = nb
n > 0 a = b(-a) = (-n)(-b)) (-n)(-a) = (-n)(-b)(-a) = (-n)(-b) a = b
