[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 12 from proof le-div-to-mult (
previous step
)
(m1 + m) * m0 ≤ m1 * m0 + n0, ∃ m1. n0 + m1 = m0 ∧ m1 ≠ 0 ⊦ m0 = 0, m1 + m = 0, m = 0
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 13
:
(m1 + m) * (n0 + m2) ≤ m1 * (n0 + m2) + n0 ⊦ n0 + m2 = 0, m1 + m = 0, m = 0, m2 = 0
Rule argument
Additional information