| 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 4762 | . . . . . 6 ⊢ (𝐼 ∈ 𝑁 → ((𝑁 ∖ {𝐼}) ∪ {𝐼}) = 𝑁) | |
| 3 | 1, 2 | syl 17 | . . . . 5 ⊢ (𝜑 → ((𝑁 ∖ {𝐼}) ∪ {𝐼}) = 𝑁) |
| 4 | 3 | eqcomd 2762 | . . . 4 ⊢ (𝜑 → 𝑁 = ((𝑁 ∖ {𝐼}) ∪ {𝐼})) |
| 5 | 4 | mpteq1d 5184 | . . 3 ⊢ (𝜑 → (𝑘 ∈ 𝑁 ↦ 𝐴) = (𝑘 ∈ ((𝑁 ∖ {𝐼}) ∪ {𝐼}) ↦ 𝐴)) |
| 6 | 5 | oveq2d 7401 | . 2 ⊢ (𝜑 → (𝑀 Σg (𝑘 ∈ 𝑁 ↦ 𝐴)) = (𝑀 Σg (𝑘 ∈ ((𝑁 ∖ {𝐼}) ∪ {𝐼}) ↦ 𝐴))) |
| 7 | mgpsumunsn.m | . . . 4 ⊢ 𝑀 = (mulGrp‘𝑅) | |
| 8 | eqid 2756 | . . . 4 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 9 | 7, 8 | mgpbas 20167 | . . 3 ⊢ (Base‘𝑅) = (Base‘𝑀) |
| 10 | mgpsumunsn.t | . . . 4 ⊢ · = (.r‘𝑅) | |
| 11 | 7, 10 | mgpplusg 20166 | . . 3 ⊢ · = (+g‘𝑀) |
| 12 | mgpsumunsn.r | . . . 4 ⊢ (𝜑 → 𝑅 ∈ CRing) | |
| 13 | 7 | crngmgp 20263 | . . . 4 ⊢ (𝑅 ∈ CRing → 𝑀 ∈ CMnd) |
| 14 | 12, 13 | syl 17 | . . 3 ⊢ (𝜑 → 𝑀 ∈ CMnd) |
| 15 | mgpsumunsn.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ Fin) | |
| 16 | diffi 9132 | . . . 4 ⊢ (𝑁 ∈ Fin → (𝑁 ∖ {𝐼}) ∈ Fin) | |
| 17 | 15, 16 | syl 17 | . . 3 ⊢ (𝜑 → (𝑁 ∖ {𝐼}) ∈ Fin) |
| 18 | eldifi 4079 | . . . 4 ⊢ (𝑘 ∈ (𝑁 ∖ {𝐼}) → 𝑘 ∈ 𝑁) | |
| 19 | mgpsumunsn.a | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑁) → 𝐴 ∈ (Base‘𝑅)) | |
| 20 | 18, 19 | sylan2 601 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑁 ∖ {𝐼})) → 𝐴 ∈ (Base‘𝑅)) |
| 21 | neldifsnd 4747 | . . 3 ⊢ (𝜑 → ¬ 𝐼 ∈ (𝑁 ∖ {𝐼})) | |
| 22 | mgpsumunsn.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝑅)) | |
| 23 | mgpsumunsn.e | . . 3 ⊢ (𝑘 = 𝐼 → 𝐴 = 𝑋) | |
| 24 | 9, 11, 14, 17, 20, 1, 21, 22, 23 | gsumunsn 19976 | . 2 ⊢ (𝜑 → (𝑀 Σg (𝑘 ∈ ((𝑁 ∖ {𝐼}) ∪ {𝐼}) ↦ 𝐴)) = ((𝑀 Σg (𝑘 ∈ (𝑁 ∖ {𝐼}) ↦ 𝐴)) · 𝑋)) |
| 25 | 6, 24 | eqtrd 2791 | 1 ⊢ (𝜑 → (𝑀 Σg (𝑘 ∈ 𝑁 ↦ 𝐴)) = ((𝑀 Σg (𝑘 ∈ (𝑁 ∖ {𝐼}) ↦ 𝐴)) · 𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 398 = wceq 1554 ∈ wcel 2136 ∖ cdif 3896 ∪ cun 3897 {csn 4576 ↦ cmpt 5175 ‘cfv 6510 (class class class)co 7385 Fincfn 8916 Basecbs 17221 .rcmulr 17263 Σg cgsu 17445 CMndccmn 19796 mulGrpcmgp 20162 CRingccrg 20256 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-10 2169 ax-11 2185 ax-12 2206 ax-ext 2728 ax-rep 5221 ax-sep 5240 ax-nul 5250 ax-pow 5316 ax-pr 5384 ax-un 7707 ax-cnex 11119 ax-resscn 11120 ax-1cn 11121 ax-icn 11122 ax-addcl 11123 ax-addrcl 11124 ax-mulcl 11125 ax-mulrcl 11126 ax-mulcom 11127 ax-addass 11128 ax-mulass 11129 ax-distr 11130 ax-i2m1 11131 ax-1ne0 11132 ax-1rid 11133 ax-rnegex 11134 ax-rrecex 11135 ax-cnre 11136 ax-pre-lttri 11137 ax-pre-lttrn 11138 ax-pre-ltadd 11139 ax-pre-mulgt0 11140 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-nf 1798 df-sb 2085 df-mo 2560 df-eu 2590 df-clab 2735 df-cleq 2748 df-clel 2831 df-nfc 2905 df-ne 2952 df-nel 3056 df-ral 3071 df-rex 3081 df-rmo 3361 df-reu 3362 df-rab 3409 df-v 3450 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4475 df-pw 4551 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-int 4900 df-iun 4945 df-iin 4946 df-br 5095 df-opab 5157 df-mpt 5176 df-tr 5202 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-se 5594 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6466 df-fun 6512 df-fn 6513 df-f 6514 df-f1 6515 df-fo 6516 df-f1o 6517 df-fv 6518 df-isom 6519 df-riota 7342 df-ov 7388 df-oprab 7389 df-mpo 7390 df-of 7649 df-om 7836 df-1st 7959 df-2nd 7960 df-supp 8129 df-frecs 8250 df-wrecs 8281 df-recs 8330 df-rdg 8369 df-1o 8425 df-2o 8426 df-er 8666 df-en 8917 df-dom 8918 df-sdom 8919 df-fin 8920 df-fsupp 9298 df-oi 9448 df-card 9887 df-pnf 11208 df-mnf 11209 df-xr 11210 df-ltxr 11211 df-le 11212 df-sub 11406 df-neg 11407 df-nn 12201 df-2 12270 df-n0 12472 df-z 12559 df-uz 12830 df-fz 13503 df-fzo 13650 df-seq 14005 df-hash 14334 df-sets 17176 df-slot 17194 df-ndx 17206 df-base 17222 df-ress 17243 df-plusg 17275 df-0g 17446 df-gsum 17447 df-mre 17590 df-mrc 17591 df-acs 17593 df-mgm 18650 df-sgrp 18729 df-mnd 18745 df-submnd 18794 df-mulg 19086 df-cntz 19333 df-cmn 19798 df-mgp 20163 df-cring 20258 |
| This theorem is referenced by: mgpsumz 48932 mgpsumn 48933 |
| Copyright terms: Public domain | W3C validator |