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