[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 4 from proof inni-ls-01 (
previous step
)
i→n(j) ≤ m + n, n→i(m + n) < j, 0 < j ⊦
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 5
:
⊦ i→n(i) ≤ n → ¬ n→i(n) < i
Rule argument
spec: intnat inst: name: inni-le seq: ⊦ i→n(i) ≤ n → ¬ n→i(n) < i subst: [i, n] → [j, m + n] flags: rewrite, current
Additional information
Used terms: j, m + n