![]() |
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 11230 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℂ) |
3 | bccbc.k | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ ℕ0) | |
4 | 2, 3 | bccval 37559 | . . . 4 ⊢ (𝜑 → (𝑁C𝑐𝐾) = ((𝑁 FallFac 𝐾) / (!‘𝐾))) |
5 | 4 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝐾 ∈ (0...𝑁)) → (𝑁C𝑐𝐾) = ((𝑁 FallFac 𝐾) / (!‘𝐾))) |
6 | bcfallfac 14614 | . . . 4 ⊢ (𝐾 ∈ (0...𝑁) → (𝑁C𝐾) = ((𝑁 FallFac 𝐾) / (!‘𝐾))) | |
7 | 6 | adantl 481 | . . 3 ⊢ ((𝜑 ∧ 𝐾 ∈ (0...𝑁)) → (𝑁C𝐾) = ((𝑁 FallFac 𝐾) / (!‘𝐾))) |
8 | 5, 7 | eqtr4d 2647 | . 2 ⊢ ((𝜑 ∧ 𝐾 ∈ (0...𝑁)) → (𝑁C𝑐𝐾) = (𝑁C𝐾)) |
9 | nn0split 12323 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → ℕ0 = ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1)))) | |
10 | 1, 9 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → ℕ0 = ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1)))) |
11 | 3, 10 | eleqtrd 2690 | . . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1)))) |
12 | elun 3715 | . . . . . . 7 ⊢ (𝐾 ∈ ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1))) ↔ (𝐾 ∈ (0...𝑁) ∨ 𝐾 ∈ (ℤ≥‘(𝑁 + 1)))) | |
13 | 11, 12 | sylib 207 | . . . . . 6 ⊢ (𝜑 → (𝐾 ∈ (0...𝑁) ∨ 𝐾 ∈ (ℤ≥‘(𝑁 + 1)))) |
14 | 13 | orcanai 950 | . . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐾 ∈ (0...𝑁)) → 𝐾 ∈ (ℤ≥‘(𝑁 + 1))) |
15 | eluzle 11576 | . . . . . . 7 ⊢ (𝐾 ∈ (ℤ≥‘(𝑁 + 1)) → (𝑁 + 1) ≤ 𝐾) | |
16 | 15 | adantl 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐾 ∈ (ℤ≥‘(𝑁 + 1))) → (𝑁 + 1) ≤ 𝐾) |
17 | 1 | nn0zd 11356 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
18 | 3 | nn0zd 11356 | . . . . . . . 8 ⊢ (𝜑 → 𝐾 ∈ ℤ) |
19 | zltp1le 11304 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝑁 < 𝐾 ↔ (𝑁 + 1) ≤ 𝐾)) | |
20 | 17, 18, 19 | syl2anc 691 | . . . . . . 7 ⊢ (𝜑 → (𝑁 < 𝐾 ↔ (𝑁 + 1) ≤ 𝐾)) |
21 | 20 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐾 ∈ (ℤ≥‘(𝑁 + 1))) → (𝑁 < 𝐾 ↔ (𝑁 + 1) ≤ 𝐾)) |
22 | 16, 21 | mpbird 246 | . . . . 5 ⊢ ((𝜑 ∧ 𝐾 ∈ (ℤ≥‘(𝑁 + 1))) → 𝑁 < 𝐾) |
23 | 14, 22 | syldan 486 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐾 ∈ (0...𝑁)) → 𝑁 < 𝐾) |
24 | 1 | nn0ge0d 11231 | . . . . . 6 ⊢ (𝜑 → 0 ≤ 𝑁) |
25 | 0zd 11266 | . . . . . . . . 9 ⊢ (𝜑 → 0 ∈ ℤ) | |
26 | elfzo 12341 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℤ ∧ 0 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝑁 ∈ (0..^𝐾) ↔ (0 ≤ 𝑁 ∧ 𝑁 < 𝐾))) | |
27 | 17, 25, 18, 26 | syl3anc 1318 | . . . . . . . 8 ⊢ (𝜑 → (𝑁 ∈ (0..^𝐾) ↔ (0 ≤ 𝑁 ∧ 𝑁 < 𝐾))) |
28 | 27 | biimpar 501 | . . . . . . 7 ⊢ ((𝜑 ∧ (0 ≤ 𝑁 ∧ 𝑁 < 𝐾)) → 𝑁 ∈ (0..^𝐾)) |
29 | fzoval 12340 | . . . . . . . . . . 11 ⊢ (𝐾 ∈ ℤ → (0..^𝐾) = (0...(𝐾 − 1))) | |
30 | 18, 29 | syl 17 | . . . . . . . . . 10 ⊢ (𝜑 → (0..^𝐾) = (0...(𝐾 − 1))) |
31 | 30 | eleq2d 2673 | . . . . . . . . 9 ⊢ (𝜑 → (𝑁 ∈ (0..^𝐾) ↔ 𝑁 ∈ (0...(𝐾 − 1)))) |
32 | 31 | biimpa 500 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑁 ∈ (0..^𝐾)) → 𝑁 ∈ (0...(𝐾 − 1))) |
33 | 2, 3 | bcc0 37561 | . . . . . . . . 9 ⊢ (𝜑 → ((𝑁C𝑐𝐾) = 0 ↔ 𝑁 ∈ (0...(𝐾 − 1)))) |
34 | 33 | biimpar 501 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑁 ∈ (0...(𝐾 − 1))) → (𝑁C𝑐𝐾) = 0) |
35 | 32, 34 | syldan 486 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑁 ∈ (0..^𝐾)) → (𝑁C𝑐𝐾) = 0) |
36 | 28, 35 | syldan 486 | . . . . . 6 ⊢ ((𝜑 ∧ (0 ≤ 𝑁 ∧ 𝑁 < 𝐾)) → (𝑁C𝑐𝐾) = 0) |
37 | 24, 36 | sylanr1 682 | . . . . 5 ⊢ ((𝜑 ∧ (𝜑 ∧ 𝑁 < 𝐾)) → (𝑁C𝑐𝐾) = 0) |
38 | 37 | anabss5 853 | . . . 4 ⊢ ((𝜑 ∧ 𝑁 < 𝐾) → (𝑁C𝑐𝐾) = 0) |
39 | 23, 38 | syldan 486 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝐾 ∈ (0...𝑁)) → (𝑁C𝑐𝐾) = 0) |
40 | 1, 18 | jca 553 | . . . 4 ⊢ (𝜑 → (𝑁 ∈ ℕ0 ∧ 𝐾 ∈ ℤ)) |
41 | bcval3 12955 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐾 ∈ ℤ ∧ ¬ 𝐾 ∈ (0...𝑁)) → (𝑁C𝐾) = 0) | |
42 | 41 | 3expa 1257 | . . . 4 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐾 ∈ ℤ) ∧ ¬ 𝐾 ∈ (0...𝑁)) → (𝑁C𝐾) = 0) |
43 | 40, 42 | sylan 487 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝐾 ∈ (0...𝑁)) → (𝑁C𝐾) = 0) |
44 | 39, 43 | eqtr4d 2647 | . 2 ⊢ ((𝜑 ∧ ¬ 𝐾 ∈ (0...𝑁)) → (𝑁C𝑐𝐾) = (𝑁C𝐾)) |
45 | 8, 44 | pm2.61dan 828 | 1 ⊢ (𝜑 → (𝑁C𝑐𝐾) = (𝑁C𝐾)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∨ wo 382 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ∪ cun 3538 class class class wbr 4583 ‘cfv 5804 (class class class)co 6549 0cc0 9815 1c1 9816 + caddc 9818 < clt 9953 ≤ cle 9954 − cmin 10145 / cdiv 10563 ℕ0cn0 11169 ℤcz 11254 ℤ≥cuz 11563 ...cfz 12197 ..^cfzo 12334 !cfa 12922 Ccbc 12951 FallFac cfallfac 14574 C𝑐cbcc 37557 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-inf2 8421 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-pre-sup 9893 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-fal 1481 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-se 4998 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-isom 5813 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-oadd 7451 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-sup 8231 df-oi 8298 df-card 8648 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-div 10564 df-nn 10898 df-2 10956 df-3 10957 df-n0 11170 df-z 11255 df-uz 11564 df-rp 11709 df-fz 12198 df-fzo 12335 df-seq 12664 df-exp 12723 df-fac 12923 df-bc 12952 df-hash 12980 df-cj 13687 df-re 13688 df-im 13689 df-sqrt 13823 df-abs 13824 df-clim 14067 df-prod 14475 df-fallfac 14577 df-bcc 37558 |
This theorem is referenced by: binomcxplemnn0 37570 |
Copyright terms: Public domain | W3C validator |