[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-largest-01
⊦ j < i ∧ 0 ≤ j → ¬ binom_coef(2 * i, i) < binom_coef(2 * i, j)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
middle-coef-largest
,
middle-coef-not-one-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 17
Used lemmas:
fac-not-neg
,
fac-ls-zero
,
fac-pos-01
,
fac-le-zero
,
coef-sub
,
Used spec theorems:
int-basic1
/
trans
int-basic2
/
ls-03
int-div
/
div-zero-nls
Used simplifier rules:
int-abs
/
forward-le-01
intnat
/
labs
int-abs
/
abssub-02
int-abs
/
abssub-01
int-abs
/
Sub-def
int-abs
/
numleledel-01
int-abs
/
numle-02
int-mult
/
ls-same
int-abs
/
sub-eq
int-abs
/
sub-add-06
int-abs
/
numsub
int-abs
/
succ-01
int-abs
/
leone
int-abs
/
forward-lels
oelem
/intlista/
transitivity
int-basic2
/
add-zero
int-abs
/
sub-ls
int-mult
/
numls-02
int-mult
/
Mult-zero
int-basic2
/
lst-03
int-mult
/
ls-pos
int-abs
/
forward-le-02
int-abs
/
forward-lsle
int-basic2
/
ls
int-mult
/
zero-gr
int-abs
/
forward-le-05
int-abs
/
ler
int-abs
/
succ-02
int-abs
/
zero-gels-04
int-abs
/
mone-06
int-abs
/
numls-02
int-mult
/
one
int-abs
/
sub-add
oelem
/intlista/
irreflexivity
oelem
/intlista/
lel
int-basic2
/
add-a
int-abs
/
les
int-basic2
/
add-c
int-abs
/
zero-gels-01
int-abs
/
lels-01
int-abs
/
lels
int-mult
/
associativity
int-mult
/
commutativity