[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 middle-coef-larger
0 ≤ i ⊦ binom_coef(2 * i, i) ≥ 4 ^ i / (2 * i + 1)
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: 3
Proof steps: 6
Used lemmas:
coef-le-zero
,
coef-nls-zero
,
coef-zero
,
middle-coef-larger-strongest
,
Used spec theorems:
int-div
/
div-ls-modnotzero
int-mult
/
le-pos
Used simplifier rules:
int-abs
/
anti
int-abs
/
ge-def
int-pot
/
notneg-02
int-abs
/
forward-le-05
int-abs
/
lels-02
int-abs
/
lels-01
int-mult
/
zero-ge-02
int-abs
/
zero-gels-04
int-mult
/
zero-ge
int-abs
/
mone-06
int-abs
/
numls-02
int-mult
/
numle-02
int-mult
/
Mult-zero
int-mult
/
associativity
int-mult
/
commutativity
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
lels
oelem
/intlista/
lel
int-abs
/
forward-le-04
int-abs
/
forward-le-01
int-abs
/
forward-lele
int-pot
/
pot-lez
int-pot
/
pot-zero-01
int-basic1
/
ls-01