| 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 2729 | . 2 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 3 | ablgrp 19715 | . . 3 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
| 4 | 3 | adantr 480 | . 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑀 ∈ ℤ) → 𝐺 ∈ Grp) |
| 5 | mulgmhm.m | . . . . . 6 ⊢ · = (.g‘𝐺) | |
| 6 | 1, 5 | mulgcl 19023 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑀 ∈ ℤ ∧ 𝑥 ∈ 𝐵) → (𝑀 · 𝑥) ∈ 𝐵) |
| 7 | 3, 6 | syl3an1 1163 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ 𝑀 ∈ ℤ ∧ 𝑥 ∈ 𝐵) → (𝑀 · 𝑥) ∈ 𝐵) |
| 8 | 7 | 3expa 1118 | . . 3 ⊢ (((𝐺 ∈ Abel ∧ 𝑀 ∈ ℤ) ∧ 𝑥 ∈ 𝐵) → (𝑀 · 𝑥) ∈ 𝐵) |
| 9 | 8 | fmpttd 7087 | . 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑀 ∈ ℤ) → (𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥)):𝐵⟶𝐵) |
| 10 | 3anass 1094 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ↔ (𝑀 ∈ ℤ ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵))) | |
| 11 | 1, 5, 2 | mulgdi 19756 | . . . . 5 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑀 · (𝑦(+g‘𝐺)𝑧)) = ((𝑀 · 𝑦)(+g‘𝐺)(𝑀 · 𝑧))) |
| 12 | 10, 11 | sylan2br 595 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵))) → (𝑀 · (𝑦(+g‘𝐺)𝑧)) = ((𝑀 · 𝑦)(+g‘𝐺)(𝑀 · 𝑧))) |
| 13 | 12 | anassrs 467 | . . 3 ⊢ (((𝐺 ∈ Abel ∧ 𝑀 ∈ ℤ) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑀 · (𝑦(+g‘𝐺)𝑧)) = ((𝑀 · 𝑦)(+g‘𝐺)(𝑀 · 𝑧))) |
| 14 | 1, 2 | grpcl 18873 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → (𝑦(+g‘𝐺)𝑧) ∈ 𝐵) |
| 15 | 14 | 3expb 1120 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑦(+g‘𝐺)𝑧) ∈ 𝐵) |
| 16 | 4, 15 | sylan 580 | . . . 4 ⊢ (((𝐺 ∈ Abel ∧ 𝑀 ∈ ℤ) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑦(+g‘𝐺)𝑧) ∈ 𝐵) |
| 17 | oveq2 7395 | . . . . 5 ⊢ (𝑥 = (𝑦(+g‘𝐺)𝑧) → (𝑀 · 𝑥) = (𝑀 · (𝑦(+g‘𝐺)𝑧))) | |
| 18 | eqid 2729 | . . . . 5 ⊢ (𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥)) = (𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥)) | |
| 19 | ovex 7420 | . . . . 5 ⊢ (𝑀 · (𝑦(+g‘𝐺)𝑧)) ∈ V | |
| 20 | 17, 18, 19 | fvmpt 6968 | . . . 4 ⊢ ((𝑦(+g‘𝐺)𝑧) ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘(𝑦(+g‘𝐺)𝑧)) = (𝑀 · (𝑦(+g‘𝐺)𝑧))) |
| 21 | 16, 20 | syl 17 | . . 3 ⊢ (((𝐺 ∈ Abel ∧ 𝑀 ∈ ℤ) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘(𝑦(+g‘𝐺)𝑧)) = (𝑀 · (𝑦(+g‘𝐺)𝑧))) |
| 22 | oveq2 7395 | . . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑀 · 𝑥) = (𝑀 · 𝑦)) | |
| 23 | ovex 7420 | . . . . . 6 ⊢ (𝑀 · 𝑦) ∈ V | |
| 24 | 22, 18, 23 | fvmpt 6968 | . . . . 5 ⊢ (𝑦 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘𝑦) = (𝑀 · 𝑦)) |
| 25 | oveq2 7395 | . . . . . 6 ⊢ (𝑥 = 𝑧 → (𝑀 · 𝑥) = (𝑀 · 𝑧)) | |
| 26 | ovex 7420 | . . . . . 6 ⊢ (𝑀 · 𝑧) ∈ V | |
| 27 | 25, 18, 26 | fvmpt 6968 | . . . . 5 ⊢ (𝑧 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘𝑧) = (𝑀 · 𝑧)) |
| 28 | 24, 27 | oveqan12d 7406 | . . . 4 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → (((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘𝑦)(+g‘𝐺)((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘𝑧)) = ((𝑀 · 𝑦)(+g‘𝐺)(𝑀 · 𝑧))) |
| 29 | 28 | adantl 481 | . . 3 ⊢ (((𝐺 ∈ Abel ∧ 𝑀 ∈ ℤ) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘𝑦)(+g‘𝐺)((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘𝑧)) = ((𝑀 · 𝑦)(+g‘𝐺)(𝑀 · 𝑧))) |
| 30 | 13, 21, 29 | 3eqtr4d 2774 | . 2 ⊢ (((𝐺 ∈ Abel ∧ 𝑀 ∈ ℤ) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘(𝑦(+g‘𝐺)𝑧)) = (((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘𝑦)(+g‘𝐺)((𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥))‘𝑧))) |
| 31 | 1, 1, 2, 2, 4, 4, 9, 30 | isghmd 19157 | 1 ⊢ ((𝐺 ∈ Abel ∧ 𝑀 ∈ ℤ) → (𝑥 ∈ 𝐵 ↦ (𝑀 · 𝑥)) ∈ (𝐺 GrpHom 𝐺)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ↦ cmpt 5188 ‘cfv 6511 (class class class)co 7387 ℤcz 12529 Basecbs 17179 +gcplusg 17220 Grpcgrp 18865 .gcmg 18999 GrpHom cghm 19144 Abelcabl 19711 |
| 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-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-iun 4957 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-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-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-1st 7968 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-er 8671 df-map 8801 df-en 8919 df-dom 8920 df-sdom 8921 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-n0 12443 df-z 12530 df-uz 12794 df-fz 13469 df-fzo 13616 df-seq 13967 df-0g 17404 df-mgm 18567 df-sgrp 18646 df-mnd 18662 df-grp 18868 df-minusg 18869 df-mulg 19000 df-ghm 19145 df-cmn 19712 df-abl 19713 |
| This theorem is referenced by: gsummulglem 19871 |
| Copyright terms: Public domain | W3C validator |