| 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 4748 | . . . . . 6 ⊢ (𝐼 ∈ 𝑁 → ((𝑁 ∖ {𝐼}) ∪ {𝐼}) = 𝑁) | |
| 3 | 1, 2 | syl 17 | . . . . 5 ⊢ (𝜑 → ((𝑁 ∖ {𝐼}) ∪ {𝐼}) = 𝑁) |
| 4 | 3 | eqcomd 2746 | . . . 4 ⊢ (𝜑 → 𝑁 = ((𝑁 ∖ {𝐼}) ∪ {𝐼})) |
| 5 | 4 | mpteq1d 5169 | . . 3 ⊢ (𝜑 → (𝑘 ∈ 𝑁 ↦ 𝐴) = (𝑘 ∈ ((𝑁 ∖ {𝐼}) ∪ {𝐼}) ↦ 𝐴)) |
| 6 | 5 | oveq2d 7379 | . 2 ⊢ (𝜑 → (𝑀 Σg (𝑘 ∈ 𝑁 ↦ 𝐴)) = (𝑀 Σg (𝑘 ∈ ((𝑁 ∖ {𝐼}) ∪ {𝐼}) ↦ 𝐴))) |
| 7 | mgpsumunsn.m | . . . 4 ⊢ 𝑀 = (mulGrp‘𝑅) | |
| 8 | eqid 2740 | . . . 4 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 9 | 7, 8 | mgpbas 20124 | . . 3 ⊢ (Base‘𝑅) = (Base‘𝑀) |
| 10 | mgpsumunsn.t | . . . 4 ⊢ · = (.r‘𝑅) | |
| 11 | 7, 10 | mgpplusg 20123 | . . 3 ⊢ · = (+g‘𝑀) |
| 12 | mgpsumunsn.r | . . . 4 ⊢ (𝜑 → 𝑅 ∈ CRing) | |
| 13 | 7 | crngmgp 20220 | . . . 4 ⊢ (𝑅 ∈ CRing → 𝑀 ∈ CMnd) |
| 14 | 12, 13 | syl 17 | . . 3 ⊢ (𝜑 → 𝑀 ∈ CMnd) |
| 15 | mgpsumunsn.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ Fin) | |
| 16 | diffi 9106 | . . . 4 ⊢ (𝑁 ∈ Fin → (𝑁 ∖ {𝐼}) ∈ Fin) | |
| 17 | 15, 16 | syl 17 | . . 3 ⊢ (𝜑 → (𝑁 ∖ {𝐼}) ∈ Fin) |
| 18 | eldifi 4068 | . . . 4 ⊢ (𝑘 ∈ (𝑁 ∖ {𝐼}) → 𝑘 ∈ 𝑁) | |
| 19 | mgpsumunsn.a | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑁) → 𝐴 ∈ (Base‘𝑅)) | |
| 20 | 18, 19 | sylan2 599 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑁 ∖ {𝐼})) → 𝐴 ∈ (Base‘𝑅)) |
| 21 | neldifsnd 4733 | . . 3 ⊢ (𝜑 → ¬ 𝐼 ∈ (𝑁 ∖ {𝐼})) | |
| 22 | mgpsumunsn.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝑅)) | |
| 23 | mgpsumunsn.e | . . 3 ⊢ (𝑘 = 𝐼 → 𝐴 = 𝑋) | |
| 24 | 9, 11, 14, 17, 20, 1, 21, 22, 23 | gsumunsn 19933 | . 2 ⊢ (𝜑 → (𝑀 Σg (𝑘 ∈ ((𝑁 ∖ {𝐼}) ∪ {𝐼}) ↦ 𝐴)) = ((𝑀 Σg (𝑘 ∈ (𝑁 ∖ {𝐼}) ↦ 𝐴)) · 𝑋)) |
| 25 | 6, 24 | eqtrd 2775 | 1 ⊢ (𝜑 → (𝑀 Σg (𝑘 ∈ 𝑁 ↦ 𝐴)) = ((𝑀 Σg (𝑘 ∈ (𝑁 ∖ {𝐼}) ↦ 𝐴)) · 𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∖ cdif 3887 ∪ cun 3888 {csn 4562 ↦ cmpt 5160 ‘cfv 6492 (class class class)co 7363 Fincfn 8890 Basecbs 17177 .rcmulr 17219 Σg cgsu 17401 CMndccmn 19753 mulGrpcmgp 20119 CRingccrg 20213 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-int 4885 df-iun 4930 df-iin 4931 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-of 7627 df-om 7814 df-1st 7938 df-2nd 7939 df-supp 8108 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-1o 8402 df-2o 8403 df-er 8640 df-en 8891 df-dom 8892 df-sdom 8893 df-fin 8894 df-fsupp 9272 df-oi 9422 df-card 9861 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-nn 12173 df-2 12242 df-n0 12436 df-z 12523 df-uz 12787 df-fz 13460 df-fzo 13607 df-seq 13962 df-hash 14291 df-sets 17132 df-slot 17150 df-ndx 17162 df-base 17178 df-ress 17199 df-plusg 17231 df-0g 17402 df-gsum 17403 df-mre 17546 df-mrc 17547 df-acs 17549 df-mgm 18606 df-sgrp 18685 df-mnd 18701 df-submnd 18750 df-mulg 19042 df-cntz 19290 df-cmn 19755 df-mgp 20120 df-cring 20215 |
| This theorem is referenced by: mgpsumz 48854 mgpsumn 48855 |
| Copyright terms: Public domain | W3C validator |