| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > csrgbinom | Structured version Visualization version GIF version | ||
| Description: The binomial theorem for commutative semirings. (Contributed by AV, 24-Aug-2019.) |
| Ref | Expression |
|---|---|
| srgbinom.s | ⊢ 𝑆 = (Base‘𝑅) |
| srgbinom.m | ⊢ × = (.r‘𝑅) |
| srgbinom.t | ⊢ · = (.g‘𝑅) |
| srgbinom.a | ⊢ + = (+g‘𝑅) |
| srgbinom.g | ⊢ 𝐺 = (mulGrp‘𝑅) |
| srgbinom.e | ⊢ ↑ = (.g‘𝐺) |
| Ref | Expression |
|---|---|
| csrgbinom | ⊢ (((𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → (𝑁 ↑ (𝐴 + 𝐵)) = (𝑅 Σg (𝑘 ∈ (0...𝑁) ↦ ((𝑁C𝑘) · (((𝑁 − 𝑘) ↑ 𝐴) × (𝑘 ↑ 𝐵)))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 3simpb 1165 | . . 3 ⊢ ((𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0) → (𝑅 ∈ SRing ∧ 𝑁 ∈ ℕ0)) | |
| 2 | 1 | adantr 485 | . 2 ⊢ (((𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → (𝑅 ∈ SRing ∧ 𝑁 ∈ ℕ0)) |
| 3 | simprl 782 | . 2 ⊢ (((𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → 𝐴 ∈ 𝑆) | |
| 4 | simprr 784 | . 2 ⊢ (((𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → 𝐵 ∈ 𝑆) | |
| 5 | simpl2 1209 | . . 3 ⊢ (((𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → 𝐺 ∈ CMnd) | |
| 6 | srgbinom.g | . . . . 5 ⊢ 𝐺 = (mulGrp‘𝑅) | |
| 7 | srgbinom.s | . . . . 5 ⊢ 𝑆 = (Base‘𝑅) | |
| 8 | 6, 7 | mgpbas 20220 | . . . 4 ⊢ 𝑆 = (Base‘𝐺) |
| 9 | srgbinom.m | . . . . 5 ⊢ × = (.r‘𝑅) | |
| 10 | 6, 9 | mgpplusg 20219 | . . . 4 ⊢ × = (+g‘𝐺) |
| 11 | 8, 10 | cmncom 19867 | . . 3 ⊢ ((𝐺 ∈ CMnd ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴 × 𝐵) = (𝐵 × 𝐴)) |
| 12 | 5, 3, 4, 11 | syl3anc 1396 | . 2 ⊢ (((𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → (𝐴 × 𝐵) = (𝐵 × 𝐴)) |
| 13 | srgbinom.t | . . 3 ⊢ · = (.g‘𝑅) | |
| 14 | srgbinom.a | . . 3 ⊢ + = (+g‘𝑅) | |
| 15 | srgbinom.e | . . 3 ⊢ ↑ = (.g‘𝐺) | |
| 16 | 7, 9, 13, 14, 6, 15 | srgbinom 20312 | . 2 ⊢ (((𝑅 ∈ SRing ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ (𝐴 × 𝐵) = (𝐵 × 𝐴))) → (𝑁 ↑ (𝐴 + 𝐵)) = (𝑅 Σg (𝑘 ∈ (0...𝑁) ↦ ((𝑁C𝑘) · (((𝑁 − 𝑘) ↑ 𝐴) × (𝑘 ↑ 𝐵)))))) |
| 17 | 2, 3, 4, 12, 16 | syl13anc 1397 | 1 ⊢ (((𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → (𝑁 ↑ (𝐴 + 𝐵)) = (𝑅 Σg (𝑘 ∈ (0...𝑁) ↦ ((𝑁C𝑘) · (((𝑁 − 𝑘) ↑ 𝐴) × (𝑘 ↑ 𝐵)))))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ↦ cmpt 5196 ‘cfv 6537 (class class class)co 7411 0cc0 11099 − cmin 11440 ℕ0cn0 12503 ...cfz 13534 Ccbc 14337 Basecbs 17268 +gcplusg 17309 .rcmulr 17310 Σg cgsu 17492 .gcmg 19132 CMndccmn 19849 mulGrpcmgp 20215 SRingcsrg 20267 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-iin 4963 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-se 5616 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-of 7675 df-om 7862 df-1st 7985 df-2nd 7986 df-supp 8156 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8452 df-2o 8453 df-er 8693 df-map 8825 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-fsupp 9321 df-oi 9471 df-card 9924 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-div 11871 df-nn 12233 df-2 12302 df-n0 12504 df-z 12591 df-uz 12862 df-rp 13016 df-fz 13535 df-fzo 13682 df-seq 14037 df-fac 14309 df-bc 14338 df-hash 14366 df-sets 17223 df-slot 17241 df-ndx 17253 df-base 17269 df-ress 17290 df-plusg 17322 df-0g 17493 df-gsum 17494 df-mre 17637 df-mrc 17638 df-acs 17640 df-mgm 18697 df-sgrp 18776 df-mnd 18792 df-mhm 18840 df-submnd 18841 df-mulg 19133 df-cntz 19386 df-cmn 19851 df-mgp 20216 df-ur 20263 df-srg 20268 |
| This theorem is referenced by: crngbinom 20416 |
| Copyright terms: Public domain | W3C validator |