[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 10 from proof fle (
previous step
)
m < n0, m < n, n ≤ n0, n0 ≤ m ⊦ n = 0, n0 = 0
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 11
:
⊦ ¬ m ≤ n ↔ n < m
Rule argument
spec: inst: name: lels-01 seq: ⊦ ¬ m ≤ n ↔ n < m subst: [n, m] → [m, n0] flags: rewrite, current
Additional information
Used terms: m, n0