[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 est-4-big
(2 * i) / 3 < j, j ≤ i, 2 < i, 2 * i < j * j ⊦ (2 * i) / j = 2 * i / j
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
middle-coef-max_exp-big-primes
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 9
Used lemmas:
est-4-big-01
,
Used spec theorems:
int-mult
/
dist-rsplit
int-div
/
div-add1-pospos
Used simplifier rules:
int-abs
/
lels
int-abs
/
forward-lels
int-abs
/
forward-le-04
int-div
/
div-ls-zero
int-abs
/
numle-03
int-div
/
nummult-le-01
int-abs
/
zero-gels-02
int-div
/
div-elim-pospos
int-basic2
/
ls-02
int-basic1
/
numlslsdel-01
int-div
/
less-mult-div-01
int-mult
/
zero-gr
int-abs
/
forward-le-01
int-basic1
/
forward-pos
int-abs
/
forward-le
int-abs
/
forward-lsle
int-abs
/
forward-le-05
int-mult
/
one
int-mult
/
numls-05
int-mult
/
zero-ge-add
int-mult
/
Mult-zero
int-mult
/
zero-ge
int-abs
/
lels-03
int-div
/
div-mult-03
int-div
/
div-zero-05
int-basic2
/
add-zero
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
eq-pos
int-div
/
mod-mult-04
int-abs
/
zero-gels-04
int-abs
/
lels-01
int-basic1
/
ls-01
int-mult
/
associativity
int-mult
/
commutativity