| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > mgpsumunsn | Structured version Visualization version GIF version | ||
| Description: Extract a summand/factor from the group sum for the multiplicative group of a unital ring. (Contributed by AV, 29-Dec-2018.) |
| Ref | Expression |
|---|---|
| mgpsumunsn.m | ⊢ 𝑀 = (mulGrp‘𝑅) |
| mgpsumunsn.t | ⊢ · = (.r‘𝑅) |
| mgpsumunsn.r | ⊢ (𝜑 → 𝑅 ∈ CRing) |
| mgpsumunsn.n | ⊢ (𝜑 → 𝑁 ∈ Fin) |
| mgpsumunsn.i | ⊢ (𝜑 → 𝐼 ∈ 𝑁) |
| mgpsumunsn.a | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑁) → 𝐴 ∈ (Base‘𝑅)) |
| mgpsumunsn.x | ⊢ (𝜑 → 𝑋 ∈ (Base‘𝑅)) |
| mgpsumunsn.e | ⊢ (𝑘 = 𝐼 → 𝐴 = 𝑋) |
| Ref | Expression |
|---|---|
| mgpsumunsn | ⊢ (𝜑 → (𝑀 Σg (𝑘 ∈ 𝑁 ↦ 𝐴)) = ((𝑀 Σg (𝑘 ∈ (𝑁 ∖ {𝐼}) ↦ 𝐴)) · 𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mgpsumunsn.i | . . . . . 6 ⊢ (𝜑 → 𝐼 ∈ 𝑁) | |
| 2 | difsnid 4768 | . . . . . 6 ⊢ (𝐼 ∈ 𝑁 → ((𝑁 ∖ {𝐼}) ∪ {𝐼}) = 𝑁) | |
| 3 | 1, 2 | syl 17 | . . . . 5 ⊢ (𝜑 → ((𝑁 ∖ {𝐼}) ∪ {𝐼}) = 𝑁) |
| 4 | 3 | eqcomd 2743 | . . . 4 ⊢ (𝜑 → 𝑁 = ((𝑁 ∖ {𝐼}) ∪ {𝐼})) |
| 5 | 4 | mpteq1d 5190 | . . 3 ⊢ (𝜑 → (𝑘 ∈ 𝑁 ↦ 𝐴) = (𝑘 ∈ ((𝑁 ∖ {𝐼}) ∪ {𝐼}) ↦ 𝐴)) |
| 6 | 5 | oveq2d 7386 | . 2 ⊢ (𝜑 → (𝑀 Σg (𝑘 ∈ 𝑁 ↦ 𝐴)) = (𝑀 Σg (𝑘 ∈ ((𝑁 ∖ {𝐼}) ∪ {𝐼}) ↦ 𝐴))) |
| 7 | mgpsumunsn.m | . . . 4 ⊢ 𝑀 = (mulGrp‘𝑅) | |
| 8 | eqid 2737 | . . . 4 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 9 | 7, 8 | mgpbas 20097 | . . 3 ⊢ (Base‘𝑅) = (Base‘𝑀) |
| 10 | mgpsumunsn.t | . . . 4 ⊢ · = (.r‘𝑅) | |
| 11 | 7, 10 | mgpplusg 20096 | . . 3 ⊢ · = (+g‘𝑀) |
| 12 | mgpsumunsn.r | . . . 4 ⊢ (𝜑 → 𝑅 ∈ CRing) | |
| 13 | 7 | crngmgp 20193 | . . . 4 ⊢ (𝑅 ∈ CRing → 𝑀 ∈ CMnd) |
| 14 | 12, 13 | syl 17 | . . 3 ⊢ (𝜑 → 𝑀 ∈ CMnd) |
| 15 | mgpsumunsn.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ Fin) | |
| 16 | diffi 9113 | . . . 4 ⊢ (𝑁 ∈ Fin → (𝑁 ∖ {𝐼}) ∈ Fin) | |
| 17 | 15, 16 | syl 17 | . . 3 ⊢ (𝜑 → (𝑁 ∖ {𝐼}) ∈ Fin) |
| 18 | eldifi 4085 | . . . 4 ⊢ (𝑘 ∈ (𝑁 ∖ {𝐼}) → 𝑘 ∈ 𝑁) | |
| 19 | mgpsumunsn.a | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑁) → 𝐴 ∈ (Base‘𝑅)) | |
| 20 | 18, 19 | sylan2 594 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑁 ∖ {𝐼})) → 𝐴 ∈ (Base‘𝑅)) |
| 21 | neldifsnd 4751 | . . 3 ⊢ (𝜑 → ¬ 𝐼 ∈ (𝑁 ∖ {𝐼})) | |
| 22 | mgpsumunsn.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝑅)) | |
| 23 | mgpsumunsn.e | . . 3 ⊢ (𝑘 = 𝐼 → 𝐴 = 𝑋) | |
| 24 | 9, 11, 14, 17, 20, 1, 21, 22, 23 | gsumunsn 19906 | . 2 ⊢ (𝜑 → (𝑀 Σg (𝑘 ∈ ((𝑁 ∖ {𝐼}) ∪ {𝐼}) ↦ 𝐴)) = ((𝑀 Σg (𝑘 ∈ (𝑁 ∖ {𝐼}) ↦ 𝐴)) · 𝑋)) |
| 25 | 6, 24 | eqtrd 2772 | 1 ⊢ (𝜑 → (𝑀 Σg (𝑘 ∈ 𝑁 ↦ 𝐴)) = ((𝑀 Σg (𝑘 ∈ (𝑁 ∖ {𝐼}) ↦ 𝐴)) · 𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∖ cdif 3900 ∪ cun 3901 {csn 4582 ↦ cmpt 5181 ‘cfv 6502 (class class class)co 7370 Fincfn 8897 Basecbs 17150 .rcmulr 17192 Σg cgsu 17374 CMndccmn 19726 mulGrpcmgp 20092 CRingccrg 20186 |
| 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 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-cnex 11096 ax-resscn 11097 ax-1cn 11098 ax-icn 11099 ax-addcl 11100 ax-addrcl 11101 ax-mulcl 11102 ax-mulrcl 11103 ax-mulcom 11104 ax-addass 11105 ax-mulass 11106 ax-distr 11107 ax-i2m1 11108 ax-1ne0 11109 ax-1rid 11110 ax-rnegex 11111 ax-rrecex 11112 ax-cnre 11113 ax-pre-lttri 11114 ax-pre-lttrn 11115 ax-pre-ltadd 11116 ax-pre-mulgt0 11117 |
| 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 5529 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5587 df-se 5588 df-we 5589 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6269 df-ord 6330 df-on 6331 df-lim 6332 df-suc 6333 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-isom 6511 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-of 7634 df-om 7821 df-1st 7945 df-2nd 7946 df-supp 8115 df-frecs 8235 df-wrecs 8266 df-recs 8315 df-rdg 8353 df-1o 8409 df-2o 8410 df-er 8647 df-en 8898 df-dom 8899 df-sdom 8900 df-fin 8901 df-fsupp 9279 df-oi 9429 df-card 9865 df-pnf 11182 df-mnf 11183 df-xr 11184 df-ltxr 11185 df-le 11186 df-sub 11380 df-neg 11381 df-nn 12160 df-2 12222 df-n0 12416 df-z 12503 df-uz 12766 df-fz 13438 df-fzo 13585 df-seq 13939 df-hash 14268 df-sets 17105 df-slot 17123 df-ndx 17135 df-base 17151 df-ress 17172 df-plusg 17204 df-0g 17375 df-gsum 17376 df-mre 17519 df-mrc 17520 df-acs 17522 df-mgm 18579 df-sgrp 18658 df-mnd 18674 df-submnd 18723 df-mulg 19015 df-cntz 19263 df-cmn 19728 df-mgp 20093 df-cring 20188 |
| This theorem is referenced by: mgpsumz 48751 mgpsumn 48752 |
| Copyright terms: Public domain | W3C validator |