[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 coef-sub-mult
⊦ 1 ≤ j ∧ j ≤ i → (binom_coef(i, j) - binom_coef(i, j - 1)) * fac(j) * fac(i + 1 - j) = fac(i) * (i + 1 - 2 * j)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
coef-sub
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 17
Proof steps: 30
Used lemmas:
fac-rec
,
fac-zero-02
,
fac-not-zero
,
fac-divides
,
binom-def
,
Used spec theorems:
int-mult
/
dist-sub-split
int-gcd
/
div-mult-shift
int-gcd
/
div-eq
int-gcd
/
divides
int-mult
/
dist-rmerge
int-mult
/
eq-nonzero
int-mult
/
dist-lsplit
int-mult
/
eq-nonzero-01
Used simplifier rules:
int-abs
/
forward-le-05
int-abs
/
forward-lsle
int-basic1
/
ls-01
int-abs
/
forward-le-01
int-abs
/
zero-gels-04
int-abs
/
le-add-03
int-abs
/
sub-le
int-abs
/
leone
int-abs
/
sub-le-01
int-abs
/
sub-sub-04
int-div
/
div-mult-01
int-div
/
div-mult-03
int-abs
/
lels-01
int-abs
/
lenls
int-mult
/
neq-not-zero
int-mult
/
commutativity
int-gcd
/
div-mult
int-mult
/
associativity
int-abs
/
succ-02
int-basic2
/
add-zero
int-abs
/
sub-ls-01
int-abs
/
sub-add-06
int-abs
/
sub-sub
int-abs
/
sub-eq
int-abs
/
sub-add-01
int-mult
/
add-mult-two
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
sub-add
int-basic2
/
add-in