![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > ghmmhmb | GIF version |
Description: Group homomorphisms and monoid homomorphisms coincide. (Thus, GrpHom is somewhat redundant, although its stronger reverse closure properties are sometimes useful.) (Contributed by Stefan O'Rear, 7-Mar-2015.) |
Ref | Expression |
---|---|
ghmmhmb | ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑆 GrpHom 𝑇) = (𝑆 MndHom 𝑇)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ghmmhm 13185 | . . 3 ⊢ (𝑓 ∈ (𝑆 GrpHom 𝑇) → 𝑓 ∈ (𝑆 MndHom 𝑇)) | |
2 | eqid 2189 | . . . . 5 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
3 | eqid 2189 | . . . . 5 ⊢ (Base‘𝑇) = (Base‘𝑇) | |
4 | eqid 2189 | . . . . 5 ⊢ (+g‘𝑆) = (+g‘𝑆) | |
5 | eqid 2189 | . . . . 5 ⊢ (+g‘𝑇) = (+g‘𝑇) | |
6 | simpll 527 | . . . . 5 ⊢ (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑆 ∈ Grp) | |
7 | simplr 528 | . . . . 5 ⊢ (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑇 ∈ Grp) | |
8 | 2, 3 | mhmf 12910 | . . . . . 6 ⊢ (𝑓 ∈ (𝑆 MndHom 𝑇) → 𝑓:(Base‘𝑆)⟶(Base‘𝑇)) |
9 | 8 | adantl 277 | . . . . 5 ⊢ (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑓:(Base‘𝑆)⟶(Base‘𝑇)) |
10 | 2, 4, 5 | mhmlin 12912 | . . . . . . 7 ⊢ ((𝑓 ∈ (𝑆 MndHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝑓‘(𝑥(+g‘𝑆)𝑦)) = ((𝑓‘𝑥)(+g‘𝑇)(𝑓‘𝑦))) |
11 | 10 | 3expb 1206 | . . . . . 6 ⊢ ((𝑓 ∈ (𝑆 MndHom 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝑓‘(𝑥(+g‘𝑆)𝑦)) = ((𝑓‘𝑥)(+g‘𝑇)(𝑓‘𝑦))) |
12 | 11 | adantll 476 | . . . . 5 ⊢ ((((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝑓‘(𝑥(+g‘𝑆)𝑦)) = ((𝑓‘𝑥)(+g‘𝑇)(𝑓‘𝑦))) |
13 | 2, 3, 4, 5, 6, 7, 9, 12 | isghmd 13184 | . . . 4 ⊢ (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑓 ∈ (𝑆 GrpHom 𝑇)) |
14 | 13 | ex 115 | . . 3 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑓 ∈ (𝑆 MndHom 𝑇) → 𝑓 ∈ (𝑆 GrpHom 𝑇))) |
15 | 1, 14 | impbid2 143 | . 2 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑓 ∈ (𝑆 GrpHom 𝑇) ↔ 𝑓 ∈ (𝑆 MndHom 𝑇))) |
16 | 15 | eqrdv 2187 | 1 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑆 GrpHom 𝑇) = (𝑆 MndHom 𝑇)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2160 ⟶wf 5228 ‘cfv 5232 (class class class)co 5892 Basecbs 12507 +gcplusg 12582 MndHom cmhm 12902 Grpcgrp 12938 GrpHom cghm 13172 |
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 4133 ax-sep 4136 ax-pow 4189 ax-pr 4224 ax-un 4448 ax-setind 4551 ax-cnex 7927 ax-resscn 7928 ax-1re 7930 ax-addrcl 7933 |
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 3592 df-sn 3613 df-pr 3614 df-op 3616 df-uni 3825 df-int 3860 df-iun 3903 df-br 4019 df-opab 4080 df-mpt 4081 df-id 4308 df-xp 4647 df-rel 4648 df-cnv 4649 df-co 4650 df-dm 4651 df-rn 4652 df-res 4653 df-ima 4654 df-iota 5193 df-fun 5234 df-fn 5235 df-f 5236 df-f1 5237 df-fo 5238 df-f1o 5239 df-fv 5240 df-riota 5848 df-ov 5895 df-oprab 5896 df-mpo 5897 df-1st 6160 df-2nd 6161 df-map 6671 df-inn 8945 df-2 9003 df-ndx 12510 df-slot 12511 df-base 12513 df-plusg 12595 df-0g 12756 df-mgm 12825 df-sgrp 12858 df-mnd 12871 df-mhm 12904 df-grp 12941 df-ghm 13173 |
This theorem is referenced by: ghmex 13187 0ghm 13190 resghm2 13193 resghm2b 13194 ghmco 13196 ghmpropd 13215 |
Copyright terms: Public domain | W3C validator |