![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > mulgghm | Structured version Visualization version GIF version |
Description: The map from 𝑥 to 𝑛𝑥 for a fixed integer 𝑛 is a group homomorphism if the group is commutative. (Contributed by Mario Carneiro, 4-May-2015.) |
Ref | Expression |
---|---|
mulgmhm.b | ⊢ 𝐵 = (Base‘𝐺) |
mulgmhm.m | ⊢ · = (.g‘𝐺) |
Ref | Expression |
---|---|
mulgghm | ⊢ ((𝐺 ∈ Abel ∧ 𝑀 ∈ ℤ) → (𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥)) ∈ (𝐺 GrpHom 𝐺)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mulgmhm.b | . 2 ⊢ 𝐵 = (Base‘𝐺) | |
2 | eqid 2622 | . 2 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
3 | ablgrp 18198 | . . 3 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
4 | 3 | adantr 481 | . 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑀 ∈ ℤ) → 𝐺 ∈ Grp) |
5 | mulgmhm.m | . . . . . 6 ⊢ · = (.g‘𝐺) | |
6 | 1, 5 | mulgcl 17559 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑀 ∈ ℤ ∧ 𝑥 ∈ 𝐵) → (𝑀 · 𝑥) ∈ 𝐵) |
7 | 3, 6 | syl3an1 1359 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ 𝑀 ∈ ℤ ∧ 𝑥 ∈ 𝐵) → (𝑀 · 𝑥) ∈ 𝐵) |
8 | 7 | 3expa 1265 | . . 3 ⊢ (((𝐺 ∈ Abel ∧ 𝑀 ∈ ℤ) ∧ 𝑥 ∈ 𝐵) → (𝑀 · 𝑥) ∈ 𝐵) |
9 | eqid 2622 | . . 3 ⊢ (𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥)) = (𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥)) | |
10 | 8, 9 | fmptd 6385 | . 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑀 ∈ ℤ) → (𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥)):𝐵⟶𝐵) |
11 | 3anass 1042 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ↔ (𝑀 ∈ ℤ ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵))) | |
12 | 1, 5, 2 | mulgdi 18232 | . . . . 5 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑀 · (𝑦(+g‘𝐺)𝑧)) = ((𝑀 · 𝑦)(+g‘𝐺)(𝑀 · 𝑧))) |
13 | 11, 12 | sylan2br 493 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵))) → (𝑀 · (𝑦(+g‘𝐺)𝑧)) = ((𝑀 · 𝑦)(+g‘𝐺)(𝑀 · 𝑧))) |
14 | 13 | anassrs 680 | . . 3 ⊢ (((𝐺 ∈ Abel ∧ 𝑀 ∈ ℤ) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑀 · (𝑦(+g‘𝐺)𝑧)) = ((𝑀 · 𝑦)(+g‘𝐺)(𝑀 · 𝑧))) |
15 | 1, 2 | grpcl 17430 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → (𝑦(+g‘𝐺)𝑧) ∈ 𝐵) |
16 | 15 | 3expb 1266 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑦(+g‘𝐺)𝑧) ∈ 𝐵) |
17 | 4, 16 | sylan 488 | . . . 4 ⊢ (((𝐺 ∈ Abel ∧ 𝑀 ∈ ℤ) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑦(+g‘𝐺)𝑧) ∈ 𝐵) |
18 | oveq2 6658 | . . . . 5 ⊢ (𝑥 = (𝑦(+g‘𝐺)𝑧) → (𝑀 · 𝑥) = (𝑀 · (𝑦(+g‘𝐺)𝑧))) | |
19 | ovex 6678 | . . . . 5 ⊢ (𝑀 · (𝑦(+g‘𝐺)𝑧)) ∈ V | |
20 | 18, 9, 19 | fvmpt 6282 | . . . 4 ⊢ ((𝑦(+g‘𝐺)𝑧) ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘(𝑦(+g‘𝐺)𝑧)) = (𝑀 · (𝑦(+g‘𝐺)𝑧))) |
21 | 17, 20 | syl 17 | . . 3 ⊢ (((𝐺 ∈ Abel ∧ 𝑀 ∈ ℤ) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘(𝑦(+g‘𝐺)𝑧)) = (𝑀 · (𝑦(+g‘𝐺)𝑧))) |
22 | oveq2 6658 | . . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑀 · 𝑥) = (𝑀 · 𝑦)) | |
23 | ovex 6678 | . . . . . 6 ⊢ (𝑀 · 𝑦) ∈ V | |
24 | 22, 9, 23 | fvmpt 6282 | . . . . 5 ⊢ (𝑦 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘𝑦) = (𝑀 · 𝑦)) |
25 | oveq2 6658 | . . . . . 6 ⊢ (𝑥 = 𝑧 → (𝑀 · 𝑥) = (𝑀 · 𝑧)) | |
26 | ovex 6678 | . . . . . 6 ⊢ (𝑀 · 𝑧) ∈ V | |
27 | 25, 9, 26 | fvmpt 6282 | . . . . 5 ⊢ (𝑧 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘𝑧) = (𝑀 · 𝑧)) |
28 | 24, 27 | oveqan12d 6669 | . . . 4 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → (((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘𝑦)(+g‘𝐺)((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘𝑧)) = ((𝑀 · 𝑦)(+g‘𝐺)(𝑀 · 𝑧))) |
29 | 28 | adantl 482 | . . 3 ⊢ (((𝐺 ∈ Abel ∧ 𝑀 ∈ ℤ) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘𝑦)(+g‘𝐺)((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘𝑧)) = ((𝑀 · 𝑦)(+g‘𝐺)(𝑀 · 𝑧))) |
30 | 14, 21, 29 | 3eqtr4d 2666 | . 2 ⊢ (((𝐺 ∈ Abel ∧ 𝑀 ∈ ℤ) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘(𝑦(+g‘𝐺)𝑧)) = (((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘𝑦)(+g‘𝐺)((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘𝑧))) |
31 | 1, 1, 2, 2, 4, 4, 10, 30 | isghmd 17669 | 1 ⊢ ((𝐺 ∈ Abel ∧ 𝑀 ∈ ℤ) → (𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥)) ∈ (𝐺 GrpHom 𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ↦ cmpt 4729 ‘cfv 5888 (class class class)co 6650 ℤcz 11377 Basecbs 15857 +gcplusg 15941 Grpcgrp 17422 .gcmg 17540 GrpHom cghm 17657 Abelcabl 18194 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-inf2 8538 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-n0 11293 df-z 11378 df-uz 11688 df-fz 12327 df-fzo 12466 df-seq 12802 df-0g 16102 df-mgm 17242 df-sgrp 17284 df-mnd 17295 df-grp 17425 df-minusg 17426 df-mulg 17541 df-ghm 17658 df-cmn 18195 df-abl 18196 |
This theorem is referenced by: gsummulglem 18341 |
Copyright terms: Public domain | W3C validator |