| 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 4766 | . . . . . 6 ⊢ (𝐼 ∈ 𝑁 → ((𝑁 ∖ {𝐼}) ∪ {𝐼}) = 𝑁) | |
| 3 | 1, 2 | syl 17 | . . . . 5 ⊢ (𝜑 → ((𝑁 ∖ {𝐼}) ∪ {𝐼}) = 𝑁) |
| 4 | 3 | eqcomd 2742 | . . . 4 ⊢ (𝜑 → 𝑁 = ((𝑁 ∖ {𝐼}) ∪ {𝐼})) |
| 5 | 4 | mpteq1d 5188 | . . 3 ⊢ (𝜑 → (𝑘 ∈ 𝑁 ↦ 𝐴) = (𝑘 ∈ ((𝑁 ∖ {𝐼}) ∪ {𝐼}) ↦ 𝐴)) |
| 6 | 5 | oveq2d 7374 | . 2 ⊢ (𝜑 → (𝑀 Σg (𝑘 ∈ 𝑁 ↦ 𝐴)) = (𝑀 Σg (𝑘 ∈ ((𝑁 ∖ {𝐼}) ∪ {𝐼}) ↦ 𝐴))) |
| 7 | mgpsumunsn.m | . . . 4 ⊢ 𝑀 = (mulGrp‘𝑅) | |
| 8 | eqid 2736 | . . . 4 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 9 | 7, 8 | mgpbas 20082 | . . 3 ⊢ (Base‘𝑅) = (Base‘𝑀) |
| 10 | mgpsumunsn.t | . . . 4 ⊢ · = (.r‘𝑅) | |
| 11 | 7, 10 | mgpplusg 20081 | . . 3 ⊢ · = (+g‘𝑀) |
| 12 | mgpsumunsn.r | . . . 4 ⊢ (𝜑 → 𝑅 ∈ CRing) | |
| 13 | 7 | crngmgp 20178 | . . . 4 ⊢ (𝑅 ∈ CRing → 𝑀 ∈ CMnd) |
| 14 | 12, 13 | syl 17 | . . 3 ⊢ (𝜑 → 𝑀 ∈ CMnd) |
| 15 | mgpsumunsn.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ Fin) | |
| 16 | diffi 9101 | . . . 4 ⊢ (𝑁 ∈ Fin → (𝑁 ∖ {𝐼}) ∈ Fin) | |
| 17 | 15, 16 | syl 17 | . . 3 ⊢ (𝜑 → (𝑁 ∖ {𝐼}) ∈ Fin) |
| 18 | eldifi 4083 | . . . 4 ⊢ (𝑘 ∈ (𝑁 ∖ {𝐼}) → 𝑘 ∈ 𝑁) | |
| 19 | mgpsumunsn.a | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑁) → 𝐴 ∈ (Base‘𝑅)) | |
| 20 | 18, 19 | sylan2 593 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑁 ∖ {𝐼})) → 𝐴 ∈ (Base‘𝑅)) |
| 21 | neldifsnd 4749 | . . 3 ⊢ (𝜑 → ¬ 𝐼 ∈ (𝑁 ∖ {𝐼})) | |
| 22 | mgpsumunsn.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝑅)) | |
| 23 | mgpsumunsn.e | . . 3 ⊢ (𝑘 = 𝐼 → 𝐴 = 𝑋) | |
| 24 | 9, 11, 14, 17, 20, 1, 21, 22, 23 | gsumunsn 19891 | . 2 ⊢ (𝜑 → (𝑀 Σg (𝑘 ∈ ((𝑁 ∖ {𝐼}) ∪ {𝐼}) ↦ 𝐴)) = ((𝑀 Σg (𝑘 ∈ (𝑁 ∖ {𝐼}) ↦ 𝐴)) · 𝑋)) |
| 25 | 6, 24 | eqtrd 2771 | 1 ⊢ (𝜑 → (𝑀 Σg (𝑘 ∈ 𝑁 ↦ 𝐴)) = ((𝑀 Σg (𝑘 ∈ (𝑁 ∖ {𝐼}) ↦ 𝐴)) · 𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∖ cdif 3898 ∪ cun 3899 {csn 4580 ↦ cmpt 5179 ‘cfv 6492 (class class class)co 7358 Fincfn 8885 Basecbs 17138 .rcmulr 17180 Σg cgsu 17362 CMndccmn 19711 mulGrpcmgp 20077 CRingccrg 20171 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-iin 4949 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-se 5578 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 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 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-of 7622 df-om 7809 df-1st 7933 df-2nd 7934 df-supp 8103 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-2o 8398 df-er 8635 df-en 8886 df-dom 8887 df-sdom 8888 df-fin 8889 df-fsupp 9267 df-oi 9417 df-card 9853 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-nn 12148 df-2 12210 df-n0 12404 df-z 12491 df-uz 12754 df-fz 13426 df-fzo 13573 df-seq 13927 df-hash 14256 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17139 df-ress 17160 df-plusg 17192 df-0g 17363 df-gsum 17364 df-mre 17507 df-mrc 17508 df-acs 17510 df-mgm 18567 df-sgrp 18646 df-mnd 18662 df-submnd 18711 df-mulg 19000 df-cntz 19248 df-cmn 19713 df-mgp 20078 df-cring 20173 |
| This theorem is referenced by: mgpsumz 48629 mgpsumn 48630 |
| Copyright terms: Public domain | W3C validator |