[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-strongest
0 < i ⊦ binom_coef(2 * i, i) * 2 * i ≥ 4 ^ i
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
BertrandsPostulate
,
middle-coef-larger
,
middle-coef-larger-stronger
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 19
Proof steps: 35
Used lemmas:
middle-coef-largest
,
middle-coef-not-one-01
,
middle-coef-not-one
,
coef-same
,
coef-zero
,
Binom-theorem-countFun
,
Used spec theorems:
int-pot
/
pot-pot-02
intlist
/
countFun-rec
intlist
/
countFun-last
intlist
/
sum-all-elems-le
intlist
/
countFun-length
int-abs
/
Abs-pos
int-mult
/
numsucc
intlist
/
countFun-in
Used simplifier rules:
int-abs
/
forward-le-05
int-abs
/
ge-def
int-mult
/
one
int-pot
/
one-01
int-basic1
/
ls-01
intlist
/
sum-rec
int-abs
/
lels
int-abs
/
anti
oelem
/intlista/
irreflexivity
list
/intlista/
in-17
list
/intlista/
in-append
int-mult
/
zero-gr
list
/intlista/
a
intlist
/
sum-one
intlist
/
sum-app
intnat
/
ini2-abs
int-div
/
nummult-ls-02
int-abs
/
sub-ls-01
int-abs
/
leone
int-mult
/
zero-ge
oelem
/intlista/
lel
int-abs
/
numadd-01
int-abs
/
lels-02
int-abs
/
bet-01
int-div
/
nummult-ls
int-abs
/
sub-ls
int-abs
/
forward-le
int-abs
/
forward-le-01
int-abs
/
Sub-def
int-abs
/
lels-03
int-abs
/
lels-01
int-abs
/
int-simp-07
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
zero-gels-04
int-mult
/
le-same-01
int-mult
/
associativity
int-mult
/
commutativity