[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 6 from proof alignup-add-bounded1 (
previous step
)
n ≤ m ⊦ n % m = 0, m * n / m + m = (n = 0 ⊃ 0;m), m = 0
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 7
:
n ≤ m ⊦ n % m = 0, m * n / m + m = (n = 0 ⊃ 0;m), m = 0
Rule argument
Additional information