Theorem mhmlin 13774

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.

Step	Hyp	Ref	Expression
1		mhmlin.b	. . . . . 6 |- B = ( Base ` S )
2		eqid 2238	. . . . . 6 |- ( Base ` T ) = ( Base ` T )
3		mhmlin.p	. . . . . 6 |- .+ = ( +g ` S )
4		mhmlin.q	. . . . . 6 |- .+^ = ( +g ` T )
5		eqid 2238	. . . . . 6 |- ( 0g ` S ) = ( 0g ` S )
6		eqid 2238	. . . . . 6 |- ( 0g ` T ) = ( 0g ` T )
7	1, 2, 3, 4, 5, 6	ismhm 13768	. . . . 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 ) ) ) )
8	7	simprbi 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 ) ) )
9	8	simp2d 1041	. . 3 |- ( F e. ( S MndHom T ) -> A. x e. B A. y e. B ( F ` ( x .+ y ) ) = ( ( F ` x ) .+^ ( F ` y ) ) )
10		fvoveq1 6108	. . . . 5 |- ( x = X -> ( F ` ( x .+ y ) ) = ( F ` ( X .+ y ) ) )
11		fveq2 5695	. . . . . 6 |- ( x = X -> ( F ` x ) = ( F ` X ) )
12	11	oveq1d 6100	. . . . 5 |- ( x = X -> ( ( F ` x ) .+^ ( F ` y ) ) = ( ( F ` X ) .+^ ( F ` y ) ) )
13	10, 12	eqeq12d 2253	. . . 4 |- ( x = X -> ( ( F ` ( x .+ y ) ) = ( ( F ` x ) .+^ ( F ` y ) ) <-> ( F ` ( X .+ y ) ) = ( ( F ` X ) .+^ ( F ` y ) ) ) )
14		oveq2 6093	. . . . . 6 |- ( y = Y -> ( X .+ y ) = ( X .+ Y ) )
15	14	fveq2d 5699	. . . . 5 |- ( y = Y -> ( F ` ( X .+ y ) ) = ( F ` ( X .+ Y ) ) )
16		fveq2 5695	. . . . . 6 |- ( y = Y -> ( F ` y ) = ( F ` Y ) )
17	16	oveq2d 6101	. . . . 5 |- ( y = Y -> ( ( F ` X ) .+^ ( F ` y ) ) = ( ( F ` X ) .+^ ( F ` Y ) ) )
18	15, 17	eqeq12d 2253	. . . 4 |- ( y = Y -> ( ( F ` ( X .+ y ) ) = ( ( F ` X ) .+^ ( F ` y ) ) <-> ( F ` ( X .+ Y ) ) = ( ( F ` X ) .+^ ( F ` Y ) ) ) )
19	13, 18	rspc2v 2943	. . 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 ) ) ) )
20	9, 19	syl5com 29	. 2 |- ( F e. ( S MndHom T ) -> ( ( X e. B /\ Y e. B ) -> ( F ` ( X .+ Y ) ) = ( ( F ` X ) .+^ ( F ` Y ) ) ) )
21	20	3impib 1232	1 |- ( ( F e. ( S MndHom T ) /\ X e. B /\ Y e. B ) -> ( F ` ( X .+ Y ) ) = ( ( F ` X ) .+^ ( F ` Y ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   /\ w3a 1009   = wceq 1402   e. wcel 2209   A.wral 2528   -->wf 5373   ` cfv 5377  (class class class)co 6085   Basecbs 13352   +g cplusg 13431   0gc0g 13610   Mndcmnd 13729   MndHom cmhm 13764

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-map 6924  df-inn 9305  df-ndx 13355  df-slot 13356  df-base 13358  df-mhm 13766

This theorem is used by:  mhmf1o  13777  resmhm  13794  resmhm2  13795  resmhm2b  13796  mhmco  13797  mhmima  13798  mhmeql  13799  gzsumwmhm  13803  mhmmulg  13966  ghmmhmb  14057  gzsummhm  14145  rhmmul  14471