MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ghmmhmb Structured version   Visualization version   GIF version

Theorem ghmmhmb 17494
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.)
Assertion
Ref Expression
ghmmhmb ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑆 GrpHom 𝑇) = (𝑆 MndHom 𝑇))

Proof of Theorem ghmmhmb
Dummy variables 𝑥 𝑦 𝑓 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ghmmhm 17493 . . 3 (𝑓 ∈ (𝑆 GrpHom 𝑇) → 𝑓 ∈ (𝑆 MndHom 𝑇))
2 eqid 2610 . . . . 5 (Base‘𝑆) = (Base‘𝑆)
3 eqid 2610 . . . . 5 (Base‘𝑇) = (Base‘𝑇)
4 eqid 2610 . . . . 5 (+g𝑆) = (+g𝑆)
5 eqid 2610 . . . . 5 (+g𝑇) = (+g𝑇)
6 simpll 786 . . . . 5 (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑆 ∈ Grp)
7 simplr 788 . . . . 5 (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑇 ∈ Grp)
82, 3mhmf 17163 . . . . . 6 (𝑓 ∈ (𝑆 MndHom 𝑇) → 𝑓:(Base‘𝑆)⟶(Base‘𝑇))
98adantl 481 . . . . 5 (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑓:(Base‘𝑆)⟶(Base‘𝑇))
102, 4, 5mhmlin 17165 . . . . . . 7 ((𝑓 ∈ (𝑆 MndHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦)))
11103expb 1258 . . . . . 6 ((𝑓 ∈ (𝑆 MndHom 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦)))
1211adantll 746 . . . . 5 ((((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦)))
132, 3, 4, 5, 6, 7, 9, 12isghmd 17492 . . . 4 (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑓 ∈ (𝑆 GrpHom 𝑇))
1413ex 449 . . 3 ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑓 ∈ (𝑆 MndHom 𝑇) → 𝑓 ∈ (𝑆 GrpHom 𝑇)))
151, 14impbid2 215 . 2 ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑓 ∈ (𝑆 GrpHom 𝑇) ↔ 𝑓 ∈ (𝑆 MndHom 𝑇)))
1615eqrdv 2608 1 ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑆 GrpHom 𝑇) = (𝑆 MndHom 𝑇))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1475  wcel 1977  wf 5800  cfv 5804  (class class class)co 6549  Basecbs 15695  +gcplusg 15768   MndHom cmhm 17156  Grpcgrp 17245   GrpHom cghm 17480
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-map 7746  df-0g 15925  df-mgm 17065  df-sgrp 17107  df-mnd 17118  df-mhm 17158  df-grp 17248  df-ghm 17481
This theorem is referenced by:  0ghm  17497  resghm2  17500  resghm2b  17501  ghmco  17503  pwsdiagghm  17511  ghmpropd  17521  pwsco1rhm  18561  pwsco2rhm  18562  dchrghm  24781  c0ghm  41701  c0snghm  41706
  Copyright terms: Public domain W3C validator