[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 5 from proof rounded-help2 (
previous step
)
n0 < m2, m1 < m2, 2 * m2 ≤ n0 + m1 ⊦ m2 = 0
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 1
:
⊦ m < n ↔ (∃ m0. m + m0 = n ∧ m0 ≠ 0)
Rule argument
spec: nat-basic2 inst: name: addex seq: ⊦ m < n ↔ (∃ m0. m + m0 = n ∧ m0 ≠ 0) subst: [n, m] → [m2, m1] flags: rewrite
Additional information
[Concretesimprules(()), Extraterms((m2m1))]