Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > bcn2m1 | Structured version Visualization version GIF version |
Description: Compute the binomial coefficient "𝑁 choose 2 " from "(𝑁 − 1) choose 2 ": (N-1) + ( (N-1) 2 ) = ( N 2 ). (Contributed by Alexander van der Vekens, 7-Jan-2018.) |
Ref | Expression |
---|---|
bcn2m1 | ⊢ (𝑁 ∈ ℕ → ((𝑁 − 1) + ((𝑁 − 1)C2)) = (𝑁C2)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nnm1nn0 12204 | . . . 4 ⊢ (𝑁 ∈ ℕ → (𝑁 − 1) ∈ ℕ0) | |
2 | 1 | nn0cnd 12225 | . . 3 ⊢ (𝑁 ∈ ℕ → (𝑁 − 1) ∈ ℂ) |
3 | 2z 12282 | . . . . 5 ⊢ 2 ∈ ℤ | |
4 | bccl 13964 | . . . . 5 ⊢ (((𝑁 − 1) ∈ ℕ0 ∧ 2 ∈ ℤ) → ((𝑁 − 1)C2) ∈ ℕ0) | |
5 | 1, 3, 4 | sylancl 585 | . . . 4 ⊢ (𝑁 ∈ ℕ → ((𝑁 − 1)C2) ∈ ℕ0) |
6 | 5 | nn0cnd 12225 | . . 3 ⊢ (𝑁 ∈ ℕ → ((𝑁 − 1)C2) ∈ ℂ) |
7 | 2, 6 | addcomd 11107 | . 2 ⊢ (𝑁 ∈ ℕ → ((𝑁 − 1) + ((𝑁 − 1)C2)) = (((𝑁 − 1)C2) + (𝑁 − 1))) |
8 | bcn1 13955 | . . . . . 6 ⊢ ((𝑁 − 1) ∈ ℕ0 → ((𝑁 − 1)C1) = (𝑁 − 1)) | |
9 | 8 | eqcomd 2744 | . . . . 5 ⊢ ((𝑁 − 1) ∈ ℕ0 → (𝑁 − 1) = ((𝑁 − 1)C1)) |
10 | 1, 9 | syl 17 | . . . 4 ⊢ (𝑁 ∈ ℕ → (𝑁 − 1) = ((𝑁 − 1)C1)) |
11 | 1e2m1 12030 | . . . . . 6 ⊢ 1 = (2 − 1) | |
12 | 11 | a1i 11 | . . . . 5 ⊢ (𝑁 ∈ ℕ → 1 = (2 − 1)) |
13 | 12 | oveq2d 7271 | . . . 4 ⊢ (𝑁 ∈ ℕ → ((𝑁 − 1)C1) = ((𝑁 − 1)C(2 − 1))) |
14 | 10, 13 | eqtrd 2778 | . . 3 ⊢ (𝑁 ∈ ℕ → (𝑁 − 1) = ((𝑁 − 1)C(2 − 1))) |
15 | 14 | oveq2d 7271 | . 2 ⊢ (𝑁 ∈ ℕ → (((𝑁 − 1)C2) + (𝑁 − 1)) = (((𝑁 − 1)C2) + ((𝑁 − 1)C(2 − 1)))) |
16 | bcpasc 13963 | . . . 4 ⊢ (((𝑁 − 1) ∈ ℕ0 ∧ 2 ∈ ℤ) → (((𝑁 − 1)C2) + ((𝑁 − 1)C(2 − 1))) = (((𝑁 − 1) + 1)C2)) | |
17 | 1, 3, 16 | sylancl 585 | . . 3 ⊢ (𝑁 ∈ ℕ → (((𝑁 − 1)C2) + ((𝑁 − 1)C(2 − 1))) = (((𝑁 − 1) + 1)C2)) |
18 | nncn 11911 | . . . . 5 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ) | |
19 | 1cnd 10901 | . . . . 5 ⊢ (𝑁 ∈ ℕ → 1 ∈ ℂ) | |
20 | 18, 19 | npcand 11266 | . . . 4 ⊢ (𝑁 ∈ ℕ → ((𝑁 − 1) + 1) = 𝑁) |
21 | 20 | oveq1d 7270 | . . 3 ⊢ (𝑁 ∈ ℕ → (((𝑁 − 1) + 1)C2) = (𝑁C2)) |
22 | 17, 21 | eqtrd 2778 | . 2 ⊢ (𝑁 ∈ ℕ → (((𝑁 − 1)C2) + ((𝑁 − 1)C(2 − 1))) = (𝑁C2)) |
23 | 7, 15, 22 | 3eqtrd 2782 | 1 ⊢ (𝑁 ∈ ℕ → ((𝑁 − 1) + ((𝑁 − 1)C2)) = (𝑁C2)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2108 (class class class)co 7255 1c1 10803 + caddc 10805 − cmin 11135 ℕcn 11903 2c2 11958 ℕ0cn0 12163 ℤcz 12249 Ccbc 13944 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-n0 12164 df-z 12250 df-uz 12512 df-rp 12660 df-fz 13169 df-seq 13650 df-fac 13916 df-bc 13945 |
This theorem is referenced by: cusgrsize2inds 27723 |
Copyright terms: Public domain | W3C validator |