[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 13 from proof alignup-le (
previous step
)
m0 = m0 / n * n ⊦ m0 % n = 0, n = 0
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 14
:
⊦ n ≠ 0 → m % n = m - m / n * n
Rule argument
spec: nat-div name: mod-rew seq: ⊦ n ≠ 0 → m % n = m - m / n * n subst: [n, m] → [n, m0] flags: <all paths>
Additional information
Used simplifier rules: ⊦ m - m = 0; (s) Used terms: n, m0