[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 3 from proof coef-18 (
previous step
)
m * n + 1 * n ≤ m1 * n ↔ m + 1 ≤ m1 ∨ n = 0 ⊦ m * n + n ≤ m1 * n ↔ m + 1 ≤ m1 ∨ n = 0
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 4
:
⊦ m0 * 1 = m0
Rule argument
spec: <toplevel> name: one seq: ⊦ m0 * 1 = m0 subst: [m0] → [n] flags: <all paths>
Additional information
Used simplifier rules: mult-c: ⊦ m * n = n * m; Used terms: n