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

Theorem ghmmhm 13785
Description: A group homomorphism is a monoid homomorphism. (Contributed by Stefan O'Rear, 7-Mar-2015.)
Assertion
Ref Expression
ghmmhm (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹 ∈ (𝑆 MndHom 𝑇))

Proof of Theorem ghmmhm
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ghmgrp1 13777 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp)
21grpmndd 13541 . 2 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Mnd)
3 ghmgrp2 13778 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Grp)
43grpmndd 13541 . 2 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Mnd)
5 eqid 2229 . . . 4 (Base‘𝑆) = (Base‘𝑆)
6 eqid 2229 . . . 4 (Base‘𝑇) = (Base‘𝑇)
75, 6ghmf 13779 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
8 eqid 2229 . . . . . 6 (+g𝑆) = (+g𝑆)
9 eqid 2229 . . . . . 6 (+g𝑇) = (+g𝑇)
105, 8, 9ghmlin 13780 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
11103expb 1228 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
1211ralrimivva 2612 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
13 eqid 2229 . . . 4 (0g𝑆) = (0g𝑆)
14 eqid 2229 . . . 4 (0g𝑇) = (0g𝑇)
1513, 14ghmid 13781 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(0g𝑆)) = (0g𝑇))
167, 12, 153jca 1201 . 2 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹:(Base‘𝑆)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)) ∧ (𝐹‘(0g𝑆)) = (0g𝑇)))
175, 6, 8, 9, 13, 14ismhm 13489 . 2 (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝐹:(Base‘𝑆)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)) ∧ (𝐹‘(0g𝑆)) = (0g𝑇))))
182, 4, 16, 17syl21anbrc 1206 1 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹 ∈ (𝑆 MndHom 𝑇))
Colors of variables: wff set class
Syntax hints:  wi 4  w3a 1002   = wceq 1395  wcel 2200  wral 2508  wf 5313  cfv 5317  (class class class)co 6000  Basecbs 13027  +gcplusg 13105  0gc0g 13284  Mndcmnd 13444   MndHom cmhm 13485   GrpHom cghm 13772
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4198  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-cnex 8086  ax-resscn 8087  ax-1re 8089  ax-addrcl 8092
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-map 6795  df-inn 9107  df-2 9165  df-ndx 13030  df-slot 13031  df-base 13033  df-plusg 13118  df-0g 13286  df-mgm 13384  df-sgrp 13430  df-mnd 13445  df-mhm 13487  df-grp 13531  df-ghm 13773
This theorem is referenced by:  ghmmhmb  13786  ghmmulg  13788  resghm2  13793  ghmco  13796  ghmeql  13799  lgseisenlem4  15746
  Copyright terms: Public domain W3C validator