| 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 19354 | . . 3 ⊢ (𝑓 ∈ (𝑆 GrpHom 𝑇) → 𝑓 ∈ (𝑆 MndHom 𝑇)) | |
| 2 | eqid 2762 | . . . . 5 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
| 3 | eqid 2762 | . . . . 5 ⊢ (Base‘𝑇) = (Base‘𝑇) | |
| 4 | eqid 2762 | . . . . 5 ⊢ (+g‘𝑆) = (+g‘𝑆) | |
| 5 | eqid 2762 | . . . . 5 ⊢ (+g‘𝑇) = (+g‘𝑇) | |
| 6 | simpll 779 | . . . . 5 ⊢ (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑆 ∈ Grp) | |
| 7 | simplr 781 | . . . . 5 ⊢ (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑇 ∈ Grp) | |
| 8 | 2, 3 | mhmf 18898 | . . . . . 6 ⊢ (𝑓 ∈ (𝑆 MndHom 𝑇) → 𝑓:(Base‘𝑆)⟶(Base‘𝑇)) |
| 9 | 8 | adantl 487 | . . . . 5 ⊢ (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑓:(Base‘𝑆)⟶(Base‘𝑇)) |
| 10 | 2, 4, 5 | mhmlin 18902 | . . . . . . 7 ⊢ ((𝑓 ∈ (𝑆 MndHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝑓‘(𝑥(+g‘𝑆)𝑦)) = ((𝑓‘𝑥)(+g‘𝑇)(𝑓‘𝑦))) |
| 11 | 10 | 3expb 1138 | . . . . . 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 19353 | . . . 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 2760 | 1 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑆 GrpHom 𝑇) = (𝑆 MndHom 𝑇)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ⟶wf 6533 ‘cfv 6537 (class class class)co 7416 Basecbs 17305 +gcplusg 17346 MndHom cmhm 18890 Grpcgrp 19058 GrpHom cghm 19341 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fv 6545 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-1st 7989 df-2nd 7990 df-map 8831 df-0g 17530 df-mgm 18734 df-sgrp 18823 df-mnd 18839 df-mhm 18892 df-grp 19061 df-ghm 19342 |
| This theorem is used by: 0ghm 19358 resghm2 19361 resghm2b 19362 ghmco 19364 pwsdiagghm 19372 ghmpropd 19384 c0ghm 20603 c0snghm 20606 pwsco1rhm 20653 pwsco2rhm 20654 dchrghm 27490 |
| Copyright terms: Public domain | W3C validator |