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

Theorem ismhm 17160
Description: Property of a monoid homomorphism. (Contributed by Mario Carneiro, 7-Mar-2015.)
Hypotheses
Ref Expression
ismhm.b 𝐵 = (Base‘𝑆)
ismhm.c 𝐶 = (Base‘𝑇)
ismhm.p + = (+g𝑆)
ismhm.q = (+g𝑇)
ismhm.z 0 = (0g𝑆)
ismhm.y 𝑌 = (0g𝑇)
Assertion
Ref Expression
ismhm (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝐹:𝐵𝐶 ∧ ∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ∧ (𝐹0 ) = 𝑌)))
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝑆,𝑦   𝑥,𝑇,𝑦   𝑥,𝐹,𝑦
Allowed substitution hints:   𝐶(𝑥,𝑦)   + (𝑥,𝑦)   (𝑥,𝑦)   𝑌(𝑥,𝑦)   0 (𝑥,𝑦)

Proof of Theorem ismhm
Dummy variables 𝑓 𝑠 𝑡 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-mhm 17158 . . 3 MndHom = (𝑠 ∈ Mnd, 𝑡 ∈ Mnd ↦ {𝑓 ∈ ((Base‘𝑡) ↑𝑚 (Base‘𝑠)) ∣ (∀𝑥 ∈ (Base‘𝑠)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ∧ (𝑓‘(0g𝑠)) = (0g𝑡))})
21elmpt2cl 6774 . 2 (𝐹 ∈ (𝑆 MndHom 𝑇) → (𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd))
3 fveq2 6103 . . . . . . . 8 (𝑡 = 𝑇 → (Base‘𝑡) = (Base‘𝑇))
4 ismhm.c . . . . . . . 8 𝐶 = (Base‘𝑇)
53, 4syl6eqr 2662 . . . . . . 7 (𝑡 = 𝑇 → (Base‘𝑡) = 𝐶)
6 fveq2 6103 . . . . . . . 8 (𝑠 = 𝑆 → (Base‘𝑠) = (Base‘𝑆))
7 ismhm.b . . . . . . . 8 𝐵 = (Base‘𝑆)
86, 7syl6eqr 2662 . . . . . . 7 (𝑠 = 𝑆 → (Base‘𝑠) = 𝐵)
95, 8oveqan12rd 6569 . . . . . 6 ((𝑠 = 𝑆𝑡 = 𝑇) → ((Base‘𝑡) ↑𝑚 (Base‘𝑠)) = (𝐶𝑚 𝐵))
108adantr 480 . . . . . . . 8 ((𝑠 = 𝑆𝑡 = 𝑇) → (Base‘𝑠) = 𝐵)
11 fveq2 6103 . . . . . . . . . . . . 13 (𝑠 = 𝑆 → (+g𝑠) = (+g𝑆))
12 ismhm.p . . . . . . . . . . . . 13 + = (+g𝑆)
1311, 12syl6eqr 2662 . . . . . . . . . . . 12 (𝑠 = 𝑆 → (+g𝑠) = + )
1413oveqd 6566 . . . . . . . . . . 11 (𝑠 = 𝑆 → (𝑥(+g𝑠)𝑦) = (𝑥 + 𝑦))
1514fveq2d 6107 . . . . . . . . . 10 (𝑠 = 𝑆 → (𝑓‘(𝑥(+g𝑠)𝑦)) = (𝑓‘(𝑥 + 𝑦)))
16 fveq2 6103 . . . . . . . . . . . 12 (𝑡 = 𝑇 → (+g𝑡) = (+g𝑇))
17 ismhm.q . . . . . . . . . . . 12 = (+g𝑇)
1816, 17syl6eqr 2662 . . . . . . . . . . 11 (𝑡 = 𝑇 → (+g𝑡) = )
1918oveqd 6566 . . . . . . . . . 10 (𝑡 = 𝑇 → ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) = ((𝑓𝑥) (𝑓𝑦)))
2015, 19eqeqan12d 2626 . . . . . . . . 9 ((𝑠 = 𝑆𝑡 = 𝑇) → ((𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ↔ (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦))))
2110, 20raleqbidv 3129 . . . . . . . 8 ((𝑠 = 𝑆𝑡 = 𝑇) → (∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ↔ ∀𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦))))
2210, 21raleqbidv 3129 . . . . . . 7 ((𝑠 = 𝑆𝑡 = 𝑇) → (∀𝑥 ∈ (Base‘𝑠)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ↔ ∀𝑥𝐵𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦))))
23 fveq2 6103 . . . . . . . . . 10 (𝑠 = 𝑆 → (0g𝑠) = (0g𝑆))
24 ismhm.z . . . . . . . . . 10 0 = (0g𝑆)
2523, 24syl6eqr 2662 . . . . . . . . 9 (𝑠 = 𝑆 → (0g𝑠) = 0 )
2625fveq2d 6107 . . . . . . . 8 (𝑠 = 𝑆 → (𝑓‘(0g𝑠)) = (𝑓0 ))
27 fveq2 6103 . . . . . . . . 9 (𝑡 = 𝑇 → (0g𝑡) = (0g𝑇))
28 ismhm.y . . . . . . . . 9 𝑌 = (0g𝑇)
2927, 28syl6eqr 2662 . . . . . . . 8 (𝑡 = 𝑇 → (0g𝑡) = 𝑌)
3026, 29eqeqan12d 2626 . . . . . . 7 ((𝑠 = 𝑆𝑡 = 𝑇) → ((𝑓‘(0g𝑠)) = (0g𝑡) ↔ (𝑓0 ) = 𝑌))
3122, 30anbi12d 743 . . . . . 6 ((𝑠 = 𝑆𝑡 = 𝑇) → ((∀𝑥 ∈ (Base‘𝑠)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ∧ (𝑓‘(0g𝑠)) = (0g𝑡)) ↔ (∀𝑥𝐵𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓0 ) = 𝑌)))
329, 31rabeqbidv 3168 . . . . 5 ((𝑠 = 𝑆𝑡 = 𝑇) → {𝑓 ∈ ((Base‘𝑡) ↑𝑚 (Base‘𝑠)) ∣ (∀𝑥 ∈ (Base‘𝑠)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ∧ (𝑓‘(0g𝑠)) = (0g𝑡))} = {𝑓 ∈ (𝐶𝑚 𝐵) ∣ (∀𝑥𝐵𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓0 ) = 𝑌)})
33 ovex 6577 . . . . . 6 (𝐶𝑚 𝐵) ∈ V
3433rabex 4740 . . . . 5 {𝑓 ∈ (𝐶𝑚 𝐵) ∣ (∀𝑥𝐵𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓0 ) = 𝑌)} ∈ V
3532, 1, 34ovmpt2a 6689 . . . 4 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝑆 MndHom 𝑇) = {𝑓 ∈ (𝐶𝑚 𝐵) ∣ (∀𝑥𝐵𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓0 ) = 𝑌)})
3635eleq2d 2673 . . 3 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ 𝐹 ∈ {𝑓 ∈ (𝐶𝑚 𝐵) ∣ (∀𝑥𝐵𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓0 ) = 𝑌)}))
37 fvex 6113 . . . . . . 7 (Base‘𝑇) ∈ V
384, 37eqeltri 2684 . . . . . 6 𝐶 ∈ V
39 fvex 6113 . . . . . . 7 (Base‘𝑆) ∈ V
407, 39eqeltri 2684 . . . . . 6 𝐵 ∈ V
4138, 40elmap 7772 . . . . 5 (𝐹 ∈ (𝐶𝑚 𝐵) ↔ 𝐹:𝐵𝐶)
4241anbi1i 727 . . . 4 ((𝐹 ∈ (𝐶𝑚 𝐵) ∧ (∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ∧ (𝐹0 ) = 𝑌)) ↔ (𝐹:𝐵𝐶 ∧ (∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ∧ (𝐹0 ) = 𝑌)))
43 fveq1 6102 . . . . . . . 8 (𝑓 = 𝐹 → (𝑓‘(𝑥 + 𝑦)) = (𝐹‘(𝑥 + 𝑦)))
44 fveq1 6102 . . . . . . . . 9 (𝑓 = 𝐹 → (𝑓𝑥) = (𝐹𝑥))
45 fveq1 6102 . . . . . . . . 9 (𝑓 = 𝐹 → (𝑓𝑦) = (𝐹𝑦))
4644, 45oveq12d 6567 . . . . . . . 8 (𝑓 = 𝐹 → ((𝑓𝑥) (𝑓𝑦)) = ((𝐹𝑥) (𝐹𝑦)))
4743, 46eqeq12d 2625 . . . . . . 7 (𝑓 = 𝐹 → ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ↔ (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦))))
48472ralbidv 2972 . . . . . 6 (𝑓 = 𝐹 → (∀𝑥𝐵𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ↔ ∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦))))
49 fveq1 6102 . . . . . . 7 (𝑓 = 𝐹 → (𝑓0 ) = (𝐹0 ))
5049eqeq1d 2612 . . . . . 6 (𝑓 = 𝐹 → ((𝑓0 ) = 𝑌 ↔ (𝐹0 ) = 𝑌))
5148, 50anbi12d 743 . . . . 5 (𝑓 = 𝐹 → ((∀𝑥𝐵𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓0 ) = 𝑌) ↔ (∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ∧ (𝐹0 ) = 𝑌)))
5251elrab 3331 . . . 4 (𝐹 ∈ {𝑓 ∈ (𝐶𝑚 𝐵) ∣ (∀𝑥𝐵𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓0 ) = 𝑌)} ↔ (𝐹 ∈ (𝐶𝑚 𝐵) ∧ (∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ∧ (𝐹0 ) = 𝑌)))
53 3anass 1035 . . . 4 ((𝐹:𝐵𝐶 ∧ ∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ∧ (𝐹0 ) = 𝑌) ↔ (𝐹:𝐵𝐶 ∧ (∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ∧ (𝐹0 ) = 𝑌)))
5442, 52, 533bitr4i 291 . . 3 (𝐹 ∈ {𝑓 ∈ (𝐶𝑚 𝐵) ∣ (∀𝑥𝐵𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓0 ) = 𝑌)} ↔ (𝐹:𝐵𝐶 ∧ ∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ∧ (𝐹0 ) = 𝑌))
5536, 54syl6bb 275 . 2 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ (𝐹:𝐵𝐶 ∧ ∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ∧ (𝐹0 ) = 𝑌)))
562, 55biadan2 672 1 (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝐹:𝐵𝐶 ∧ ∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ∧ (𝐹0 ) = 𝑌)))
Colors of variables: wff setvar class
Syntax hints:  wb 195  wa 383  w3a 1031   = wceq 1475  wcel 1977  wral 2896  {crab 2900  Vcvv 3173  wf 5800  cfv 5804  (class class class)co 6549  𝑚 cmap 7744  Basecbs 15695  +gcplusg 15768  0gc0g 15923  Mndcmnd 17117   MndHom cmhm 17156
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-map 7746  df-mhm 17158
This theorem is referenced by:  mhmf  17163  mhmpropd  17164  mhmlin  17165  mhm0  17166  idmhm  17167  mhmf1o  17168  0mhm  17181  resmhm  17182  resmhm2  17183  resmhm2b  17184  mhmco  17185  prdspjmhm  17190  pwsdiagmhm  17192  pwsco1mhm  17193  pwsco2mhm  17194  frmdup1  17224  mhmfmhm  17361  ghmmhm  17493  frgpmhm  18001  mulgmhm  18056  srglmhm  18358  srgrmhm  18359  dfrhm2  18540  isrhm2d  18551  expmhm  19634  mat1mhm  20109  scmatmhm  20159  mat2pmatmhm  20357  pm2mpmhm  20444  dchrelbas3  24763  xrge0iifmhm  29313  esumcocn  29469  elmrsubrn  30671  deg1mhm  36804  ismhm0  41595  mhmismgmhm  41596  c0mhm  41700
  Copyright terms: Public domain W3C validator