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

Theorem mhmlin 12690
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 2170 . . . . . 6  |-  ( Base `  T )  =  (
Base `  T )
3 mhmlin.p . . . . . 6  |-  .+  =  ( +g  `  S )
4 mhmlin.q . . . . . 6  |-  .+^  =  ( +g  `  T )
5 eqid 2170 . . . . . 6  |-  ( 0g
`  S )  =  ( 0g `  S
)
6 eqid 2170 . . . . . 6  |-  ( 0g
`  T )  =  ( 0g `  T
)
71, 2, 3, 4, 5, 6ismhm 12685 . . . . 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 273 . . . 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 1005 . . 3  |-  ( F  e.  ( S MndHom  T
)  ->  A. x  e.  B  A. y  e.  B  ( F `  ( x  .+  y
) )  =  ( ( F `  x
)  .+^  ( F `  y ) ) )
10 fvoveq1 5876 . . . . 5  |-  ( x  =  X  ->  ( F `  ( x  .+  y ) )  =  ( F `  ( X  .+  y ) ) )
11 fveq2 5496 . . . . . 6  |-  ( x  =  X  ->  ( F `  x )  =  ( F `  X ) )
1211oveq1d 5868 . . . . 5  |-  ( x  =  X  ->  (
( F `  x
)  .+^  ( F `  y ) )  =  ( ( F `  X )  .+^  ( F `
 y ) ) )
1310, 12eqeq12d 2185 . . . 4  |-  ( x  =  X  ->  (
( F `  (
x  .+  y )
)  =  ( ( F `  x ) 
.+^  ( F `  y ) )  <->  ( F `  ( X  .+  y
) )  =  ( ( F `  X
)  .+^  ( F `  y ) ) ) )
14 oveq2 5861 . . . . . 6  |-  ( y  =  Y  ->  ( X  .+  y )  =  ( X  .+  Y
) )
1514fveq2d 5500 . . . . 5  |-  ( y  =  Y  ->  ( F `  ( X  .+  y ) )  =  ( F `  ( X  .+  Y ) ) )
16 fveq2 5496 . . . . . 6  |-  ( y  =  Y  ->  ( F `  y )  =  ( F `  Y ) )
1716oveq2d 5869 . . . . 5  |-  ( y  =  Y  ->  (
( F `  X
)  .+^  ( F `  y ) )  =  ( ( F `  X )  .+^  ( F `
 Y ) ) )
1815, 17eqeq12d 2185 . . . 4  |-  ( y  =  Y  ->  (
( F `  ( X  .+  y ) )  =  ( ( F `
 X )  .+^  ( F `  y ) )  <->  ( F `  ( X  .+  Y ) )  =  ( ( F `  X ) 
.+^  ( F `  Y ) ) ) )
1913, 18rspc2v 2847 . . 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 1196 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 103    /\ w3a 973    = wceq 1348    e. wcel 2141   A.wral 2448   -->wf 5194   ` cfv 5198  (class class class)co 5853   Basecbs 12416   +g cplusg 12480   0gc0g 12596   Mndcmnd 12652   MndHom cmhm 12681
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-cnex 7865  ax-resscn 7866  ax-1re 7868  ax-addrcl 7871
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-ral 2453  df-rex 2454  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-fv 5206  df-ov 5856  df-oprab 5857  df-mpo 5858  df-1st 6119  df-2nd 6120  df-map 6628  df-inn 8879  df-ndx 12419  df-slot 12420  df-base 12422  df-mhm 12683
This theorem is referenced by:  mhmf1o  12693  mhmco  12705  mhmima  12706  mhmeql  12707
  Copyright terms: Public domain W3C validator