| 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 13622 | . . 3 ⊢ (𝑓 ∈ (𝑆 GrpHom 𝑇) → 𝑓 ∈ (𝑆 MndHom 𝑇)) | |
| 2 | eqid 2205 | . . . . 5 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
| 3 | eqid 2205 | . . . . 5 ⊢ (Base‘𝑇) = (Base‘𝑇) | |
| 4 | eqid 2205 | . . . . 5 ⊢ (+g‘𝑆) = (+g‘𝑆) | |
| 5 | eqid 2205 | . . . . 5 ⊢ (+g‘𝑇) = (+g‘𝑇) | |
| 6 | simpll 527 | . . . . 5 ⊢ (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑆 ∈ Grp) | |
| 7 | simplr 528 | . . . . 5 ⊢ (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑇 ∈ Grp) | |
| 8 | 2, 3 | mhmf 13330 | . . . . . 6 ⊢ (𝑓 ∈ (𝑆 MndHom 𝑇) → 𝑓:(Base‘𝑆)⟶(Base‘𝑇)) |
| 9 | 8 | adantl 277 | . . . . 5 ⊢ (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑓:(Base‘𝑆)⟶(Base‘𝑇)) |
| 10 | 2, 4, 5 | mhmlin 13332 | . . . . . . 7 ⊢ ((𝑓 ∈ (𝑆 MndHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝑓‘(𝑥(+g‘𝑆)𝑦)) = ((𝑓‘𝑥)(+g‘𝑇)(𝑓‘𝑦))) |
| 11 | 10 | 3expb 1207 | . . . . . 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 13621 | . . . 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 2203 | 1 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑆 GrpHom 𝑇) = (𝑆 MndHom 𝑇)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1373 ∈ wcel 2176 ⟶wf 5268 ‘cfv 5272 (class class class)co 5946 Basecbs 12865 +gcplusg 12942 MndHom cmhm 13322 Grpcgrp 13365 GrpHom cghm 13609 |
| 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 711 ax-5 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-8 1527 ax-10 1528 ax-11 1529 ax-i12 1530 ax-bndl 1532 ax-4 1533 ax-17 1549 ax-i9 1553 ax-ial 1557 ax-i5r 1558 ax-13 2178 ax-14 2179 ax-ext 2187 ax-coll 4160 ax-sep 4163 ax-pow 4219 ax-pr 4254 ax-un 4481 ax-setind 4586 ax-cnex 8018 ax-resscn 8019 ax-1re 8021 ax-addrcl 8024 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1484 df-sb 1786 df-eu 2057 df-mo 2058 df-clab 2192 df-cleq 2198 df-clel 2201 df-nfc 2337 df-ne 2377 df-ral 2489 df-rex 2490 df-reu 2491 df-rmo 2492 df-rab 2493 df-v 2774 df-sbc 2999 df-csb 3094 df-dif 3168 df-un 3170 df-in 3172 df-ss 3179 df-pw 3618 df-sn 3639 df-pr 3640 df-op 3642 df-uni 3851 df-int 3886 df-iun 3929 df-br 4046 df-opab 4107 df-mpt 4108 df-id 4341 df-xp 4682 df-rel 4683 df-cnv 4684 df-co 4685 df-dm 4686 df-rn 4687 df-res 4688 df-ima 4689 df-iota 5233 df-fun 5274 df-fn 5275 df-f 5276 df-f1 5277 df-fo 5278 df-f1o 5279 df-fv 5280 df-riota 5901 df-ov 5949 df-oprab 5950 df-mpo 5951 df-1st 6228 df-2nd 6229 df-map 6739 df-inn 9039 df-2 9097 df-ndx 12868 df-slot 12869 df-base 12871 df-plusg 12955 df-0g 13123 df-mgm 13221 df-sgrp 13267 df-mnd 13282 df-mhm 13324 df-grp 13368 df-ghm 13610 |
| This theorem is referenced by: ghmex 13624 0ghm 13627 resghm2 13630 resghm2b 13631 ghmco 13633 ghmpropd 13652 |
| Copyright terms: Public domain | W3C validator |