Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > bcn1 | GIF version |
Description: Binomial coefficient: 𝑁 choose 1. (Contributed by NM, 21-Jun-2005.) (Revised by Mario Carneiro, 8-Nov-2013.) |
Ref | Expression |
---|---|
bcn1 | ⊢ (𝑁 ∈ ℕ0 → (𝑁C1) = 𝑁) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elnn0 8290 | . 2 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) | |
2 | 1eluzge0 8662 | . . . . . . 7 ⊢ 1 ∈ (ℤ≥‘0) | |
3 | 2 | a1i 9 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → 1 ∈ (ℤ≥‘0)) |
4 | elnnuz 8655 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ ↔ 𝑁 ∈ (ℤ≥‘1)) | |
5 | 4 | biimpi 118 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ (ℤ≥‘1)) |
6 | elfzuzb 9039 | . . . . . 6 ⊢ (1 ∈ (0...𝑁) ↔ (1 ∈ (ℤ≥‘0) ∧ 𝑁 ∈ (ℤ≥‘1))) | |
7 | 3, 5, 6 | sylanbrc 408 | . . . . 5 ⊢ (𝑁 ∈ ℕ → 1 ∈ (0...𝑁)) |
8 | bcval2 9677 | . . . . 5 ⊢ (1 ∈ (0...𝑁) → (𝑁C1) = ((!‘𝑁) / ((!‘(𝑁 − 1)) · (!‘1)))) | |
9 | 7, 8 | syl 14 | . . . 4 ⊢ (𝑁 ∈ ℕ → (𝑁C1) = ((!‘𝑁) / ((!‘(𝑁 − 1)) · (!‘1)))) |
10 | facnn2 9661 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (!‘𝑁) = ((!‘(𝑁 − 1)) · 𝑁)) | |
11 | fac1 9656 | . . . . . . 7 ⊢ (!‘1) = 1 | |
12 | 11 | oveq2i 5543 | . . . . . 6 ⊢ ((!‘(𝑁 − 1)) · (!‘1)) = ((!‘(𝑁 − 1)) · 1) |
13 | nnm1nn0 8329 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → (𝑁 − 1) ∈ ℕ0) | |
14 | 13 | faccld 9663 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ → (!‘(𝑁 − 1)) ∈ ℕ) |
15 | 14 | nncnd 8053 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → (!‘(𝑁 − 1)) ∈ ℂ) |
16 | 15 | mulid1d 7136 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → ((!‘(𝑁 − 1)) · 1) = (!‘(𝑁 − 1))) |
17 | 12, 16 | syl5eq 2125 | . . . . 5 ⊢ (𝑁 ∈ ℕ → ((!‘(𝑁 − 1)) · (!‘1)) = (!‘(𝑁 − 1))) |
18 | 10, 17 | oveq12d 5550 | . . . 4 ⊢ (𝑁 ∈ ℕ → ((!‘𝑁) / ((!‘(𝑁 − 1)) · (!‘1))) = (((!‘(𝑁 − 1)) · 𝑁) / (!‘(𝑁 − 1)))) |
19 | nncn 8047 | . . . . 5 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ) | |
20 | 14 | nnap0d 8084 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (!‘(𝑁 − 1)) # 0) |
21 | 19, 15, 20 | divcanap3d 7882 | . . . 4 ⊢ (𝑁 ∈ ℕ → (((!‘(𝑁 − 1)) · 𝑁) / (!‘(𝑁 − 1))) = 𝑁) |
22 | 9, 18, 21 | 3eqtrd 2117 | . . 3 ⊢ (𝑁 ∈ ℕ → (𝑁C1) = 𝑁) |
23 | 0nn0 8303 | . . . . 5 ⊢ 0 ∈ ℕ0 | |
24 | 1z 8377 | . . . . 5 ⊢ 1 ∈ ℤ | |
25 | 0lt1 7236 | . . . . . 6 ⊢ 0 < 1 | |
26 | 25 | olci 683 | . . . . 5 ⊢ (1 < 0 ∨ 0 < 1) |
27 | bcval4 9679 | . . . . 5 ⊢ ((0 ∈ ℕ0 ∧ 1 ∈ ℤ ∧ (1 < 0 ∨ 0 < 1)) → (0C1) = 0) | |
28 | 23, 24, 26, 27 | mp3an 1268 | . . . 4 ⊢ (0C1) = 0 |
29 | oveq1 5539 | . . . . 5 ⊢ (𝑁 = 0 → (𝑁C1) = (0C1)) | |
30 | eqeq12 2093 | . . . . 5 ⊢ (((𝑁C1) = (0C1) ∧ 𝑁 = 0) → ((𝑁C1) = 𝑁 ↔ (0C1) = 0)) | |
31 | 29, 30 | mpancom 413 | . . . 4 ⊢ (𝑁 = 0 → ((𝑁C1) = 𝑁 ↔ (0C1) = 0)) |
32 | 28, 31 | mpbiri 166 | . . 3 ⊢ (𝑁 = 0 → (𝑁C1) = 𝑁) |
33 | 22, 32 | jaoi 668 | . 2 ⊢ ((𝑁 ∈ ℕ ∨ 𝑁 = 0) → (𝑁C1) = 𝑁) |
34 | 1, 33 | sylbi 119 | 1 ⊢ (𝑁 ∈ ℕ0 → (𝑁C1) = 𝑁) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 103 ∨ wo 661 = wceq 1284 ∈ wcel 1433 class class class wbr 3785 ‘cfv 4922 (class class class)co 5532 0cc0 6981 1c1 6982 · cmul 6986 < clt 7153 − cmin 7279 / cdiv 7760 ℕcn 8039 ℕ0cn0 8288 ℤcz 8351 ℤ≥cuz 8619 ...cfz 9029 !cfa 9652 Ccbc 9674 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 576 ax-in2 577 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-13 1444 ax-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-coll 3893 ax-sep 3896 ax-nul 3904 ax-pow 3948 ax-pr 3964 ax-un 4188 ax-setind 4280 ax-iinf 4329 ax-cnex 7067 ax-resscn 7068 ax-1cn 7069 ax-1re 7070 ax-icn 7071 ax-addcl 7072 ax-addrcl 7073 ax-mulcl 7074 ax-mulrcl 7075 ax-addcom 7076 ax-mulcom 7077 ax-addass 7078 ax-mulass 7079 ax-distr 7080 ax-i2m1 7081 ax-0lt1 7082 ax-1rid 7083 ax-0id 7084 ax-rnegex 7085 ax-precex 7086 ax-cnre 7087 ax-pre-ltirr 7088 ax-pre-ltwlin 7089 ax-pre-lttrn 7090 ax-pre-apti 7091 ax-pre-ltadd 7092 ax-pre-mulgt0 7093 ax-pre-mulext 7094 |
This theorem depends on definitions: df-bi 115 df-dc 776 df-3or 920 df-3an 921 df-tru 1287 df-fal 1290 df-nf 1390 df-sb 1686 df-eu 1944 df-mo 1945 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ne 2246 df-nel 2340 df-ral 2353 df-rex 2354 df-reu 2355 df-rmo 2356 df-rab 2357 df-v 2603 df-sbc 2816 df-csb 2909 df-dif 2975 df-un 2977 df-in 2979 df-ss 2986 df-nul 3252 df-if 3352 df-pw 3384 df-sn 3404 df-pr 3405 df-op 3407 df-uni 3602 df-int 3637 df-iun 3680 df-br 3786 df-opab 3840 df-mpt 3841 df-tr 3876 df-id 4048 df-po 4051 df-iso 4052 df-iord 4121 df-on 4123 df-suc 4126 df-iom 4332 df-xp 4369 df-rel 4370 df-cnv 4371 df-co 4372 df-dm 4373 df-rn 4374 df-res 4375 df-ima 4376 df-iota 4887 df-fun 4924 df-fn 4925 df-f 4926 df-f1 4927 df-fo 4928 df-f1o 4929 df-fv 4930 df-riota 5488 df-ov 5535 df-oprab 5536 df-mpt2 5537 df-1st 5787 df-2nd 5788 df-recs 5943 df-frec 6001 df-pnf 7155 df-mnf 7156 df-xr 7157 df-ltxr 7158 df-le 7159 df-sub 7281 df-neg 7282 df-reap 7675 df-ap 7682 df-div 7761 df-inn 8040 df-n0 8289 df-z 8352 df-uz 8620 df-q 8705 df-fz 9030 df-iseq 9432 df-fac 9653 df-bc 9675 |
This theorem is referenced by: bcnp1n 9686 bcn2m1 9696 bcn2p1 9697 bcnm1 9699 |
Copyright terms: Public domain | W3C validator |