| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mulgghm2 | 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 109 | . . 3 ⊢ ((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) → 𝑅 ∈ Grp) | |
| 2 | zringgrp 14432 | . . 3 ⊢ ℤring ∈ Grp | |
| 3 | 1, 2 | jctil 312 | . 2 ⊢ ((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) → (ℤring ∈ Grp ∧ 𝑅 ∈ Grp)) |
| 4 | mulgghm2.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑅) | |
| 5 | mulgghm2.m | . . . . . . 7 ⊢ · = (.g‘𝑅) | |
| 6 | 4, 5 | mulgcl 13550 | . . . . . 6 ⊢ ((𝑅 ∈ Grp ∧ 𝑛 ∈ ℤ ∧ 1 ∈ 𝐵) → (𝑛 · 1 ) ∈ 𝐵) |
| 7 | 6 | 3expa 1206 | . . . . 5 ⊢ (((𝑅 ∈ Grp ∧ 𝑛 ∈ ℤ) ∧ 1 ∈ 𝐵) → (𝑛 · 1 ) ∈ 𝐵) |
| 8 | 7 | an32s 568 | . . . 4 ⊢ (((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) ∧ 𝑛 ∈ ℤ) → (𝑛 · 1 ) ∈ 𝐵) |
| 9 | mulgghm2.f | . . . 4 ⊢ 𝐹 = (𝑛 ∈ ℤ ↦ (𝑛 · 1 )) | |
| 10 | 8, 9 | fmptd 5747 | . . 3 ⊢ ((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) → 𝐹:ℤ⟶𝐵) |
| 11 | eqid 2206 | . . . . . . . . 9 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 12 | 4, 5, 11 | mulgdir 13565 | . . . . . . . 8 ⊢ ((𝑅 ∈ Grp ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ ∧ 1 ∈ 𝐵)) → ((𝑥 + 𝑦) · 1 ) = ((𝑥 · 1 )(+g‘𝑅)(𝑦 · 1 ))) |
| 13 | 12 | 3exp2 1228 | . . . . . . 7 ⊢ (𝑅 ∈ Grp → (𝑥 ∈ ℤ → (𝑦 ∈ ℤ → ( 1 ∈ 𝐵 → ((𝑥 + 𝑦) · 1 ) = ((𝑥 · 1 )(+g‘𝑅)(𝑦 · 1 )))))) |
| 14 | 13 | imp42 354 | . . . . . 6 ⊢ (((𝑅 ∈ Grp ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) ∧ 1 ∈ 𝐵) → ((𝑥 + 𝑦) · 1 ) = ((𝑥 · 1 )(+g‘𝑅)(𝑦 · 1 ))) |
| 15 | 14 | an32s 568 | . . . . 5 ⊢ (((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → ((𝑥 + 𝑦) · 1 ) = ((𝑥 · 1 )(+g‘𝑅)(𝑦 · 1 ))) |
| 16 | oveq1 5964 | . . . . . 6 ⊢ (𝑛 = (𝑥 + 𝑦) → (𝑛 · 1 ) = ((𝑥 + 𝑦) · 1 )) | |
| 17 | zaddcl 9432 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝑥 + 𝑦) ∈ ℤ) | |
| 18 | 17 | adantl 277 | . . . . . 6 ⊢ (((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (𝑥 + 𝑦) ∈ ℤ) |
| 19 | simpll 527 | . . . . . . 7 ⊢ (((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → 𝑅 ∈ Grp) | |
| 20 | simplr 528 | . . . . . . 7 ⊢ (((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → 1 ∈ 𝐵) | |
| 21 | 4, 5, 19, 18, 20 | mulgcld 13555 | . . . . . 6 ⊢ (((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → ((𝑥 + 𝑦) · 1 ) ∈ 𝐵) |
| 22 | 9, 16, 18, 21 | fvmptd3 5686 | . . . . 5 ⊢ (((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (𝐹‘(𝑥 + 𝑦)) = ((𝑥 + 𝑦) · 1 )) |
| 23 | oveq1 5964 | . . . . . . 7 ⊢ (𝑛 = 𝑥 → (𝑛 · 1 ) = (𝑥 · 1 )) | |
| 24 | simprl 529 | . . . . . . 7 ⊢ (((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → 𝑥 ∈ ℤ) | |
| 25 | 4, 5, 19, 24, 20 | mulgcld 13555 | . . . . . . 7 ⊢ (((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (𝑥 · 1 ) ∈ 𝐵) |
| 26 | 9, 23, 24, 25 | fvmptd3 5686 | . . . . . 6 ⊢ (((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (𝐹‘𝑥) = (𝑥 · 1 )) |
| 27 | oveq1 5964 | . . . . . . 7 ⊢ (𝑛 = 𝑦 → (𝑛 · 1 ) = (𝑦 · 1 )) | |
| 28 | simprr 531 | . . . . . . 7 ⊢ (((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → 𝑦 ∈ ℤ) | |
| 29 | 4, 5, 19, 28, 20 | mulgcld 13555 | . . . . . . 7 ⊢ (((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (𝑦 · 1 ) ∈ 𝐵) |
| 30 | 9, 27, 28, 29 | fvmptd3 5686 | . . . . . 6 ⊢ (((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (𝐹‘𝑦) = (𝑦 · 1 )) |
| 31 | 26, 30 | oveq12d 5975 | . . . . 5 ⊢ (((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → ((𝐹‘𝑥)(+g‘𝑅)(𝐹‘𝑦)) = ((𝑥 · 1 )(+g‘𝑅)(𝑦 · 1 ))) |
| 32 | 15, 22, 31 | 3eqtr4d 2249 | . . . 4 ⊢ (((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥)(+g‘𝑅)(𝐹‘𝑦))) |
| 33 | 32 | ralrimivva 2589 | . . 3 ⊢ ((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) → ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℤ (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥)(+g‘𝑅)(𝐹‘𝑦))) |
| 34 | 10, 33 | jca 306 | . 2 ⊢ ((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) → (𝐹:ℤ⟶𝐵 ∧ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℤ (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥)(+g‘𝑅)(𝐹‘𝑦)))) |
| 35 | zringbas 14433 | . . 3 ⊢ ℤ = (Base‘ℤring) | |
| 36 | zringplusg 14434 | . . 3 ⊢ + = (+g‘ℤring) | |
| 37 | 35, 4, 36, 11 | isghm 13654 | . 2 ⊢ (𝐹 ∈ (ℤring GrpHom 𝑅) ↔ ((ℤring ∈ Grp ∧ 𝑅 ∈ Grp) ∧ (𝐹:ℤ⟶𝐵 ∧ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℤ (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥)(+g‘𝑅)(𝐹‘𝑦))))) |
| 38 | 3, 34, 37 | sylanbrc 417 | 1 ⊢ ((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) → 𝐹 ∈ (ℤring GrpHom 𝑅)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1373 ∈ wcel 2177 ∀wral 2485 ↦ cmpt 4113 ⟶wf 5276 ‘cfv 5280 (class class class)co 5957 + caddc 7948 ℤcz 9392 Basecbs 12907 +gcplusg 12984 Grpcgrp 13407 .gcmg 13530 GrpHom cghm 13651 ℤringczring 14427 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-coll 4167 ax-sep 4170 ax-nul 4178 ax-pow 4226 ax-pr 4261 ax-un 4488 ax-setind 4593 ax-iinf 4644 ax-cnex 8036 ax-resscn 8037 ax-1cn 8038 ax-1re 8039 ax-icn 8040 ax-addcl 8041 ax-addrcl 8042 ax-mulcl 8043 ax-mulrcl 8044 ax-addcom 8045 ax-mulcom 8046 ax-addass 8047 ax-mulass 8048 ax-distr 8049 ax-i2m1 8050 ax-0lt1 8051 ax-1rid 8052 ax-0id 8053 ax-rnegex 8054 ax-precex 8055 ax-cnre 8056 ax-pre-ltirr 8057 ax-pre-ltwlin 8058 ax-pre-lttrn 8059 ax-pre-apti 8060 ax-pre-ltadd 8061 ax-pre-mulgt0 8062 ax-addf 8067 ax-mulf 8068 |
| This theorem depends on definitions: df-bi 117 df-dc 837 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-nel 2473 df-ral 2490 df-rex 2491 df-reu 2492 df-rmo 2493 df-rab 2494 df-v 2775 df-sbc 3003 df-csb 3098 df-dif 3172 df-un 3174 df-in 3176 df-ss 3183 df-nul 3465 df-if 3576 df-pw 3623 df-sn 3644 df-pr 3645 df-tp 3646 df-op 3647 df-uni 3857 df-int 3892 df-iun 3935 df-br 4052 df-opab 4114 df-mpt 4115 df-tr 4151 df-id 4348 df-iord 4421 df-on 4423 df-ilim 4424 df-suc 4426 df-iom 4647 df-xp 4689 df-rel 4690 df-cnv 4691 df-co 4692 df-dm 4693 df-rn 4694 df-res 4695 df-ima 4696 df-iota 5241 df-fun 5282 df-fn 5283 df-f 5284 df-f1 5285 df-fo 5286 df-f1o 5287 df-fv 5288 df-riota 5912 df-ov 5960 df-oprab 5961 df-mpo 5962 df-1st 6239 df-2nd 6240 df-recs 6404 df-frec 6490 df-pnf 8129 df-mnf 8130 df-xr 8131 df-ltxr 8132 df-le 8133 df-sub 8265 df-neg 8266 df-reap 8668 df-inn 9057 df-2 9115 df-3 9116 df-4 9117 df-5 9118 df-6 9119 df-7 9120 df-8 9121 df-9 9122 df-n0 9316 df-z 9393 df-dec 9525 df-uz 9669 df-rp 9796 df-fz 10151 df-seqfrec 10615 df-cj 11228 df-abs 11385 df-struct 12909 df-ndx 12910 df-slot 12911 df-base 12913 df-sets 12914 df-iress 12915 df-plusg 12997 df-mulr 12998 df-starv 12999 df-tset 13003 df-ple 13004 df-ds 13006 df-unif 13007 df-0g 13165 df-topgen 13167 df-mgm 13263 df-sgrp 13309 df-mnd 13324 df-grp 13410 df-minusg 13411 df-mulg 13531 df-subg 13581 df-ghm 13652 df-cmn 13697 df-mgp 13758 df-ur 13797 df-ring 13835 df-cring 13836 df-subrg 14056 df-bl 14383 df-mopn 14384 df-fg 14386 df-metu 14387 df-cnfld 14394 df-zring 14428 |
| This theorem is referenced by: mulgrhm 14446 |
| Copyright terms: Public domain | W3C validator |