[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 8 from proof lst-02 (
previous step
)
0 < j0 ⊦ j0 = ~1, 0 = j0, j0 +1 < 0, 0 < j0 +1
User applied rule insert lemma
And obtained the following new goals
Proof step 9
:
⊦ i < j ∧ j < j0 → i < j0
Rule argument
spec: inst: name: trans seq: ⊦ i < j ∧ j < j0 → i < j0 subst: [i, j, j0] → [0, j0, j0 +1] flags: current, []
Additional information
Used simplifier rules: ls-succ-01: ⊦ i < i +1; Used terms: 0, j0, j0 +1