![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > bcn2p1 | Structured version Visualization version GIF version |
Description: Compute the binomial coefficient "(𝑁 + 1) choose 2 " from "𝑁 choose 2 ": N + ( N 2 ) = ( (N+1) 2 ). (Contributed by Alexander van der Vekens, 8-Jan-2018.) |
Ref | Expression |
---|---|
bcn2p1 | ⊢ (𝑁 ∈ ℕ0 → (𝑁 + (𝑁C2)) = ((𝑁 + 1)C2)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nn0cn 11514 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℂ) | |
2 | 2z 11621 | . . . . 5 ⊢ 2 ∈ ℤ | |
3 | bccl 13323 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ∈ ℤ) → (𝑁C2) ∈ ℕ0) | |
4 | 2, 3 | mpan2 709 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (𝑁C2) ∈ ℕ0) |
5 | 4 | nn0cnd 11565 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑁C2) ∈ ℂ) |
6 | 1, 5 | addcomd 10450 | . 2 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + (𝑁C2)) = ((𝑁C2) + 𝑁)) |
7 | bcn1 13314 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (𝑁C1) = 𝑁) | |
8 | 1e2m1 11348 | . . . . . 6 ⊢ 1 = (2 − 1) | |
9 | 8 | a1i 11 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → 1 = (2 − 1)) |
10 | 9 | oveq2d 6830 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (𝑁C1) = (𝑁C(2 − 1))) |
11 | 7, 10 | eqtr3d 2796 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 𝑁 = (𝑁C(2 − 1))) |
12 | 11 | oveq2d 6830 | . 2 ⊢ (𝑁 ∈ ℕ0 → ((𝑁C2) + 𝑁) = ((𝑁C2) + (𝑁C(2 − 1)))) |
13 | bcpasc 13322 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ∈ ℤ) → ((𝑁C2) + (𝑁C(2 − 1))) = ((𝑁 + 1)C2)) | |
14 | 2, 13 | mpan2 709 | . 2 ⊢ (𝑁 ∈ ℕ0 → ((𝑁C2) + (𝑁C(2 − 1))) = ((𝑁 + 1)C2)) |
15 | 6, 12, 14 | 3eqtrd 2798 | 1 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + (𝑁C2)) = ((𝑁 + 1)C2)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1632 ∈ wcel 2139 (class class class)co 6814 1c1 10149 + caddc 10151 − cmin 10478 2c2 11282 ℕ0cn0 11504 ℤcz 11589 Ccbc 13303 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1871 ax-4 1886 ax-5 1988 ax-6 2054 ax-7 2090 ax-8 2141 ax-9 2148 ax-10 2168 ax-11 2183 ax-12 2196 ax-13 2391 ax-ext 2740 ax-sep 4933 ax-nul 4941 ax-pow 4992 ax-pr 5055 ax-un 7115 ax-cnex 10204 ax-resscn 10205 ax-1cn 10206 ax-icn 10207 ax-addcl 10208 ax-addrcl 10209 ax-mulcl 10210 ax-mulrcl 10211 ax-mulcom 10212 ax-addass 10213 ax-mulass 10214 ax-distr 10215 ax-i2m1 10216 ax-1ne0 10217 ax-1rid 10218 ax-rnegex 10219 ax-rrecex 10220 ax-cnre 10221 ax-pre-lttri 10222 ax-pre-lttrn 10223 ax-pre-ltadd 10224 ax-pre-mulgt0 10225 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1635 df-ex 1854 df-nf 1859 df-sb 2047 df-eu 2611 df-mo 2612 df-clab 2747 df-cleq 2753 df-clel 2756 df-nfc 2891 df-ne 2933 df-nel 3036 df-ral 3055 df-rex 3056 df-reu 3057 df-rmo 3058 df-rab 3059 df-v 3342 df-sbc 3577 df-csb 3675 df-dif 3718 df-un 3720 df-in 3722 df-ss 3729 df-pss 3731 df-nul 4059 df-if 4231 df-pw 4304 df-sn 4322 df-pr 4324 df-tp 4326 df-op 4328 df-uni 4589 df-iun 4674 df-br 4805 df-opab 4865 df-mpt 4882 df-tr 4905 df-id 5174 df-eprel 5179 df-po 5187 df-so 5188 df-fr 5225 df-we 5227 df-xp 5272 df-rel 5273 df-cnv 5274 df-co 5275 df-dm 5276 df-rn 5277 df-res 5278 df-ima 5279 df-pred 5841 df-ord 5887 df-on 5888 df-lim 5889 df-suc 5890 df-iota 6012 df-fun 6051 df-fn 6052 df-f 6053 df-f1 6054 df-fo 6055 df-f1o 6056 df-fv 6057 df-riota 6775 df-ov 6817 df-oprab 6818 df-mpt2 6819 df-om 7232 df-1st 7334 df-2nd 7335 df-wrecs 7577 df-recs 7638 df-rdg 7676 df-er 7913 df-en 8124 df-dom 8125 df-sdom 8126 df-pnf 10288 df-mnf 10289 df-xr 10290 df-ltxr 10291 df-le 10292 df-sub 10480 df-neg 10481 df-div 10897 df-nn 11233 df-2 11291 df-n0 11505 df-z 11590 df-uz 11900 df-rp 12046 df-fz 12540 df-seq 13016 df-fac 13275 df-bc 13304 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |