ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ghmmhmb GIF version

Theorem ghmmhmb 13327
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 13326 . . 3 (𝑓 ∈ (𝑆 GrpHom 𝑇) → 𝑓 ∈ (𝑆 MndHom 𝑇))
2 eqid 2193 . . . . 5 (Base‘𝑆) = (Base‘𝑆)
3 eqid 2193 . . . . 5 (Base‘𝑇) = (Base‘𝑇)
4 eqid 2193 . . . . 5 (+g𝑆) = (+g𝑆)
5 eqid 2193 . . . . 5 (+g𝑇) = (+g𝑇)
6 simpll 527 . . . . 5 (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑆 ∈ Grp)
7 simplr 528 . . . . 5 (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑇 ∈ Grp)
82, 3mhmf 13040 . . . . . 6 (𝑓 ∈ (𝑆 MndHom 𝑇) → 𝑓:(Base‘𝑆)⟶(Base‘𝑇))
98adantl 277 . . . . 5 (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑓:(Base‘𝑆)⟶(Base‘𝑇))
102, 4, 5mhmlin 13042 . . . . . . 7 ((𝑓 ∈ (𝑆 MndHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦)))
11103expb 1206 . . . . . 6 ((𝑓 ∈ (𝑆 MndHom 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦)))
1211adantll 476 . . . . 5 ((((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦)))
132, 3, 4, 5, 6, 7, 9, 12isghmd 13325 . . . 4 (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝑓 ∈ (𝑆 MndHom 𝑇)) → 𝑓 ∈ (𝑆 GrpHom 𝑇))
1413ex 115 . . 3 ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑓 ∈ (𝑆 MndHom 𝑇) → 𝑓 ∈ (𝑆 GrpHom 𝑇)))
151, 14impbid2 143 . 2 ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑓 ∈ (𝑆 GrpHom 𝑇) ↔ 𝑓 ∈ (𝑆 MndHom 𝑇)))
1615eqrdv 2191 1 ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑆 GrpHom 𝑇) = (𝑆 MndHom 𝑇))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1364  wcel 2164  wf 5251  cfv 5255  (class class class)co 5919  Basecbs 12621  +gcplusg 12698   MndHom cmhm 13032  Grpcgrp 13075   GrpHom cghm 13313
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-cnex 7965  ax-resscn 7966  ax-1re 7968  ax-addrcl 7971
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-riota 5874  df-ov 5922  df-oprab 5923  df-mpo 5924  df-1st 6195  df-2nd 6196  df-map 6706  df-inn 8985  df-2 9043  df-ndx 12624  df-slot 12625  df-base 12627  df-plusg 12711  df-0g 12872  df-mgm 12942  df-sgrp 12988  df-mnd 13001  df-mhm 13034  df-grp 13078  df-ghm 13314
This theorem is referenced by:  ghmex  13328  0ghm  13331  resghm2  13334  resghm2b  13335  ghmco  13337  ghmpropd  13356
  Copyright terms: Public domain W3C validator