| 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 13459 | . . 3 ⊢ (𝑓 ∈ (𝑆 GrpHom 𝑇) → 𝑓 ∈ (𝑆 MndHom 𝑇)) | |
| 2 | eqid 2196 | . . . . 5 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
| 3 | eqid 2196 | . . . . 5 ⊢ (Base‘𝑇) = (Base‘𝑇) | |
| 4 | eqid 2196 | . . . . 5 ⊢ (+g‘𝑆) = (+g‘𝑆) | |
| 5 | eqid 2196 | . . . . 5 ⊢ (+g‘𝑇) = (+g‘𝑇) | |
| 6 | simpll 527 | . . . . 5 ⊢ (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑆 ∈ Grp) | |
| 7 | simplr 528 | . . . . 5 ⊢ (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑇 ∈ Grp) | |
| 8 | 2, 3 | mhmf 13167 | . . . . . 6 ⊢ (𝑓 ∈ (𝑆 MndHom 𝑇) → 𝑓:(Base‘𝑆)⟶(Base‘𝑇)) |
| 9 | 8 | adantl 277 | . . . . 5 ⊢ (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑓:(Base‘𝑆)⟶(Base‘𝑇)) |
| 10 | 2, 4, 5 | mhmlin 13169 | . . . . . . 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 13458 | . . . 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 2194 | 1 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑆 GrpHom 𝑇) = (𝑆 MndHom 𝑇)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2167 ⟶wf 5255 ‘cfv 5259 (class class class)co 5925 Basecbs 12703 +gcplusg 12780 MndHom cmhm 13159 Grpcgrp 13202 GrpHom cghm 13446 |
| 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 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-coll 4149 ax-sep 4152 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-setind 4574 ax-cnex 7987 ax-resscn 7988 ax-1re 7990 ax-addrcl 7993 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-ral 2480 df-rex 2481 df-reu 2482 df-rmo 2483 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-int 3876 df-iun 3919 df-br 4035 df-opab 4096 df-mpt 4097 df-id 4329 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-res 4676 df-ima 4677 df-iota 5220 df-fun 5261 df-fn 5262 df-f 5263 df-f1 5264 df-fo 5265 df-f1o 5266 df-fv 5267 df-riota 5880 df-ov 5928 df-oprab 5929 df-mpo 5930 df-1st 6207 df-2nd 6208 df-map 6718 df-inn 9008 df-2 9066 df-ndx 12706 df-slot 12707 df-base 12709 df-plusg 12793 df-0g 12960 df-mgm 13058 df-sgrp 13104 df-mnd 13119 df-mhm 13161 df-grp 13205 df-ghm 13447 |
| This theorem is referenced by: ghmex 13461 0ghm 13464 resghm2 13467 resghm2b 13468 ghmco 13470 ghmpropd 13489 |
| Copyright terms: Public domain | W3C validator |