![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > ghmmhm | GIF version |
Description: A group homomorphism is a monoid homomorphism. (Contributed by Stefan O'Rear, 7-Mar-2015.) |
Ref | Expression |
---|---|
ghmmhm | ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹 ∈ (𝑆 MndHom 𝑇)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ghmgrp1 13209 | . . 3 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp) | |
2 | 1 | grpmndd 12981 | . 2 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Mnd) |
3 | ghmgrp2 13210 | . . 3 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Grp) | |
4 | 3 | grpmndd 12981 | . 2 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Mnd) |
5 | eqid 2189 | . . . 4 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
6 | eqid 2189 | . . . 4 ⊢ (Base‘𝑇) = (Base‘𝑇) | |
7 | 5, 6 | ghmf 13211 | . . 3 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇)) |
8 | eqid 2189 | . . . . . 6 ⊢ (+g‘𝑆) = (+g‘𝑆) | |
9 | eqid 2189 | . . . . . 6 ⊢ (+g‘𝑇) = (+g‘𝑇) | |
10 | 5, 8, 9 | ghmlin 13212 | . . . . 5 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦))) |
11 | 10 | 3expb 1206 | . . . 4 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦))) |
12 | 11 | ralrimivva 2572 | . . 3 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦))) |
13 | eqid 2189 | . . . 4 ⊢ (0g‘𝑆) = (0g‘𝑆) | |
14 | eqid 2189 | . . . 4 ⊢ (0g‘𝑇) = (0g‘𝑇) | |
15 | 13, 14 | ghmid 13213 | . . 3 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(0g‘𝑆)) = (0g‘𝑇)) |
16 | 7, 12, 15 | 3jca 1179 | . 2 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹:(Base‘𝑆)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)) ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) |
17 | 5, 6, 8, 9, 13, 14 | ismhm 12936 | . 2 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝐹:(Base‘𝑆)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)) ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇)))) |
18 | 2, 4, 16, 17 | syl21anbrc 1184 | 1 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹 ∈ (𝑆 MndHom 𝑇)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ w3a 980 = wceq 1364 ∈ wcel 2160 ∀wral 2468 ⟶wf 5234 ‘cfv 5238 (class class class)co 5900 Basecbs 12523 +gcplusg 12600 0gc0g 12772 Mndcmnd 12900 MndHom cmhm 12932 GrpHom cghm 13204 |
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 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2162 ax-14 2163 ax-ext 2171 ax-coll 4136 ax-sep 4139 ax-pow 4195 ax-pr 4230 ax-un 4454 ax-setind 4557 ax-cnex 7937 ax-resscn 7938 ax-1re 7940 ax-addrcl 7943 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ne 2361 df-ral 2473 df-rex 2474 df-reu 2475 df-rmo 2476 df-rab 2477 df-v 2754 df-sbc 2978 df-csb 3073 df-dif 3146 df-un 3148 df-in 3150 df-ss 3157 df-pw 3595 df-sn 3616 df-pr 3617 df-op 3619 df-uni 3828 df-int 3863 df-iun 3906 df-br 4022 df-opab 4083 df-mpt 4084 df-id 4314 df-xp 4653 df-rel 4654 df-cnv 4655 df-co 4656 df-dm 4657 df-rn 4658 df-res 4659 df-ima 4660 df-iota 5199 df-fun 5240 df-fn 5241 df-f 5242 df-f1 5243 df-fo 5244 df-f1o 5245 df-fv 5246 df-riota 5855 df-ov 5903 df-oprab 5904 df-mpo 5905 df-1st 6169 df-2nd 6170 df-map 6680 df-inn 8955 df-2 9013 df-ndx 12526 df-slot 12527 df-base 12529 df-plusg 12613 df-0g 12774 df-mgm 12843 df-sgrp 12888 df-mnd 12901 df-mhm 12934 df-grp 12971 df-ghm 13205 |
This theorem is referenced by: ghmmhmb 13218 ghmmulg 13220 resghm2 13225 ghmco 13228 ghmeql 13231 |
Copyright terms: Public domain | W3C validator |