| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ghmmhmb | Structured version Visualization version 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 19492 | . . 3 ⊢ (𝑓 ∈ (𝑆 GrpHom 𝑇) → 𝑓 ∈ (𝑆 MndHom 𝑇)) | |
| 2 | eqid 2766 | . . . . 5 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
| 3 | eqid 2766 | . . . . 5 ⊢ (Base‘𝑇) = (Base‘𝑇) | |
| 4 | eqid 2766 | . . . . 5 ⊢ (+g‘𝑆) = (+g‘𝑆) | |
| 5 | eqid 2766 | . . . . 5 ⊢ (+g‘𝑇) = (+g‘𝑇) | |
| 6 | simpll 779 | . . . . 5 ⊢ (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑆 ∈ Grp) | |
| 7 | simplr 781 | . . . . 5 ⊢ (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑇 ∈ Grp) | |
| 8 | 2, 3 | mhmf 19036 | . . . . . 6 ⊢ (𝑓 ∈ (𝑆 MndHom 𝑇) → 𝑓:(Base‘𝑆)⟶(Base‘𝑇)) |
| 9 | 8 | adantl 487 | . . . . 5 ⊢ (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑓:(Base‘𝑆)⟶(Base‘𝑇)) |
| 10 | 2, 4, 5 | mhmlin 19040 | . . . . . . 7 ⊢ ((𝑓 ∈ (𝑆 MndHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝑓‘(𝑥(+g‘𝑆)𝑦)) = ((𝑓‘𝑥)(+g‘𝑇)(𝑓‘𝑦))) |
| 11 | 10 | 3expb 1139 | . . . . . 6 ⊢ ((𝑓 ∈ (𝑆 MndHom 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝑓‘(𝑥(+g‘𝑆)𝑦)) = ((𝑓‘𝑥)(+g‘𝑇)(𝑓‘𝑦))) |
| 12 | 11 | adantll 727 | . . . . 5 ⊢ ((((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝑓‘(𝑥(+g‘𝑆)𝑦)) = ((𝑓‘𝑥)(+g‘𝑇)(𝑓‘𝑦))) |
| 13 | 2, 3, 4, 5, 6, 7, 9, 12 | isghmd 19491 | . . . 4 ⊢ (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑓 ∈ (𝑆 GrpHom 𝑇)) |
| 14 | 13 | ex 418 | . . 3 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑓 ∈ (𝑆 MndHom 𝑇) → 𝑓 ∈ (𝑆 GrpHom 𝑇))) |
| 15 | 1, 14 | impbid2 229 | . 2 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑓 ∈ (𝑆 GrpHom 𝑇) ↔ 𝑓 ∈ (𝑆 MndHom 𝑇))) |
| 16 | 15 | eqrdv 2764 | 1 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑆 GrpHom 𝑇) = (𝑆 MndHom 𝑇)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1572 ∈ wcel 2150 ⟶wf 6561 ‘cfv 6565 (class class class)co 7450 Basecbs 17433 +gcplusg 17474 MndHom cmhm 19028 Grpcgrp 19196 GrpHom cghm 19479 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-ral 3084 df-rex 3094 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-id 5552 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-1st 8034 df-2nd 8035 df-map 8886 df-0g 17664 df-mgm 18868 df-sgrp 18960 df-mnd 18976 df-mhm 19030 df-grp 19199 df-ghm 19480 |
| This theorem is used by: 0ghm 19496 resghm2 19499 resghm2b 19500 ghmco 19502 pwsdiagghm 19510 ghmpropd 19522 c0ghm 20744 c0snghm 20747 pwsco1rhm 20794 pwsco2rhm 20795 dchrghm 27642 |
| Copyright terms: Public domain | W3C validator |