[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-01
i0 ≠ 0, j0 ≠ 0, 0 ≤ i, 0 ≤ i0, i ≤ j, i0 ≤ j0 ⊦ i / j0 ≤ j / i0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
ls-02
,
ls-03
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 7
Used lemmas:
div-elim-pos
,
Used spec theorems:
int-mult
/
modlep-03
Used simplifier rules:
int-abs
/
forward-lele
int-abs
/
zero-gels-04
int-abs
/
forward-lels
int-abs
/
forward-le-05
int-abs
/
forward-le-01
int-mult
/
zero-ge-add
int-abs
/
lels-01
int-abs
/
forward-lsle
int-basic2
/
ls-01
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
ls-forward
int-mult
/
associativity
int-abs
/
lels-02
int-mult
/
ls-pos
int-abs
/
lenls
int-abs
/
lels-03
int-mult
/
commutativity
int-abs
/
absle