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

Theorem mhmlin 12880
Description: A monoid homomorphism commutes with composition. (Contributed by Mario Carneiro, 7-Mar-2015.)
Hypotheses
Ref Expression
mhmlin.b  |-  B  =  ( Base `  S
)
mhmlin.p  |-  .+  =  ( +g  `  S )
mhmlin.q  |-  .+^  =  ( +g  `  T )
Assertion
Ref Expression
mhmlin  |-  ( ( F  e.  ( S MndHom  T )  /\  X  e.  B  /\  Y  e.  B )  ->  ( F `  ( X  .+  Y ) )  =  ( ( F `  X )  .+^  ( F `
 Y ) ) )

Proof of Theorem mhmlin
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mhmlin.b . . . . . 6  |-  B  =  ( Base `  S
)
2 eqid 2187 . . . . . 6  |-  ( Base `  T )  =  (
Base `  T )
3 mhmlin.p . . . . . 6  |-  .+  =  ( +g  `  S )
4 mhmlin.q . . . . . 6  |-  .+^  =  ( +g  `  T )
5 eqid 2187 . . . . . 6  |-  ( 0g
`  S )  =  ( 0g `  S
)
6 eqid 2187 . . . . . 6  |-  ( 0g
`  T )  =  ( 0g `  T
)
71, 2, 3, 4, 5, 6ismhm 12875 . . . . 5  |-  ( F  e.  ( S MndHom  T
)  <->  ( ( S  e.  Mnd  /\  T  e.  Mnd )  /\  ( F : B --> ( Base `  T )  /\  A. x  e.  B  A. y  e.  B  ( F `  ( x  .+  y ) )  =  ( ( F `  x )  .+^  ( F `
 y ) )  /\  ( F `  ( 0g `  S ) )  =  ( 0g
`  T ) ) ) )
87simprbi 275 . . . 4  |-  ( F  e.  ( S MndHom  T
)  ->  ( F : B --> ( Base `  T
)  /\  A. x  e.  B  A. y  e.  B  ( F `  ( x  .+  y
) )  =  ( ( F `  x
)  .+^  ( F `  y ) )  /\  ( F `  ( 0g
`  S ) )  =  ( 0g `  T ) ) )
98simp2d 1011 . . 3  |-  ( F  e.  ( S MndHom  T
)  ->  A. x  e.  B  A. y  e.  B  ( F `  ( x  .+  y
) )  =  ( ( F `  x
)  .+^  ( F `  y ) ) )
10 fvoveq1 5911 . . . . 5  |-  ( x  =  X  ->  ( F `  ( x  .+  y ) )  =  ( F `  ( X  .+  y ) ) )
11 fveq2 5527 . . . . . 6  |-  ( x  =  X  ->  ( F `  x )  =  ( F `  X ) )
1211oveq1d 5903 . . . . 5  |-  ( x  =  X  ->  (
( F `  x
)  .+^  ( F `  y ) )  =  ( ( F `  X )  .+^  ( F `
 y ) ) )
1310, 12eqeq12d 2202 . . . 4  |-  ( x  =  X  ->  (
( F `  (
x  .+  y )
)  =  ( ( F `  x ) 
.+^  ( F `  y ) )  <->  ( F `  ( X  .+  y
) )  =  ( ( F `  X
)  .+^  ( F `  y ) ) ) )
14 oveq2 5896 . . . . . 6  |-  ( y  =  Y  ->  ( X  .+  y )  =  ( X  .+  Y
) )
1514fveq2d 5531 . . . . 5  |-  ( y  =  Y  ->  ( F `  ( X  .+  y ) )  =  ( F `  ( X  .+  Y ) ) )
16 fveq2 5527 . . . . . 6  |-  ( y  =  Y  ->  ( F `  y )  =  ( F `  Y ) )
1716oveq2d 5904 . . . . 5  |-  ( y  =  Y  ->  (
( F `  X
)  .+^  ( F `  y ) )  =  ( ( F `  X )  .+^  ( F `
 Y ) ) )
1815, 17eqeq12d 2202 . . . 4  |-  ( y  =  Y  ->  (
( F `  ( X  .+  y ) )  =  ( ( F `
 X )  .+^  ( F `  y ) )  <->  ( F `  ( X  .+  Y ) )  =  ( ( F `  X ) 
.+^  ( F `  Y ) ) ) )
1913, 18rspc2v 2866 . . 3  |-  ( ( X  e.  B  /\  Y  e.  B )  ->  ( A. x  e.  B  A. y  e.  B  ( F `  ( x  .+  y ) )  =  ( ( F `  x ) 
.+^  ( F `  y ) )  -> 
( F `  ( X  .+  Y ) )  =  ( ( F `
 X )  .+^  ( F `  Y ) ) ) )
209, 19syl5com 29 . 2  |-  ( F  e.  ( S MndHom  T
)  ->  ( ( X  e.  B  /\  Y  e.  B )  ->  ( F `  ( X  .+  Y ) )  =  ( ( F `
 X )  .+^  ( F `  Y ) ) ) )
21203impib 1202 1  |-  ( ( F  e.  ( S MndHom  T )  /\  X  e.  B  /\  Y  e.  B )  ->  ( F `  ( X  .+  Y ) )  =  ( ( F `  X )  .+^  ( F `
 Y ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 979    = wceq 1363    e. wcel 2158   A.wral 2465   -->wf 5224   ` cfv 5228  (class class class)co 5888   Basecbs 12476   +g cplusg 12551   0gc0g 12723   Mndcmnd 12839   MndHom cmhm 12871
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 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-13 2160  ax-14 2161  ax-ext 2169  ax-sep 4133  ax-pow 4186  ax-pr 4221  ax-un 4445  ax-setind 4548  ax-cnex 7916  ax-resscn 7917  ax-1re 7919  ax-addrcl 7922
This theorem depends on definitions:  df-bi 117  df-3an 981  df-tru 1366  df-fal 1369  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ne 2358  df-ral 2470  df-rex 2471  df-rab 2474  df-v 2751  df-sbc 2975  df-csb 3070  df-dif 3143  df-un 3145  df-in 3147  df-ss 3154  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-uni 3822  df-int 3857  df-iun 3900  df-br 4016  df-opab 4077  df-mpt 4078  df-id 4305  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-rn 4649  df-res 4650  df-ima 4651  df-iota 5190  df-fun 5230  df-fn 5231  df-f 5232  df-fv 5236  df-ov 5891  df-oprab 5892  df-mpo 5893  df-1st 6155  df-2nd 6156  df-map 6664  df-inn 8934  df-ndx 12479  df-slot 12480  df-base 12482  df-mhm 12873
This theorem is referenced by:  mhmf1o  12883  resmhm  12900  resmhm2  12901  resmhm2b  12902  mhmco  12903  mhmima  12904  mhmeql  12905  mhmmulg  13064  ghmmhmb  13149
  Copyright terms: Public domain W3C validator