| 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 1150 | . . 3 ⊢ ((𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0) → (𝑅 ∈ SRing ∧ 𝑁 ∈ ℕ0)) | |
| 2 | 1 | adantr 480 | . 2 ⊢ (((𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → (𝑅 ∈ SRing ∧ 𝑁 ∈ ℕ0)) |
| 3 | simprl 771 | . 2 ⊢ (((𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → 𝐴 ∈ 𝑆) | |
| 4 | simprr 773 | . 2 ⊢ (((𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → 𝐵 ∈ 𝑆) | |
| 5 | simpl2 1194 | . . 3 ⊢ (((𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → 𝐺 ∈ CMnd) | |
| 6 | srgbinom.g | . . . . 5 ⊢ 𝐺 = (mulGrp‘𝑅) | |
| 7 | srgbinom.s | . . . . 5 ⊢ 𝑆 = (Base‘𝑅) | |
| 8 | 6, 7 | mgpbas 20092 | . . . 4 ⊢ 𝑆 = (Base‘𝐺) |
| 9 | srgbinom.m | . . . . 5 ⊢ × = (.r‘𝑅) | |
| 10 | 6, 9 | mgpplusg 20091 | . . . 4 ⊢ × = (+g‘𝐺) |
| 11 | 8, 10 | cmncom 19739 | . . 3 ⊢ ((𝐺 ∈ CMnd ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴 × 𝐵) = (𝐵 × 𝐴)) |
| 12 | 5, 3, 4, 11 | syl3anc 1374 | . 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 20178 | . 2 ⊢ (((𝑅 ∈ SRing ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ (𝐴 × 𝐵) = (𝐵 × 𝐴))) → (𝑁 ↑ (𝐴 + 𝐵)) = (𝑅 Σg (𝑘 ∈ (0...𝑁) ↦ ((𝑁C𝑘) · (((𝑁 − 𝑘) ↑ 𝐴) × (𝑘 ↑ 𝐵)))))) |
| 17 | 2, 3, 4, 12, 16 | syl13anc 1375 | 1 ⊢ (((𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → (𝑁 ↑ (𝐴 + 𝐵)) = (𝑅 Σg (𝑘 ∈ (0...𝑁) ↦ ((𝑁C𝑘) · (((𝑁 − 𝑘) ↑ 𝐴) × (𝑘 ↑ 𝐵)))))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ↦ cmpt 5181 ‘cfv 6500 (class class class)co 7368 0cc0 11038 − cmin 11376 ℕ0cn0 12413 ...cfz 13435 Ccbc 14237 Basecbs 17148 +gcplusg 17189 .rcmulr 17190 Σg cgsu 17372 .gcmg 19009 CMndccmn 19721 mulGrpcmgp 20087 SRingcsrg 20133 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-iin 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-se 5586 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-isom 6509 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-of 7632 df-om 7819 df-1st 7943 df-2nd 7944 df-supp 8113 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-2o 8408 df-er 8645 df-map 8777 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-fsupp 9277 df-oi 9427 df-card 9863 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-div 11807 df-nn 12158 df-2 12220 df-n0 12414 df-z 12501 df-uz 12764 df-rp 12918 df-fz 13436 df-fzo 13583 df-seq 13937 df-fac 14209 df-bc 14238 df-hash 14266 df-sets 17103 df-slot 17121 df-ndx 17133 df-base 17149 df-ress 17170 df-plusg 17202 df-0g 17373 df-gsum 17374 df-mre 17517 df-mrc 17518 df-acs 17520 df-mgm 18577 df-sgrp 18656 df-mnd 18672 df-mhm 18720 df-submnd 18721 df-mulg 19010 df-cntz 19258 df-cmn 19723 df-mgp 20088 df-ur 20129 df-srg 20134 |
| This theorem is referenced by: crngbinom 20283 |
| Copyright terms: Public domain | W3C validator |