![]() |
Mathbox for Steve Rodriguez |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > bccbc | Structured version Visualization version GIF version |
Description: The binomial coefficient and generalized binomial coefficient are equal when their arguments are nonnegative integers. (Contributed by Steve Rodriguez, 22-Apr-2020.) |
Ref | Expression |
---|---|
bccbc.c | ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
bccbc.k | ⊢ (𝜑 → 𝐾 ∈ ℕ0) |
Ref | Expression |
---|---|
bccbc | ⊢ (𝜑 → (𝑁C𝑐𝐾) = (𝑁C𝐾)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bccbc.c | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
2 | 1 | nn0cnd 11945 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℂ) |
3 | bccbc.k | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ ℕ0) | |
4 | 2, 3 | bccval 41042 | . . . 4 ⊢ (𝜑 → (𝑁C𝑐𝐾) = ((𝑁 FallFac 𝐾) / (!‘𝐾))) |
5 | 4 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ 𝐾 ∈ (0...𝑁)) → (𝑁C𝑐𝐾) = ((𝑁 FallFac 𝐾) / (!‘𝐾))) |
6 | bcfallfac 15390 | . . . 4 ⊢ (𝐾 ∈ (0...𝑁) → (𝑁C𝐾) = ((𝑁 FallFac 𝐾) / (!‘𝐾))) | |
7 | 6 | adantl 485 | . . 3 ⊢ ((𝜑 ∧ 𝐾 ∈ (0...𝑁)) → (𝑁C𝐾) = ((𝑁 FallFac 𝐾) / (!‘𝐾))) |
8 | 5, 7 | eqtr4d 2836 | . 2 ⊢ ((𝜑 ∧ 𝐾 ∈ (0...𝑁)) → (𝑁C𝑐𝐾) = (𝑁C𝐾)) |
9 | nn0split 13017 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → ℕ0 = ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1)))) | |
10 | 1, 9 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → ℕ0 = ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1)))) |
11 | 3, 10 | eleqtrd 2892 | . . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1)))) |
12 | elun 4076 | . . . . . . 7 ⊢ (𝐾 ∈ ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1))) ↔ (𝐾 ∈ (0...𝑁) ∨ 𝐾 ∈ (ℤ≥‘(𝑁 + 1)))) | |
13 | 11, 12 | sylib 221 | . . . . . 6 ⊢ (𝜑 → (𝐾 ∈ (0...𝑁) ∨ 𝐾 ∈ (ℤ≥‘(𝑁 + 1)))) |
14 | 13 | orcanai 1000 | . . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐾 ∈ (0...𝑁)) → 𝐾 ∈ (ℤ≥‘(𝑁 + 1))) |
15 | eluzle 12244 | . . . . . . 7 ⊢ (𝐾 ∈ (ℤ≥‘(𝑁 + 1)) → (𝑁 + 1) ≤ 𝐾) | |
16 | 15 | adantl 485 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐾 ∈ (ℤ≥‘(𝑁 + 1))) → (𝑁 + 1) ≤ 𝐾) |
17 | 1 | nn0zd 12073 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
18 | 3 | nn0zd 12073 | . . . . . . . 8 ⊢ (𝜑 → 𝐾 ∈ ℤ) |
19 | zltp1le 12020 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝑁 < 𝐾 ↔ (𝑁 + 1) ≤ 𝐾)) | |
20 | 17, 18, 19 | syl2anc 587 | . . . . . . 7 ⊢ (𝜑 → (𝑁 < 𝐾 ↔ (𝑁 + 1) ≤ 𝐾)) |
21 | 20 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐾 ∈ (ℤ≥‘(𝑁 + 1))) → (𝑁 < 𝐾 ↔ (𝑁 + 1) ≤ 𝐾)) |
22 | 16, 21 | mpbird 260 | . . . . 5 ⊢ ((𝜑 ∧ 𝐾 ∈ (ℤ≥‘(𝑁 + 1))) → 𝑁 < 𝐾) |
23 | 14, 22 | syldan 594 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐾 ∈ (0...𝑁)) → 𝑁 < 𝐾) |
24 | 1 | nn0ge0d 11946 | . . . . . 6 ⊢ (𝜑 → 0 ≤ 𝑁) |
25 | 0zd 11981 | . . . . . . . . 9 ⊢ (𝜑 → 0 ∈ ℤ) | |
26 | elfzo 13035 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℤ ∧ 0 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝑁 ∈ (0..^𝐾) ↔ (0 ≤ 𝑁 ∧ 𝑁 < 𝐾))) | |
27 | 17, 25, 18, 26 | syl3anc 1368 | . . . . . . . 8 ⊢ (𝜑 → (𝑁 ∈ (0..^𝐾) ↔ (0 ≤ 𝑁 ∧ 𝑁 < 𝐾))) |
28 | 27 | biimpar 481 | . . . . . . 7 ⊢ ((𝜑 ∧ (0 ≤ 𝑁 ∧ 𝑁 < 𝐾)) → 𝑁 ∈ (0..^𝐾)) |
29 | fzoval 13034 | . . . . . . . . . . 11 ⊢ (𝐾 ∈ ℤ → (0..^𝐾) = (0...(𝐾 − 1))) | |
30 | 18, 29 | syl 17 | . . . . . . . . . 10 ⊢ (𝜑 → (0..^𝐾) = (0...(𝐾 − 1))) |
31 | 30 | eleq2d 2875 | . . . . . . . . 9 ⊢ (𝜑 → (𝑁 ∈ (0..^𝐾) ↔ 𝑁 ∈ (0...(𝐾 − 1)))) |
32 | 31 | biimpa 480 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑁 ∈ (0..^𝐾)) → 𝑁 ∈ (0...(𝐾 − 1))) |
33 | 2, 3 | bcc0 41044 | . . . . . . . . 9 ⊢ (𝜑 → ((𝑁C𝑐𝐾) = 0 ↔ 𝑁 ∈ (0...(𝐾 − 1)))) |
34 | 33 | biimpar 481 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑁 ∈ (0...(𝐾 − 1))) → (𝑁C𝑐𝐾) = 0) |
35 | 32, 34 | syldan 594 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑁 ∈ (0..^𝐾)) → (𝑁C𝑐𝐾) = 0) |
36 | 28, 35 | syldan 594 | . . . . . 6 ⊢ ((𝜑 ∧ (0 ≤ 𝑁 ∧ 𝑁 < 𝐾)) → (𝑁C𝑐𝐾) = 0) |
37 | 24, 36 | sylanr1 681 | . . . . 5 ⊢ ((𝜑 ∧ (𝜑 ∧ 𝑁 < 𝐾)) → (𝑁C𝑐𝐾) = 0) |
38 | 37 | anabss5 667 | . . . 4 ⊢ ((𝜑 ∧ 𝑁 < 𝐾) → (𝑁C𝑐𝐾) = 0) |
39 | 23, 38 | syldan 594 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝐾 ∈ (0...𝑁)) → (𝑁C𝑐𝐾) = 0) |
40 | 1, 18 | jca 515 | . . . 4 ⊢ (𝜑 → (𝑁 ∈ ℕ0 ∧ 𝐾 ∈ ℤ)) |
41 | bcval3 13662 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐾 ∈ ℤ ∧ ¬ 𝐾 ∈ (0...𝑁)) → (𝑁C𝐾) = 0) | |
42 | 41 | 3expa 1115 | . . . 4 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐾 ∈ ℤ) ∧ ¬ 𝐾 ∈ (0...𝑁)) → (𝑁C𝐾) = 0) |
43 | 40, 42 | sylan 583 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝐾 ∈ (0...𝑁)) → (𝑁C𝐾) = 0) |
44 | 39, 43 | eqtr4d 2836 | . 2 ⊢ ((𝜑 ∧ ¬ 𝐾 ∈ (0...𝑁)) → (𝑁C𝑐𝐾) = (𝑁C𝐾)) |
45 | 8, 44 | pm2.61dan 812 | 1 ⊢ (𝜑 → (𝑁C𝑐𝐾) = (𝑁C𝐾)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 399 ∨ wo 844 = wceq 1538 ∈ wcel 2111 ∪ cun 3879 class class class wbr 5030 ‘cfv 6324 (class class class)co 7135 0cc0 10526 1c1 10527 + caddc 10529 < clt 10664 ≤ cle 10665 − cmin 10859 / cdiv 11286 ℕ0cn0 11885 ℤcz 11969 ℤ≥cuz 12231 ...cfz 12885 ..^cfzo 13028 !cfa 13629 Ccbc 13658 FallFac cfallfac 15350 C𝑐cbcc 41040 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-inf2 9088 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-pre-sup 10604 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-se 5479 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-isom 6333 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-sup 8890 df-oi 8958 df-card 9352 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-nn 11626 df-2 11688 df-3 11689 df-n0 11886 df-z 11970 df-uz 12232 df-rp 12378 df-fz 12886 df-fzo 13029 df-seq 13365 df-exp 13426 df-fac 13630 df-bc 13659 df-hash 13687 df-cj 14450 df-re 14451 df-im 14452 df-sqrt 14586 df-abs 14587 df-clim 14837 df-prod 15252 df-fallfac 15353 df-bcc 41041 |
This theorem is referenced by: binomcxplemnn0 41053 |
Copyright terms: Public domain | W3C validator |