[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Proof step 1 from proof aligndown-aligndown-add (conclusion)
n ≠ 0 ⊦ align↓(align↓(n0, n) + n1, n) = align↓(n0, n) + align↓(n1, n)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
⊦ align↓(align↓(n0, n) + n1, n) = align↓(n0, n) + align↓(n1, n), n = 0
Rule argument
Additional information