[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 3 from proof zero-gels-01 (
previous step
)
i < 0 ⊦ i < j, j < 0
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 4
:
⊦ ¬ i0 < j ∧ i < j → i < i0
Rule argument
spec: int-basic1 name: forward-any-lsle seq: ⊦ ¬ i0 < j ∧ i < j → i < i0 subst: [i0, j, i] → [j, 0, i] flags: <all paths>
Additional information
Used terms: j, 0, i