[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-le-same-neg
⊦ i < 0 ∧ 0 < j → (i / j ≤ i ↔ i = 0 ∨ j = 1)
Type: A user defined theorem
Validity: The proof is valid.
Features: ws, lws,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 10
Used lemmas:
div-elim-negpos
,
Used spec theorems:
int-mult
/
numle-12
Used simplifier rules:
int-abs
/
forward-le-05
int-abs
/
forward-le-02
int-abs
/
zero-gels-01
int-abs
/
forward-le-04
int-abs
/
forward-lels
int-mult
/
commutativity
int-abs
/
elim-sub
int-abs
/
zero-gels-04
int-abs
/
forward-lele
int-abs
/
forward-lsle
int-abs
/
forward-le-01
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
succ-02
int-abs
/
mone-06
int-abs
/
numls-02
int-abs
/
numadd-01
int-mult
/
one
int-mult
/
Mult-zero
int-mult
/
associativity
int-basic2
/
add-zero
int-abs
/
anti
int-abs
/
abs-zero
int-abs
/
lels-02
int-abs
/
le-def
int-basic2
/
ls-01
int-mult
/
ls-forward
int-mult
/
modzero-03