Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > gsumzinv | Structured version Visualization version GIF version |
Description: Inverse of a group sum. (Contributed by Mario Carneiro, 25-Apr-2016.) (Revised by AV, 6-Jun-2019.) |
Ref | Expression |
---|---|
gsumzinv.b | ⊢ 𝐵 = (Base‘𝐺) |
gsumzinv.0 | ⊢ 0 = (0g‘𝐺) |
gsumzinv.z | ⊢ 𝑍 = (Cntz‘𝐺) |
gsumzinv.i | ⊢ 𝐼 = (invg‘𝐺) |
gsumzinv.g | ⊢ (𝜑 → 𝐺 ∈ Grp) |
gsumzinv.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
gsumzinv.f | ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) |
gsumzinv.c | ⊢ (𝜑 → ran 𝐹 ⊆ (𝑍‘ran 𝐹)) |
gsumzinv.n | ⊢ (𝜑 → 𝐹 finSupp 0 ) |
Ref | Expression |
---|---|
gsumzinv | ⊢ (𝜑 → (𝐺 Σg (𝐼 ∘ 𝐹)) = (𝐼‘(𝐺 Σg 𝐹))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | gsumzinv.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
2 | gsumzinv.0 | . . 3 ⊢ 0 = (0g‘𝐺) | |
3 | gsumzinv.z | . . 3 ⊢ 𝑍 = (Cntz‘𝐺) | |
4 | eqid 2821 | . . 3 ⊢ (oppg‘𝐺) = (oppg‘𝐺) | |
5 | gsumzinv.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Grp) | |
6 | grpmnd 18109 | . . . 4 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Mnd) | |
7 | 5, 6 | syl 17 | . . 3 ⊢ (𝜑 → 𝐺 ∈ Mnd) |
8 | gsumzinv.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
9 | gsumzinv.i | . . . . . 6 ⊢ 𝐼 = (invg‘𝐺) | |
10 | 1, 9 | grpinvf 18149 | . . . . 5 ⊢ (𝐺 ∈ Grp → 𝐼:𝐵⟶𝐵) |
11 | 5, 10 | syl 17 | . . . 4 ⊢ (𝜑 → 𝐼:𝐵⟶𝐵) |
12 | gsumzinv.f | . . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) | |
13 | fco 6530 | . . . 4 ⊢ ((𝐼:𝐵⟶𝐵 ∧ 𝐹:𝐴⟶𝐵) → (𝐼 ∘ 𝐹):𝐴⟶𝐵) | |
14 | 11, 12, 13 | syl2anc 586 | . . 3 ⊢ (𝜑 → (𝐼 ∘ 𝐹):𝐴⟶𝐵) |
15 | 4, 9 | invoppggim 18487 | . . . . . 6 ⊢ (𝐺 ∈ Grp → 𝐼 ∈ (𝐺 GrpIso (oppg‘𝐺))) |
16 | gimghm 18403 | . . . . . 6 ⊢ (𝐼 ∈ (𝐺 GrpIso (oppg‘𝐺)) → 𝐼 ∈ (𝐺 GrpHom (oppg‘𝐺))) | |
17 | ghmmhm 18367 | . . . . . 6 ⊢ (𝐼 ∈ (𝐺 GrpHom (oppg‘𝐺)) → 𝐼 ∈ (𝐺 MndHom (oppg‘𝐺))) | |
18 | 5, 15, 16, 17 | 4syl 19 | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ (𝐺 MndHom (oppg‘𝐺))) |
19 | gsumzinv.c | . . . . 5 ⊢ (𝜑 → ran 𝐹 ⊆ (𝑍‘ran 𝐹)) | |
20 | eqid 2821 | . . . . . 6 ⊢ (Cntz‘(oppg‘𝐺)) = (Cntz‘(oppg‘𝐺)) | |
21 | 3, 20 | cntzmhm2 18469 | . . . . 5 ⊢ ((𝐼 ∈ (𝐺 MndHom (oppg‘𝐺)) ∧ ran 𝐹 ⊆ (𝑍‘ran 𝐹)) → (𝐼 “ ran 𝐹) ⊆ ((Cntz‘(oppg‘𝐺))‘(𝐼 “ ran 𝐹))) |
22 | 18, 19, 21 | syl2anc 586 | . . . 4 ⊢ (𝜑 → (𝐼 “ ran 𝐹) ⊆ ((Cntz‘(oppg‘𝐺))‘(𝐼 “ ran 𝐹))) |
23 | rnco2 6105 | . . . 4 ⊢ ran (𝐼 ∘ 𝐹) = (𝐼 “ ran 𝐹) | |
24 | 23 | fveq2i 6672 | . . . . 5 ⊢ (𝑍‘ran (𝐼 ∘ 𝐹)) = (𝑍‘(𝐼 “ ran 𝐹)) |
25 | 4, 3 | oppgcntz 18491 | . . . . 5 ⊢ (𝑍‘(𝐼 “ ran 𝐹)) = ((Cntz‘(oppg‘𝐺))‘(𝐼 “ ran 𝐹)) |
26 | 24, 25 | eqtri 2844 | . . . 4 ⊢ (𝑍‘ran (𝐼 ∘ 𝐹)) = ((Cntz‘(oppg‘𝐺))‘(𝐼 “ ran 𝐹)) |
27 | 22, 23, 26 | 3sstr4g 4011 | . . 3 ⊢ (𝜑 → ran (𝐼 ∘ 𝐹) ⊆ (𝑍‘ran (𝐼 ∘ 𝐹))) |
28 | 2 | fvexi 6683 | . . . . 5 ⊢ 0 ∈ V |
29 | 28 | a1i 11 | . . . 4 ⊢ (𝜑 → 0 ∈ V) |
30 | 1 | fvexi 6683 | . . . . 5 ⊢ 𝐵 ∈ V |
31 | 30 | a1i 11 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ V) |
32 | gsumzinv.n | . . . 4 ⊢ (𝜑 → 𝐹 finSupp 0 ) | |
33 | 2, 9 | grpinvid 18159 | . . . . 5 ⊢ (𝐺 ∈ Grp → (𝐼‘ 0 ) = 0 ) |
34 | 5, 33 | syl 17 | . . . 4 ⊢ (𝜑 → (𝐼‘ 0 ) = 0 ) |
35 | 29, 12, 11, 8, 31, 32, 34 | fsuppco2 8865 | . . 3 ⊢ (𝜑 → (𝐼 ∘ 𝐹) finSupp 0 ) |
36 | 1, 2, 3, 4, 7, 8, 14, 27, 35 | gsumzoppg 19063 | . 2 ⊢ (𝜑 → ((oppg‘𝐺) Σg (𝐼 ∘ 𝐹)) = (𝐺 Σg (𝐼 ∘ 𝐹))) |
37 | 4 | oppgmnd 18481 | . . . 4 ⊢ (𝐺 ∈ Mnd → (oppg‘𝐺) ∈ Mnd) |
38 | 7, 37 | syl 17 | . . 3 ⊢ (𝜑 → (oppg‘𝐺) ∈ Mnd) |
39 | 1, 3, 7, 38, 8, 18, 12, 19, 2, 32 | gsumzmhm 19056 | . 2 ⊢ (𝜑 → ((oppg‘𝐺) Σg (𝐼 ∘ 𝐹)) = (𝐼‘(𝐺 Σg 𝐹))) |
40 | 36, 39 | eqtr3d 2858 | 1 ⊢ (𝜑 → (𝐺 Σg (𝐼 ∘ 𝐹)) = (𝐼‘(𝐺 Σg 𝐹))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2110 Vcvv 3494 ⊆ wss 3935 class class class wbr 5065 ran crn 5555 “ cima 5557 ∘ ccom 5558 ⟶wf 6350 ‘cfv 6354 (class class class)co 7155 finSupp cfsupp 8832 Basecbs 16482 0gc0g 16712 Σg cgsu 16713 Mndcmnd 17910 MndHom cmhm 17953 Grpcgrp 18102 invgcminusg 18103 GrpHom cghm 18354 GrpIso cgim 18396 Cntzccntz 18444 oppgcoppg 18472 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5189 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-cnex 10592 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-int 4876 df-iun 4920 df-iin 4921 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-se 5514 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-ord 6193 df-on 6194 df-lim 6195 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-isom 6363 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-om 7580 df-1st 7688 df-2nd 7689 df-supp 7830 df-tpos 7891 df-wrecs 7946 df-recs 8007 df-rdg 8045 df-1o 8101 df-oadd 8105 df-er 8288 df-map 8407 df-en 8509 df-dom 8510 df-sdom 8511 df-fin 8512 df-fsupp 8833 df-oi 8973 df-card 9367 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 df-nn 11638 df-2 11699 df-n0 11897 df-z 11981 df-uz 12243 df-fz 12892 df-fzo 13033 df-seq 13369 df-hash 13690 df-ndx 16485 df-slot 16486 df-base 16488 df-sets 16489 df-ress 16490 df-plusg 16577 df-0g 16714 df-gsum 16715 df-mre 16856 df-mrc 16857 df-acs 16859 df-mgm 17851 df-sgrp 17900 df-mnd 17911 df-mhm 17955 df-submnd 17956 df-grp 18105 df-minusg 18106 df-ghm 18355 df-gim 18398 df-cntz 18446 df-oppg 18473 df-cmn 18907 |
This theorem is referenced by: dprdfinv 19140 |
Copyright terms: Public domain | W3C validator |