| 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 1149 | . . 3 ⊢ ((𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0) → (𝑅 ∈ SRing ∧ 𝑁 ∈ ℕ0)) | |
| 2 | 1 | adantr 480 | . 2 ⊢ (((𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → (𝑅 ∈ SRing ∧ 𝑁 ∈ ℕ0)) |
| 3 | simprl 770 | . 2 ⊢ (((𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → 𝐴 ∈ 𝑆) | |
| 4 | simprr 772 | . 2 ⊢ (((𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → 𝐵 ∈ 𝑆) | |
| 5 | simpl2 1193 | . . 3 ⊢ (((𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → 𝐺 ∈ CMnd) | |
| 6 | srgbinom.g | . . . . 5 ⊢ 𝐺 = (mulGrp‘𝑅) | |
| 7 | srgbinom.s | . . . . 5 ⊢ 𝑆 = (Base‘𝑅) | |
| 8 | 6, 7 | mgpbas 20061 | . . . 4 ⊢ 𝑆 = (Base‘𝐺) |
| 9 | srgbinom.m | . . . . 5 ⊢ × = (.r‘𝑅) | |
| 10 | 6, 9 | mgpplusg 20060 | . . . 4 ⊢ × = (+g‘𝐺) |
| 11 | 8, 10 | cmncom 19708 | . . 3 ⊢ ((𝐺 ∈ CMnd ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴 × 𝐵) = (𝐵 × 𝐴)) |
| 12 | 5, 3, 4, 11 | syl3anc 1373 | . 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 20147 | . 2 ⊢ (((𝑅 ∈ SRing ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ (𝐴 × 𝐵) = (𝐵 × 𝐴))) → (𝑁 ↑ (𝐴 + 𝐵)) = (𝑅 Σg (𝑘 ∈ (0...𝑁) ↦ ((𝑁C𝑘) · (((𝑁 − 𝑘) ↑ 𝐴) × (𝑘 ↑ 𝐵)))))) |
| 17 | 2, 3, 4, 12, 16 | syl13anc 1374 | 1 ⊢ (((𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → (𝑁 ↑ (𝐴 + 𝐵)) = (𝑅 Σg (𝑘 ∈ (0...𝑁) ↦ ((𝑁C𝑘) · (((𝑁 − 𝑘) ↑ 𝐴) × (𝑘 ↑ 𝐵)))))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2111 ↦ cmpt 5172 ‘cfv 6481 (class class class)co 7346 0cc0 11003 − cmin 11341 ℕ0cn0 12378 ...cfz 13404 Ccbc 14206 Basecbs 17117 +gcplusg 17158 .rcmulr 17159 Σg cgsu 17341 .gcmg 18977 CMndccmn 19690 mulGrpcmgp 20056 SRingcsrg 20102 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5217 ax-sep 5234 ax-nul 5244 ax-pow 5303 ax-pr 5370 ax-un 7668 ax-cnex 11059 ax-resscn 11060 ax-1cn 11061 ax-icn 11062 ax-addcl 11063 ax-addrcl 11064 ax-mulcl 11065 ax-mulrcl 11066 ax-mulcom 11067 ax-addass 11068 ax-mulass 11069 ax-distr 11070 ax-i2m1 11071 ax-1ne0 11072 ax-1rid 11073 ax-rnegex 11074 ax-rrecex 11075 ax-cnre 11076 ax-pre-lttri 11077 ax-pre-lttrn 11078 ax-pre-ltadd 11079 ax-pre-mulgt0 11080 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4476 df-pw 4552 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-int 4898 df-iun 4943 df-iin 4944 df-br 5092 df-opab 5154 df-mpt 5173 df-tr 5199 df-id 5511 df-eprel 5516 df-po 5524 df-so 5525 df-fr 5569 df-se 5570 df-we 5571 df-xp 5622 df-rel 5623 df-cnv 5624 df-co 5625 df-dm 5626 df-rn 5627 df-res 5628 df-ima 5629 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-isom 6490 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-of 7610 df-om 7797 df-1st 7921 df-2nd 7922 df-supp 8091 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-1o 8385 df-2o 8386 df-er 8622 df-map 8752 df-en 8870 df-dom 8871 df-sdom 8872 df-fin 8873 df-fsupp 9246 df-oi 9396 df-card 9829 df-pnf 11145 df-mnf 11146 df-xr 11147 df-ltxr 11148 df-le 11149 df-sub 11343 df-neg 11344 df-div 11772 df-nn 12123 df-2 12185 df-n0 12379 df-z 12466 df-uz 12730 df-rp 12888 df-fz 13405 df-fzo 13552 df-seq 13906 df-fac 14178 df-bc 14207 df-hash 14235 df-sets 17072 df-slot 17090 df-ndx 17102 df-base 17118 df-ress 17139 df-plusg 17171 df-0g 17342 df-gsum 17343 df-mre 17485 df-mrc 17486 df-acs 17488 df-mgm 18545 df-sgrp 18624 df-mnd 18640 df-mhm 18688 df-submnd 18689 df-mulg 18978 df-cntz 19227 df-cmn 19692 df-mgp 20057 df-ur 20098 df-srg 20103 |
| This theorem is referenced by: crngbinom 20251 |
| Copyright terms: Public domain | W3C validator |