[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-sub-add-sub (conclusion)
n ≠ 0 ⊦ n1 ≤ n0 → n0 - n1 + align↓(n0 - n1, n) = (n0 - n1) % n
System applied rule normalize
And obtained the following new goals
Proof step 2
:
n1 ≤ n0 ⊦ n0 - n1 + align↓(n0 - n1, n) = (n0 - n1) % n, n = 0
Rule argument
Additional information