[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-not-one-01
⊦ 0 < i → ¬ binom_coef(2 * i, i) < 2
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bertrand-big-primes
,
middle-coef-larger-strongest
,
middle-coef-not-one
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 5
Used lemmas:
middle-coef-largest-01
,
coef-one
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-05
int-basic1
/
forward-pos
int-abs
/
forward-lels
int-basic1
/
lst-01
int-mult
/
zero-gr
int-mult
/
associativity
int-mult
/
commutativity
int-div
/
nummult-ls
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
lsone
int-abs
/
lels-03
int-abs
/
lels