[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 div-ls-mone
0 < j ⊦ i / (* j) < ~1 ↔ i + 2 * j ≤ 0
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 16
Used lemmas:
div-zero-nls
,
div-elim-negpos
,
Used spec theorems:
int-abs
/
Abs-neg
int-basic2
/
ls-zero
int-basic1
/
ls-rec
Used simplifier rules:
int-abs
/
forward-le-05
int-abs
/
forward-le-04
int-abs
/
forward-lels
int-abs
/
forward-le-02
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
commutativity
int-mult
/
associativity
int-mult
/
dist-rmerge
int-basic2
/
num-between
int-abs
/
le-def
int-basic2
/
add-zero
int-abs
/
numlsledel
int-abs
/
numle-03
int-mult
/
zero-le
int-abs
/
anti
int-abs
/
lels
int-abs
/
Abs-pos
int-abs
/
neg-13
int-abs
/
neg-06
int-abs
/
zero-gels-03
int-mult
/
Mult-zero
int-abs
/
zero-gels-01
int-mult
/
numls-13
int-mult
/
one
int-basic1
/
ls-01
int-abs
/
lels-03
int-basic1
/
lst-01
int-abs
/
mone-06
int-abs
/
mone-08
int-mult
/
modzero-02
int-abs
/
numlelsdel
int-basic1
/
lf-01
int-basic1
/
trans
int-basic2
/
ls-01
int-basic2
/
succ-01
int-basic2
/
ls-02
int-mult
/
zero-gr
int-abs
/
numls-02
int-basic1
/
minus-one
int-basic1
/
numlslsdel-01
int-mult
/
zero-left
int-basic2
/
add-zero-rev
int-abs
/
lep-01
int-abs
/
forward-lele
int-abs
/
zero-gels-04
int-abs
/
forward-le-01