[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
,
Theorem ls-02
0 < i0, i / i0 < j / i0 ⊦ i < j
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
div-sum-ls
,
lsf
,
lsfc-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 10
Used lemmas:
div-zero-ngr
,
div-elim-pos
,
neg-01
,
ls-01
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-05
int-abs
/
numls-03
int-abs
/
negle-13
int-abs
/
neg-15
int-abs
/
sub-le-01
int-basic2
/
add-zero-rev
int-abs
/
negle-07
int-abs
/
lels
int-abs
/
zero-gels-01
int-basic2
/
succ-01
int-abs
/
forward-le-02
int-basic1
/
trans
int-basic1
/
lf-01
int-abs
/
zero-gels-03
int-mult
/
zero-ge-add
int-mult
/
associativity
int-mult
/
commutativity
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
forward-lels
int-abs
/
forward-le-01
int-abs
/
forward-lsle
int-abs
/
zero-gels-04
int-abs
/
lels-03
int-abs
/
lels-02
int-abs
/
ler
int-basic1
/
lf-02