| 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 4774 | . . . . . 6 ⊢ (𝐼 ∈ 𝑁 → ((𝑁 ∖ {𝐼}) ∪ {𝐼}) = 𝑁) | |
| 3 | 1, 2 | syl 17 | . . . . 5 ⊢ (𝜑 → ((𝑁 ∖ {𝐼}) ∪ {𝐼}) = 𝑁) |
| 4 | 3 | eqcomd 2735 | . . . 4 ⊢ (𝜑 → 𝑁 = ((𝑁 ∖ {𝐼}) ∪ {𝐼})) |
| 5 | 4 | mpteq1d 5197 | . . 3 ⊢ (𝜑 → (𝑘 ∈ 𝑁 ↦ 𝐴) = (𝑘 ∈ ((𝑁 ∖ {𝐼}) ∪ {𝐼}) ↦ 𝐴)) |
| 6 | 5 | oveq2d 7403 | . 2 ⊢ (𝜑 → (𝑀 Σg (𝑘 ∈ 𝑁 ↦ 𝐴)) = (𝑀 Σg (𝑘 ∈ ((𝑁 ∖ {𝐼}) ∪ {𝐼}) ↦ 𝐴))) |
| 7 | mgpsumunsn.m | . . . 4 ⊢ 𝑀 = (mulGrp‘𝑅) | |
| 8 | eqid 2729 | . . . 4 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 9 | 7, 8 | mgpbas 20054 | . . 3 ⊢ (Base‘𝑅) = (Base‘𝑀) |
| 10 | mgpsumunsn.t | . . . 4 ⊢ · = (.r‘𝑅) | |
| 11 | 7, 10 | mgpplusg 20053 | . . 3 ⊢ · = (+g‘𝑀) |
| 12 | mgpsumunsn.r | . . . 4 ⊢ (𝜑 → 𝑅 ∈ CRing) | |
| 13 | 7 | crngmgp 20150 | . . . 4 ⊢ (𝑅 ∈ CRing → 𝑀 ∈ CMnd) |
| 14 | 12, 13 | syl 17 | . . 3 ⊢ (𝜑 → 𝑀 ∈ CMnd) |
| 15 | mgpsumunsn.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ Fin) | |
| 16 | diffi 9139 | . . . 4 ⊢ (𝑁 ∈ Fin → (𝑁 ∖ {𝐼}) ∈ Fin) | |
| 17 | 15, 16 | syl 17 | . . 3 ⊢ (𝜑 → (𝑁 ∖ {𝐼}) ∈ Fin) |
| 18 | eldifi 4094 | . . . 4 ⊢ (𝑘 ∈ (𝑁 ∖ {𝐼}) → 𝑘 ∈ 𝑁) | |
| 19 | mgpsumunsn.a | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑁) → 𝐴 ∈ (Base‘𝑅)) | |
| 20 | 18, 19 | sylan2 593 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑁 ∖ {𝐼})) → 𝐴 ∈ (Base‘𝑅)) |
| 21 | neldifsnd 4757 | . . 3 ⊢ (𝜑 → ¬ 𝐼 ∈ (𝑁 ∖ {𝐼})) | |
| 22 | mgpsumunsn.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝑅)) | |
| 23 | mgpsumunsn.e | . . 3 ⊢ (𝑘 = 𝐼 → 𝐴 = 𝑋) | |
| 24 | 9, 11, 14, 17, 20, 1, 21, 22, 23 | gsumunsn 19890 | . 2 ⊢ (𝜑 → (𝑀 Σg (𝑘 ∈ ((𝑁 ∖ {𝐼}) ∪ {𝐼}) ↦ 𝐴)) = ((𝑀 Σg (𝑘 ∈ (𝑁 ∖ {𝐼}) ↦ 𝐴)) · 𝑋)) |
| 25 | 6, 24 | eqtrd 2764 | 1 ⊢ (𝜑 → (𝑀 Σg (𝑘 ∈ 𝑁 ↦ 𝐴)) = ((𝑀 Σg (𝑘 ∈ (𝑁 ∖ {𝐼}) ↦ 𝐴)) · 𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∖ cdif 3911 ∪ cun 3912 {csn 4589 ↦ cmpt 5188 ‘cfv 6511 (class class class)co 7387 Fincfn 8918 Basecbs 17179 .rcmulr 17221 Σg cgsu 17403 CMndccmn 19710 mulGrpcmgp 20049 CRingccrg 20143 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-int 4911 df-iun 4957 df-iin 4958 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-se 5592 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-isom 6520 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-of 7653 df-om 7843 df-1st 7968 df-2nd 7969 df-supp 8140 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-1o 8434 df-2o 8435 df-er 8671 df-en 8919 df-dom 8920 df-sdom 8921 df-fin 8922 df-fsupp 9313 df-oi 9463 df-card 9892 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-nn 12187 df-2 12249 df-n0 12443 df-z 12530 df-uz 12794 df-fz 13469 df-fzo 13616 df-seq 13967 df-hash 14296 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-ress 17201 df-plusg 17233 df-0g 17404 df-gsum 17405 df-mre 17547 df-mrc 17548 df-acs 17550 df-mgm 18567 df-sgrp 18646 df-mnd 18662 df-submnd 18711 df-mulg 19000 df-cntz 19249 df-cmn 19712 df-mgp 20050 df-cring 20145 |
| This theorem is referenced by: mgpsumz 48347 mgpsumn 48348 |
| Copyright terms: Public domain | W3C validator |