[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
,
Proof step 9 from proof coef-product-le (
previous step
)
j0 ≤ j * 2 + 1, j + 2 ≤ j0, prime(j0), j0 ∈ ints, binom_coef(2 * j + 1, j) < Π ints, 0 < j ⊦ j0 | binom_coef(2 * j + 1, j), dups(ints)
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 10
:
⊦ j + 2 ≤ j0 ∧ j0 ≤ j * 2 + 1 ∧ prime(j0) ∧ 0 < j → j0 | binom_coef(2 * j + 1, j)
Rule argument
spec: inst: name: prime-divides-coef seq: ⊦ j + 2 ≤ j0 ∧ j0 ≤ j * 2 + 1 ∧ prime(j0) ∧ 0 < j → j0 | binom_coef(2 * j + 1, j) subst: [j, j0] → [j, j0] flags: rewrite, current
Additional information
Used terms: j, j0