[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 2 from proof less-05 (
previous step
)
m < m0 ⊦ m + n < m0 + n0, n0 < n
User applied rule insert lemma
And obtained the following new goals
Proof step 3
:
¬ m0 < n0, n < m ⊦ n + n0 < m + m0
Rule argument
spec: <toplevel> name: less seq: ¬ m0 < n0, n < m ⊦ n + n0 < m + m0 subst: [m0, n0, n, m] → [n0, n, m, m0]
Additional information
Used terms: n0, n, m, m0