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

Theorem ghmmhm 13704
Description: A group homomorphism is a monoid homomorphism. (Contributed by Stefan O'Rear, 7-Mar-2015.)
Assertion
Ref Expression
ghmmhm  |-  ( F  e.  ( S  GrpHom  T )  ->  F  e.  ( S MndHom  T ) )

Proof of Theorem ghmmhm
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ghmgrp1 13696 . . 3  |-  ( F  e.  ( S  GrpHom  T )  ->  S  e.  Grp )
21grpmndd 13460 . 2  |-  ( F  e.  ( S  GrpHom  T )  ->  S  e.  Mnd )
3 ghmgrp2 13697 . . 3  |-  ( F  e.  ( S  GrpHom  T )  ->  T  e.  Grp )
43grpmndd 13460 . 2  |-  ( F  e.  ( S  GrpHom  T )  ->  T  e.  Mnd )
5 eqid 2207 . . . 4  |-  ( Base `  S )  =  (
Base `  S )
6 eqid 2207 . . . 4  |-  ( Base `  T )  =  (
Base `  T )
75, 6ghmf 13698 . . 3  |-  ( F  e.  ( S  GrpHom  T )  ->  F :
( Base `  S ) --> ( Base `  T )
)
8 eqid 2207 . . . . . 6  |-  ( +g  `  S )  =  ( +g  `  S )
9 eqid 2207 . . . . . 6  |-  ( +g  `  T )  =  ( +g  `  T )
105, 8, 9ghmlin 13699 . . . . 5  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  x  e.  ( Base `  S
)  /\  y  e.  ( Base `  S )
)  ->  ( F `  ( x ( +g  `  S ) y ) )  =  ( ( F `  x ) ( +g  `  T
) ( F `  y ) ) )
11103expb 1207 . . . 4  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  (
x  e.  ( Base `  S )  /\  y  e.  ( Base `  S
) ) )  -> 
( F `  (
x ( +g  `  S
) y ) )  =  ( ( F `
 x ) ( +g  `  T ) ( F `  y
) ) )
1211ralrimivva 2590 . . 3  |-  ( F  e.  ( S  GrpHom  T )  ->  A. x  e.  ( Base `  S
) A. y  e.  ( Base `  S
) ( F `  ( x ( +g  `  S ) y ) )  =  ( ( F `  x ) ( +g  `  T
) ( F `  y ) ) )
13 eqid 2207 . . . 4  |-  ( 0g
`  S )  =  ( 0g `  S
)
14 eqid 2207 . . . 4  |-  ( 0g
`  T )  =  ( 0g `  T
)
1513, 14ghmid 13700 . . 3  |-  ( F  e.  ( S  GrpHom  T )  ->  ( F `  ( 0g `  S
) )  =  ( 0g `  T ) )
167, 12, 153jca 1180 . 2  |-  ( F  e.  ( S  GrpHom  T )  ->  ( F : ( Base `  S
) --> ( Base `  T
)  /\  A. x  e.  ( Base `  S
) A. y  e.  ( Base `  S
) ( F `  ( x ( +g  `  S ) y ) )  =  ( ( F `  x ) ( +g  `  T
) ( F `  y ) )  /\  ( F `  ( 0g
`  S ) )  =  ( 0g `  T ) ) )
175, 6, 8, 9, 13, 14ismhm 13408 . 2  |-  ( F  e.  ( S MndHom  T
)  <->  ( ( S  e.  Mnd  /\  T  e.  Mnd )  /\  ( F : ( Base `  S
) --> ( Base `  T
)  /\  A. x  e.  ( Base `  S
) A. y  e.  ( Base `  S
) ( F `  ( x ( +g  `  S ) y ) )  =  ( ( F `  x ) ( +g  `  T
) ( F `  y ) )  /\  ( F `  ( 0g
`  S ) )  =  ( 0g `  T ) ) ) )
182, 4, 16, 17syl21anbrc 1185 1  |-  ( F  e.  ( S  GrpHom  T )  ->  F  e.  ( S MndHom  T ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ w3a 981    = wceq 1373    e. wcel 2178   A.wral 2486   -->wf 5286   ` cfv 5290  (class class class)co 5967   Basecbs 12947   +g cplusg 13024   0gc0g 13203   Mndcmnd 13363   MndHom cmhm 13404    GrpHom cghm 13691
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 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-cnex 8051  ax-resscn 8052  ax-1re 8054  ax-addrcl 8057
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-reu 2493  df-rmo 2494  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-riota 5922  df-ov 5970  df-oprab 5971  df-mpo 5972  df-1st 6249  df-2nd 6250  df-map 6760  df-inn 9072  df-2 9130  df-ndx 12950  df-slot 12951  df-base 12953  df-plusg 13037  df-0g 13205  df-mgm 13303  df-sgrp 13349  df-mnd 13364  df-mhm 13406  df-grp 13450  df-ghm 13692
This theorem is referenced by:  ghmmhmb  13705  ghmmulg  13707  resghm2  13712  ghmco  13715  ghmeql  13718  lgseisenlem4  15665
  Copyright terms: Public domain W3C validator