![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > bcn0 | GIF version |
Description: 𝑁 choose 0 is 1. Remark in [Gleason] p. 296. (Contributed by NM, 17-Jun-2005.) (Revised by Mario Carneiro, 8-Nov-2013.) |
Ref | Expression |
---|---|
bcn0 | ⊢ (𝑁 ∈ ℕ0 → (𝑁C0) = 1) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0elfz 10184 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 0 ∈ (0...𝑁)) | |
2 | bcval2 10821 | . . 3 ⊢ (0 ∈ (0...𝑁) → (𝑁C0) = ((!‘𝑁) / ((!‘(𝑁 − 0)) · (!‘0)))) | |
3 | 1, 2 | syl 14 | . 2 ⊢ (𝑁 ∈ ℕ0 → (𝑁C0) = ((!‘𝑁) / ((!‘(𝑁 − 0)) · (!‘0)))) |
4 | nn0cn 9250 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℂ) | |
5 | 4 | subid1d 8319 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → (𝑁 − 0) = 𝑁) |
6 | 5 | fveq2d 5558 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (!‘(𝑁 − 0)) = (!‘𝑁)) |
7 | fac0 10799 | . . . . . 6 ⊢ (!‘0) = 1 | |
8 | oveq12 5927 | . . . . . 6 ⊢ (((!‘(𝑁 − 0)) = (!‘𝑁) ∧ (!‘0) = 1) → ((!‘(𝑁 − 0)) · (!‘0)) = ((!‘𝑁) · 1)) | |
9 | 6, 7, 8 | sylancl 413 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → ((!‘(𝑁 − 0)) · (!‘0)) = ((!‘𝑁) · 1)) |
10 | faccl 10806 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → (!‘𝑁) ∈ ℕ) | |
11 | 10 | nncnd 8996 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (!‘𝑁) ∈ ℂ) |
12 | 11 | mulridd 8036 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → ((!‘𝑁) · 1) = (!‘𝑁)) |
13 | 9, 12 | eqtrd 2226 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → ((!‘(𝑁 − 0)) · (!‘0)) = (!‘𝑁)) |
14 | 13 | oveq2d 5934 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ((!‘𝑁) / ((!‘(𝑁 − 0)) · (!‘0))) = ((!‘𝑁) / (!‘𝑁))) |
15 | 10 | nnap0d 9028 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (!‘𝑁) # 0) |
16 | 11, 15 | dividapd 8805 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ((!‘𝑁) / (!‘𝑁)) = 1) |
17 | 14, 16 | eqtrd 2226 | . 2 ⊢ (𝑁 ∈ ℕ0 → ((!‘𝑁) / ((!‘(𝑁 − 0)) · (!‘0))) = 1) |
18 | 3, 17 | eqtrd 2226 | 1 ⊢ (𝑁 ∈ ℕ0 → (𝑁C0) = 1) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1364 ∈ wcel 2164 ‘cfv 5254 (class class class)co 5918 0cc0 7872 1c1 7873 · cmul 7877 − cmin 8190 / cdiv 8691 ℕ0cn0 9240 ...cfz 10074 !cfa 10796 Ccbc 10818 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4144 ax-sep 4147 ax-nul 4155 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-iinf 4620 ax-cnex 7963 ax-resscn 7964 ax-1cn 7965 ax-1re 7966 ax-icn 7967 ax-addcl 7968 ax-addrcl 7969 ax-mulcl 7970 ax-mulrcl 7971 ax-addcom 7972 ax-mulcom 7973 ax-addass 7974 ax-mulass 7975 ax-distr 7976 ax-i2m1 7977 ax-0lt1 7978 ax-1rid 7979 ax-0id 7980 ax-rnegex 7981 ax-precex 7982 ax-cnre 7983 ax-pre-ltirr 7984 ax-pre-ltwlin 7985 ax-pre-lttrn 7986 ax-pre-apti 7987 ax-pre-ltadd 7988 ax-pre-mulgt0 7989 ax-pre-mulext 7990 |
This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2986 df-csb 3081 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-nul 3447 df-if 3558 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-int 3871 df-iun 3914 df-br 4030 df-opab 4091 df-mpt 4092 df-tr 4128 df-id 4324 df-po 4327 df-iso 4328 df-iord 4397 df-on 4399 df-ilim 4400 df-suc 4402 df-iom 4623 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-f 5258 df-f1 5259 df-fo 5260 df-f1o 5261 df-fv 5262 df-riota 5873 df-ov 5921 df-oprab 5922 df-mpo 5923 df-1st 6193 df-2nd 6194 df-recs 6358 df-frec 6444 df-pnf 8056 df-mnf 8057 df-xr 8058 df-ltxr 8059 df-le 8060 df-sub 8192 df-neg 8193 df-reap 8594 df-ap 8601 df-div 8692 df-inn 8983 df-n0 9241 df-z 9318 df-uz 9593 df-q 9685 df-fz 10075 df-seqfrec 10519 df-fac 10797 df-bc 10819 |
This theorem is referenced by: bcnn 10828 bcpasc 10837 bccl 10838 binom 11627 bcxmas 11632 |
Copyright terms: Public domain | W3C validator |