[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-max_exp-le
i ^ i0 ≤ 2 * j, 2 * j < i ^ (i0 + 1), 0 ≤ i0, prime(i), 0 < j ⊦ max_exp(i, binom_coef(2 * j, j)) ≤ i0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
middle-coef-max_exp-stronger
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 12
Used lemmas:
middle-coef-max_exp-equality
,
Used spec theorems:
intlist
/
sum-all-elems-le
intlist
/
countFun-in
int-div
/
div-mult-two-nls-01
int-pot
/
notneg-01
intlist
/
countFun-length
intlist
/
countFun-base
Used simplifier rules:
int-abs
/
sub-ls-01
int-abs
/
zero-gels-04
int-abs
/
forward-le-04
int-abs
/
forward-lele
int-gcd
/
prime-not-neg-01
int-basic1
/
ls-01
int-abs
/
forward-lels
int-abs
/
forward-le-01
int-abs
/
forward-lsle
int-abs
/
lels-01
int-mult
/
one
int-abs
/
numsub
int-basic2
/
add-zero
intnat
/
i2i-pos
int-abs
/
lels-03
int-basic1
/
forward-pos
int-abs
/
forward-le-05
int-abs
/
forward-le
int-mult
/
commutativity
int-mult
/
associativity
int-mult
/
zero-gr
int-pot
/
one
int-basic2
/
add-c
int-basic2
/
add-a
int-pot
/
Pot-zero
list-data
/intlista/
l
nat-basic1
/
zero
intnat
/
num-n2i-ls-02
oelem
/intlista/
lel
int-abs
/
anti
int-abs
/
lels
int-abs
/
leone