| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mulgghm2 | Structured version Visualization version GIF version | ||
| Description: The powers of a group element give a homomorphism from ℤ to a group. The name 1 should not be taken as a constraint as it may be any group element. (Contributed by Mario Carneiro, 13-Jun-2015.) (Revised by AV, 12-Jun-2019.) |
| Ref | Expression |
|---|---|
| mulgghm2.m | ⊢ · = (.g‘𝑅) |
| mulgghm2.f | ⊢ 𝐹 = (𝑛 ∈ ℤ ↦ (𝑛 · 1 )) |
| mulgghm2.b | ⊢ 𝐵 = (Base‘𝑅) |
| Ref | Expression |
|---|---|
| mulgghm2 | ⊢ ((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) → 𝐹 ∈ (ℤring GrpHom 𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 488 | . . 3 ⊢ ((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) → 𝑅 ∈ Grp) | |
| 2 | zringgrp 21758 | . . 3 ⊢ ℤring ∈ Grp | |
| 3 | 1, 2 | jctil 529 | . 2 ⊢ ((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) → (ℤring ∈ Grp ∧ 𝑅 ∈ Grp)) |
| 4 | mulgghm2.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑅) | |
| 5 | mulgghm2.m | . . . . . . 7 ⊢ · = (.g‘𝑅) | |
| 6 | 4, 5 | mulgcl 19301 | . . . . . 6 ⊢ ((𝑅 ∈ Grp ∧ 𝑛 ∈ ℤ ∧ 1 ∈ 𝐵) → (𝑛 · 1 ) ∈ 𝐵) |
| 7 | 6 | 3expa 1136 | . . . . 5 ⊢ (((𝑅 ∈ Grp ∧ 𝑛 ∈ ℤ) ∧ 1 ∈ 𝐵) → (𝑛 · 1 ) ∈ 𝐵) |
| 8 | 7 | an32s 665 | . . . 4 ⊢ (((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) ∧ 𝑛 ∈ ℤ) → (𝑛 · 1 ) ∈ 𝐵) |
| 9 | mulgghm2.f | . . . 4 ⊢ 𝐹 = (𝑛 ∈ ℤ ↦ (𝑛 · 1 )) | |
| 10 | 8, 9 | fmptd 7114 | . . 3 ⊢ ((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) → 𝐹:ℤ⟶𝐵) |
| 11 | eqid 2761 | . . . . . . . . 9 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 12 | 4, 5, 11 | mulgdir 19316 | . . . . . . . 8 ⊢ ((𝑅 ∈ Grp ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ ∧ 1 ∈ 𝐵)) → ((𝑥 + 𝑦) · 1 ) = ((𝑥 · 1 )(+g‘𝑅)(𝑦 · 1 ))) |
| 13 | 12 | 3exp2 1373 | . . . . . . 7 ⊢ (𝑅 ∈ Grp → (𝑥 ∈ ℤ → (𝑦 ∈ ℤ → ( 1 ∈ 𝐵 → ((𝑥 + 𝑦) · 1 ) = ((𝑥 · 1 )(+g‘𝑅)(𝑦 · 1 )))))) |
| 14 | 13 | imp42 432 | . . . . . 6 ⊢ (((𝑅 ∈ Grp ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) ∧ 1 ∈ 𝐵) → ((𝑥 + 𝑦) · 1 ) = ((𝑥 · 1 )(+g‘𝑅)(𝑦 · 1 ))) |
| 15 | 14 | an32s 665 | . . . . 5 ⊢ (((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → ((𝑥 + 𝑦) · 1 ) = ((𝑥 · 1 )(+g‘𝑅)(𝑦 · 1 ))) |
| 16 | zaddcl 12736 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝑥 + 𝑦) ∈ ℤ) | |
| 17 | 16 | adantl 487 | . . . . . 6 ⊢ (((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (𝑥 + 𝑦) ∈ ℤ) |
| 18 | oveq1 7427 | . . . . . . 7 ⊢ (𝑛 = (𝑥 + 𝑦) → (𝑛 · 1 ) = ((𝑥 + 𝑦) · 1 )) | |
| 19 | ovex 7453 | . . . . . . 7 ⊢ ((𝑥 + 𝑦) · 1 ) ∈ V | |
| 20 | 18, 9, 19 | fvmpt 6993 | . . . . . 6 ⊢ ((𝑥 + 𝑦) ∈ ℤ → (𝐹‘(𝑥 + 𝑦)) = ((𝑥 + 𝑦) · 1 )) |
| 21 | 17, 20 | syl 18 | . . . . 5 ⊢ (((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (𝐹‘(𝑥 + 𝑦)) = ((𝑥 + 𝑦) · 1 )) |
| 22 | oveq1 7427 | . . . . . . . 8 ⊢ (𝑛 = 𝑥 → (𝑛 · 1 ) = (𝑥 · 1 )) | |
| 23 | ovex 7453 | . . . . . . . 8 ⊢ (𝑥 · 1 ) ∈ V | |
| 24 | 22, 9, 23 | fvmpt 6993 | . . . . . . 7 ⊢ (𝑥 ∈ ℤ → (𝐹‘𝑥) = (𝑥 · 1 )) |
| 25 | oveq1 7427 | . . . . . . . 8 ⊢ (𝑛 = 𝑦 → (𝑛 · 1 ) = (𝑦 · 1 )) | |
| 26 | ovex 7453 | . . . . . . . 8 ⊢ (𝑦 · 1 ) ∈ V | |
| 27 | 25, 9, 26 | fvmpt 6993 | . . . . . . 7 ⊢ (𝑦 ∈ ℤ → (𝐹‘𝑦) = (𝑦 · 1 )) |
| 28 | 24, 27 | oveqan12d 7439 | . . . . . 6 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → ((𝐹‘𝑥)(+g‘𝑅)(𝐹‘𝑦)) = ((𝑥 · 1 )(+g‘𝑅)(𝑦 · 1 ))) |
| 29 | 28 | adantl 487 | . . . . 5 ⊢ (((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → ((𝐹‘𝑥)(+g‘𝑅)(𝐹‘𝑦)) = ((𝑥 · 1 )(+g‘𝑅)(𝑦 · 1 ))) |
| 30 | 15, 21, 29 | 3eqtr4d 2806 | . . . 4 ⊢ (((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥)(+g‘𝑅)(𝐹‘𝑦))) |
| 31 | 30 | ralrimivva 3206 | . . 3 ⊢ ((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) → ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℤ (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥)(+g‘𝑅)(𝐹‘𝑦))) |
| 32 | 10, 31 | jca 521 | . 2 ⊢ ((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) → (𝐹:ℤ⟶𝐵 ∧ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℤ (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥)(+g‘𝑅)(𝐹‘𝑦)))) |
| 33 | zringbas 21759 | . . 3 ⊢ ℤ = (Base‘ℤring) | |
| 34 | zringplusg 21760 | . . 3 ⊢ + = (+g‘ℤring) | |
| 35 | 33, 4, 34, 11 | isghm 19430 | . 2 ⊢ (𝐹 ∈ (ℤring GrpHom 𝑅) ↔ ((ℤring ∈ Grp ∧ 𝑅 ∈ Grp) ∧ (𝐹:ℤ⟶𝐵 ∧ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℤ (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥)(+g‘𝑅)(𝐹‘𝑦))))) |
| 36 | 3, 32, 35 | sylanbrc 595 | 1 ⊢ ((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) → 𝐹 ∈ (ℤring GrpHom 𝑅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3077 ↦ cmpt 5186 ⟶wf 6534 ‘cfv 6538 (class class class)co 7420 + caddc 11203 ℤcz 12693 Basecbs 17387 +gcplusg 17428 Grpcgrp 19144 .gcmg 19277 GrpHom cghm 19427 ℤringczring 21752 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 ax-addf 11279 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-er 8717 df-map 8849 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-nn 12336 df-2 12405 df-3 12406 df-4 12407 df-5 12408 df-6 12409 df-7 12410 df-8 12411 df-9 12412 df-n0 12607 df-z 12694 df-dec 12815 df-uz 12966 df-fz 13640 df-seq 14145 df-struct 17325 df-sets 17342 df-slot 17360 df-ndx 17372 df-base 17388 df-ress 17409 df-plusg 17441 df-mulr 17442 df-starv 17443 df-tset 17447 df-ple 17448 df-ds 17450 df-unif 17451 df-0g 17612 df-mgm 18816 df-sgrp 18908 df-mnd 18924 df-grp 19147 df-minusg 19148 df-mulg 19278 df-subg 19333 df-ghm 19428 df-cmn 19996 df-abl 19997 df-mgp 20361 df-rng 20375 df-ur 20408 df-ring 20461 df-cring 20462 df-subrng 20798 df-subrg 20822 df-cnfld 21679 df-zring 21753 |
| This theorem is used by: mulgrhm 21783 frgpcyg 21879 gsummulgc2 33627 |
| Copyright terms: Public domain | W3C validator |