[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-stronger
0 < i ⊦ binom_coef(2 * i, i) ≥ 4 ^ i / (2 * i)
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-zero
,
middle-coef-larger-strongest
,
Used spec theorems:
int-div
/
div-ls-modnotzero
Used simplifier rules:
int-abs
/
forward-le-05
int-abs
/
lels
int-abs
/
ge-def
int-abs
/
lels-01
int-pot
/
notneg-02
int-pot
/
le-pos-01
int-abs
/
forward-lele
int-abs
/
anti
int-mult
/
zero-gr
int-mult
/
associativity
int-mult
/
commutativity
int-div
/
div-mult-01
int-div
/
div-mult-num
int-mult
/
one