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

Theorem mhmlin 13549
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 2231 . . . . . 6  |-  ( Base `  T )  =  (
Base `  T )
3 mhmlin.p . . . . . 6  |-  .+  =  ( +g  `  S )
4 mhmlin.q . . . . . 6  |-  .+^  =  ( +g  `  T )
5 eqid 2231 . . . . . 6  |-  ( 0g
`  S )  =  ( 0g `  S
)
6 eqid 2231 . . . . . 6  |-  ( 0g
`  T )  =  ( 0g `  T
)
71, 2, 3, 4, 5, 6ismhm 13543 . . . . 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 1036 . . 3  |-  ( F  e.  ( S MndHom  T
)  ->  A. x  e.  B  A. y  e.  B  ( F `  ( x  .+  y
) )  =  ( ( F `  x
)  .+^  ( F `  y ) ) )
10 fvoveq1 6040 . . . . 5  |-  ( x  =  X  ->  ( F `  ( x  .+  y ) )  =  ( F `  ( X  .+  y ) ) )
11 fveq2 5639 . . . . . 6  |-  ( x  =  X  ->  ( F `  x )  =  ( F `  X ) )
1211oveq1d 6032 . . . . 5  |-  ( x  =  X  ->  (
( F `  x
)  .+^  ( F `  y ) )  =  ( ( F `  X )  .+^  ( F `
 y ) ) )
1310, 12eqeq12d 2246 . . . 4  |-  ( x  =  X  ->  (
( F `  (
x  .+  y )
)  =  ( ( F `  x ) 
.+^  ( F `  y ) )  <->  ( F `  ( X  .+  y
) )  =  ( ( F `  X
)  .+^  ( F `  y ) ) ) )
14 oveq2 6025 . . . . . 6  |-  ( y  =  Y  ->  ( X  .+  y )  =  ( X  .+  Y
) )
1514fveq2d 5643 . . . . 5  |-  ( y  =  Y  ->  ( F `  ( X  .+  y ) )  =  ( F `  ( X  .+  Y ) ) )
16 fveq2 5639 . . . . . 6  |-  ( y  =  Y  ->  ( F `  y )  =  ( F `  Y ) )
1716oveq2d 6033 . . . . 5  |-  ( y  =  Y  ->  (
( F `  X
)  .+^  ( F `  y ) )  =  ( ( F `  X )  .+^  ( F `
 Y ) ) )
1815, 17eqeq12d 2246 . . . 4  |-  ( y  =  Y  ->  (
( F `  ( X  .+  y ) )  =  ( ( F `
 X )  .+^  ( F `  y ) )  <->  ( F `  ( X  .+  Y ) )  =  ( ( F `  X ) 
.+^  ( F `  Y ) ) ) )
1913, 18rspc2v 2923 . . 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 1227 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 1004    = wceq 1397    e. wcel 2202   A.wral 2510   -->wf 5322   ` cfv 5326  (class class class)co 6017   Basecbs 13081   +g cplusg 13159   0gc0g 13338   Mndcmnd 13498   MndHom cmhm 13539
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1re 8125  ax-addrcl 8128
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-map 6818  df-inn 9143  df-ndx 13084  df-slot 13085  df-base 13087  df-mhm 13541
This theorem is referenced by:  mhmf1o  13552  resmhm  13569  resmhm2  13570  resmhm2b  13571  mhmco  13572  mhmima  13573  mhmeql  13574  gsumwmhm  13580  mhmmulg  13749  ghmmhmb  13840  gsumfzmhm  13929  rhmmul  14177
  Copyright terms: Public domain W3C validator