| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > crngbinom | Structured version Visualization version GIF version | ||
| Description: The binomial theorem for commutative rings (special case of csrgbinom 20511): (𝐴 + 𝐵)↑𝑁 is the sum from 𝑘 = 0 to 𝑁 of (𝑁C𝑘) · ((𝐴↑𝑘) · (𝐵↑(𝑁 − 𝑘)). (Contributed by AV, 24-Aug-2019.) |
| Ref | Expression |
|---|---|
| crngbinom.s | ⊢ 𝑆 = (Base‘𝑅) |
| crngbinom.m | ⊢ × = (.r‘𝑅) |
| crngbinom.t | ⊢ · = (.g‘𝑅) |
| crngbinom.a | ⊢ + = (+g‘𝑅) |
| crngbinom.g | ⊢ 𝐺 = (mulGrp‘𝑅) |
| crngbinom.e | ⊢ ↑ = (.g‘𝐺) |
| Ref | Expression |
|---|---|
| crngbinom | ⊢ (((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → (𝑁 ↑ (𝐴 + 𝐵)) = (𝑅 Σg (𝑘 ∈ (0...𝑁) ↦ ((𝑁C𝑘) · (((𝑁 − 𝑘) ↑ 𝐴) × (𝑘 ↑ 𝐵)))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | crngring 20525 | . . . . 5 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring) | |
| 2 | ringsrg 20581 | . . . . 5 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ SRing) | |
| 3 | 1, 2 | syl 18 | . . . 4 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ SRing) |
| 4 | 3 | adantr 486 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0) → 𝑅 ∈ SRing) |
| 5 | crngbinom.g | . . . . 5 ⊢ 𝐺 = (mulGrp‘𝑅) | |
| 6 | 5 | crngmgp 20520 | . . . 4 ⊢ (𝑅 ∈ CRing → 𝐺 ∈ CMnd) |
| 7 | 6 | adantr 486 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0) → 𝐺 ∈ CMnd) |
| 8 | simpr 490 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0) → 𝑁 ∈ ℕ0) | |
| 9 | 4, 7, 8 | 3jca 1147 | . 2 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0) → (𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0)) |
| 10 | crngbinom.s | . . 3 ⊢ 𝑆 = (Base‘𝑅) | |
| 11 | crngbinom.m | . . 3 ⊢ × = (.r‘𝑅) | |
| 12 | crngbinom.t | . . 3 ⊢ · = (.g‘𝑅) | |
| 13 | crngbinom.a | . . 3 ⊢ + = (+g‘𝑅) | |
| 14 | crngbinom.e | . . 3 ⊢ ↑ = (.g‘𝐺) | |
| 15 | 10, 11, 12, 13, 5, 14 | csrgbinom 20511 | . 2 ⊢ (((𝑅 ∈ SRing ∧ 𝐺 ∈ CMnd ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → (𝑁 ↑ (𝐴 + 𝐵)) = (𝑅 Σg (𝑘 ∈ (0...𝑁) ↦ ((𝑁C𝑘) · (((𝑁 − 𝑘) ↑ 𝐴) × (𝑘 ↑ 𝐵)))))) |
| 16 | 9, 15 | sylan 592 | 1 ⊢ (((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → (𝑁 ↑ (𝐴 + 𝐵)) = (𝑅 Σg (𝑘 ∈ (0...𝑁) ↦ ((𝑁C𝑘) · (((𝑁 − 𝑘) ↑ 𝐴) × (𝑘 ↑ 𝐵)))))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1104 = wceq 1572 ∈ wcel 2150 ↦ cmpt 5191 ‘cfv 6565 (class class class)co 7450 0cc0 11238 − cmin 11579 ℕ0cn0 12645 ...cfz 13678 Ccbc 14486 Basecbs 17433 +gcplusg 17474 .rcmulr 17475 Σg cgsu 17663 .gcmg 19329 CMndccmn 20047 mulGrpcmgp 20413 SRingcsrg 20465 Ringcrg 20512 CRingccrg 20513 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-int 4912 df-iun 4957 df-iin 4958 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-se 5611 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-isom 6574 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-of 7724 df-om 7911 df-1st 8034 df-2nd 8035 df-supp 8214 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-1o 8513 df-2o 8514 df-er 8754 df-map 8886 df-en 9011 df-dom 9012 df-sdom 9013 df-fin 9014 df-fsupp 9391 df-oi 9540 df-card 10056 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-div 12013 df-nn 12375 df-2 12444 df-n0 12646 df-z 12733 df-uz 13005 df-rp 13160 df-fz 13679 df-fzo 13828 df-seq 14184 df-fac 14458 df-bc 14487 df-hash 14515 df-sets 17388 df-slot 17406 df-ndx 17418 df-base 17434 df-ress 17455 df-plusg 17488 df-0g 17664 df-gsum 17665 df-mre 17808 df-mrc 17809 df-acs 17811 df-mgm 18868 df-sgrp 18960 df-mnd 18976 df-mhm 19030 df-submnd 19031 df-grp 19199 df-minusg 19200 df-mulg 19330 df-cntz 19584 df-cmn 20049 df-abl 20050 df-mgp 20414 df-rng 20428 df-ur 20461 df-srg 20466 df-ring 20514 df-cring 20515 |
| This theorem is used by: freshmansdream 21937 lply1binom 22685 |
| Copyright terms: Public domain | W3C validator |