[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 8 from proof aligndown-is-n (
previous step
)
n0 + n1 - (n0 + n1) / n * n = 0, n0 + n1 < 2 * n, n < n0 + n1 ⊦ n0 + n1 = n, n = 1, n = 0
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 9
:
n0 + n1 - (n0 + n1) / n * n = 0, n < n0 + n1, n0 + n1 < 2 * n ⊦ n0 + n1 = n, n = 0, n = 1
Rule argument
Additional information