[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-est-nle-pos
⊦ ¬ i0 * j ≤ i ∧ 0 ≤ i ∧ 0 < j → ¬ i0 ≤ i / j
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 4
Used lemmas:
div-elim-pospos
,
Used spec theorems:
int-mult
/
modlsp-02
Used simplifier rules:
int-mult
/
zero-gr
int-abs
/
forward-le-05
int-abs
/
lels-01
int-abs
/
forward-le-01
int-abs
/
forward-lsle
int-abs
/
zero-gels-04
int-mult
/
zero-ge-add
int-abs
/
anti
int-abs
/
ler
int-mult
/
mods-ls-04
int-basic1
/
irref
int-mult
/
associativity
int-mult
/
commutativity
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
absle