[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-mult-three-nls
⊦ 2 ≤ j → ¬ (j * j * j) / 3 < j
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
int-pot
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 14
Proof steps: 17
Used lemmas:
div-elim-pospos
,
Used spec theorems:
int-mult
/
ls-pos-01
int-basic2
/
add-c
int-basic2
/
plst
Used simplifier rules:
int-abs
/
forward-le
int-abs
/
forward-le-05
int-abs
/
forward-le-01
int-mult
/
zero-ge
int-basic2
/
ls-01
int-abs
/
lels-03
int-abs
/
numls-02
int-abs
/
forward-lels
int-abs
/
forward-lsle
int-basic1
/
ls-01
int-basic1
/
numlslsdel-01
int-basic1
/
forward-pos
int-basic1
/
lst
int-abs
/
succ-02
int-mult
/
le-same
int-abs
/
bet
int-mult
/
one-01
int-mult
/
numls-07
int-mult
/
zero-gr-01
int-abs
/
zero-gs
int-basic1
/
lst-01
int-basic2
/
zero-02
int-basic2
/
num-between
int-abs
/
lels-02
int-mult
/
succ-rmerge
int-mult
/
associativity
int-mult
/
commutativity
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
lels
int-abs
/
numlelsdel
int-mult
/
ls-pos