[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 1 from proof square-le-03 (conclusion)
⊦ m * (m + m0) ≤ n * (n + m0) ↔ m ≤ n
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 2
:
⊦ m ≤ n ↔ ¬ n < m
Proof step 3
:
⊦ ¬ n * (n + m0) < m * (m + m0) ↔ m ≤ n
Rule argument
spec: nat inst: name: le-def seq: ⊦ m ≤ n ↔ ¬ n < m subst: [n, m] → [n * (n + m0), m * (m + m0)] flags: rewrite
Additional information
Used terms: n * (n + m0), m * (m + m0)