MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mhmlin Structured version   Visualization version   GIF version

Theorem mhmlin 18225
Description: A monoid homomorphism commutes with composition. (Contributed by Mario Carneiro, 7-Mar-2015.)
Hypotheses
Ref Expression
mhmlin.b 𝐵 = (Base‘𝑆)
mhmlin.p + = (+g𝑆)
mhmlin.q = (+g𝑇)
Assertion
Ref Expression
mhmlin ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋𝐵𝑌𝐵) → (𝐹‘(𝑋 + 𝑌)) = ((𝐹𝑋) (𝐹𝑌)))

Proof of Theorem mhmlin
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mhmlin.b . . . . . 6 𝐵 = (Base‘𝑆)
2 eqid 2737 . . . . . 6 (Base‘𝑇) = (Base‘𝑇)
3 mhmlin.p . . . . . 6 + = (+g𝑆)
4 mhmlin.q . . . . . 6 = (+g𝑇)
5 eqid 2737 . . . . . 6 (0g𝑆) = (0g𝑆)
6 eqid 2737 . . . . . 6 (0g𝑇) = (0g𝑇)
71, 2, 3, 4, 5, 6ismhm 18220 . . . . 5 (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝐹:𝐵⟶(Base‘𝑇) ∧ ∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ∧ (𝐹‘(0g𝑆)) = (0g𝑇))))
87simprbi 500 . . . 4 (𝐹 ∈ (𝑆 MndHom 𝑇) → (𝐹:𝐵⟶(Base‘𝑇) ∧ ∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ∧ (𝐹‘(0g𝑆)) = (0g𝑇)))
98simp2d 1145 . . 3 (𝐹 ∈ (𝑆 MndHom 𝑇) → ∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)))
10 fvoveq1 7236 . . . . 5 (𝑥 = 𝑋 → (𝐹‘(𝑥 + 𝑦)) = (𝐹‘(𝑋 + 𝑦)))
11 fveq2 6717 . . . . . 6 (𝑥 = 𝑋 → (𝐹𝑥) = (𝐹𝑋))
1211oveq1d 7228 . . . . 5 (𝑥 = 𝑋 → ((𝐹𝑥) (𝐹𝑦)) = ((𝐹𝑋) (𝐹𝑦)))
1310, 12eqeq12d 2753 . . . 4 (𝑥 = 𝑋 → ((𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ↔ (𝐹‘(𝑋 + 𝑦)) = ((𝐹𝑋) (𝐹𝑦))))
14 oveq2 7221 . . . . . 6 (𝑦 = 𝑌 → (𝑋 + 𝑦) = (𝑋 + 𝑌))
1514fveq2d 6721 . . . . 5 (𝑦 = 𝑌 → (𝐹‘(𝑋 + 𝑦)) = (𝐹‘(𝑋 + 𝑌)))
16 fveq2 6717 . . . . . 6 (𝑦 = 𝑌 → (𝐹𝑦) = (𝐹𝑌))
1716oveq2d 7229 . . . . 5 (𝑦 = 𝑌 → ((𝐹𝑋) (𝐹𝑦)) = ((𝐹𝑋) (𝐹𝑌)))
1815, 17eqeq12d 2753 . . . 4 (𝑦 = 𝑌 → ((𝐹‘(𝑋 + 𝑦)) = ((𝐹𝑋) (𝐹𝑦)) ↔ (𝐹‘(𝑋 + 𝑌)) = ((𝐹𝑋) (𝐹𝑌))))
1913, 18rspc2v 3547 . . 3 ((𝑋𝐵𝑌𝐵) → (∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) → (𝐹‘(𝑋 + 𝑌)) = ((𝐹𝑋) (𝐹𝑌))))
209, 19syl5com 31 . 2 (𝐹 ∈ (𝑆 MndHom 𝑇) → ((𝑋𝐵𝑌𝐵) → (𝐹‘(𝑋 + 𝑌)) = ((𝐹𝑋) (𝐹𝑌))))
21203impib 1118 1 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋𝐵𝑌𝐵) → (𝐹‘(𝑋 + 𝑌)) = ((𝐹𝑋) (𝐹𝑌)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  w3a 1089   = wceq 1543  wcel 2110  wral 3061  wf 6376  cfv 6380  (class class class)co 7213  Basecbs 16760  +gcplusg 16802  0gc0g 16944  Mndcmnd 18173   MndHom cmhm 18216
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2708  ax-sep 5192  ax-nul 5199  ax-pow 5258  ax-pr 5322  ax-un 7523
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2071  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2886  df-ne 2941  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3410  df-sbc 3695  df-dif 3869  df-un 3871  df-in 3873  df-ss 3883  df-nul 4238  df-if 4440  df-pw 4515  df-sn 4542  df-pr 4544  df-op 4548  df-uni 4820  df-br 5054  df-opab 5116  df-id 5455  df-xp 5557  df-rel 5558  df-cnv 5559  df-co 5560  df-dm 5561  df-rn 5562  df-iota 6338  df-fun 6382  df-fn 6383  df-f 6384  df-fv 6388  df-ov 7216  df-oprab 7217  df-mpo 7218  df-map 8510  df-mhm 18218
This theorem is referenced by:  mhmf1o  18228  resmhm  18247  resmhm2  18248  resmhm2b  18249  mhmco  18250  mhmima  18251  mhmeql  18252  pwsco2mhm  18259  gsumwmhm  18272  mhmmulg  18532  ghmmhmb  18633  cntzmhm  18733  gsumzmhm  19322  rhmmul  19747  evlslem1  21042  mpfind  21067  mhmvlin  21296  mdetunilem7  21515  dchrzrhmul  26127  dchrmulcl  26130  dchrn0  26131  dchrinvcl  26134  dchrsum2  26149  sum2dchr  26155  mhmhmeotmd  31591
  Copyright terms: Public domain W3C validator