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

Theorem ismhm 17384
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 17382 . . 3 MndHom = (𝑠 ∈ Mnd, 𝑡 ∈ Mnd ↦ {𝑓 ∈ ((Base‘𝑡) ↑𝑚 (Base‘𝑠)) ∣ (∀𝑥 ∈ (Base‘𝑠)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ∧ (𝑓‘(0g𝑠)) = (0g𝑡))})
21elmpt2cl 6918 . 2 (𝐹 ∈ (𝑆 MndHom 𝑇) → (𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd))
3 fveq2 6229 . . . . . . . 8 (𝑡 = 𝑇 → (Base‘𝑡) = (Base‘𝑇))
4 ismhm.c . . . . . . . 8 𝐶 = (Base‘𝑇)
53, 4syl6eqr 2703 . . . . . . 7 (𝑡 = 𝑇 → (Base‘𝑡) = 𝐶)
6 fveq2 6229 . . . . . . . 8 (𝑠 = 𝑆 → (Base‘𝑠) = (Base‘𝑆))
7 ismhm.b . . . . . . . 8 𝐵 = (Base‘𝑆)
86, 7syl6eqr 2703 . . . . . . 7 (𝑠 = 𝑆 → (Base‘𝑠) = 𝐵)
95, 8oveqan12rd 6710 . . . . . 6 ((𝑠 = 𝑆𝑡 = 𝑇) → ((Base‘𝑡) ↑𝑚 (Base‘𝑠)) = (𝐶𝑚 𝐵))
108adantr 480 . . . . . . . 8 ((𝑠 = 𝑆𝑡 = 𝑇) → (Base‘𝑠) = 𝐵)
11 fveq2 6229 . . . . . . . . . . . . 13 (𝑠 = 𝑆 → (+g𝑠) = (+g𝑆))
12 ismhm.p . . . . . . . . . . . . 13 + = (+g𝑆)
1311, 12syl6eqr 2703 . . . . . . . . . . . 12 (𝑠 = 𝑆 → (+g𝑠) = + )
1413oveqd 6707 . . . . . . . . . . 11 (𝑠 = 𝑆 → (𝑥(+g𝑠)𝑦) = (𝑥 + 𝑦))
1514fveq2d 6233 . . . . . . . . . 10 (𝑠 = 𝑆 → (𝑓‘(𝑥(+g𝑠)𝑦)) = (𝑓‘(𝑥 + 𝑦)))
16 fveq2 6229 . . . . . . . . . . . 12 (𝑡 = 𝑇 → (+g𝑡) = (+g𝑇))
17 ismhm.q . . . . . . . . . . . 12 = (+g𝑇)
1816, 17syl6eqr 2703 . . . . . . . . . . 11 (𝑡 = 𝑇 → (+g𝑡) = )
1918oveqd 6707 . . . . . . . . . 10 (𝑡 = 𝑇 → ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) = ((𝑓𝑥) (𝑓𝑦)))
2015, 19eqeqan12d 2667 . . . . . . . . 9 ((𝑠 = 𝑆𝑡 = 𝑇) → ((𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ↔ (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦))))
2110, 20raleqbidv 3182 . . . . . . . 8 ((𝑠 = 𝑆𝑡 = 𝑇) → (∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ↔ ∀𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦))))
2210, 21raleqbidv 3182 . . . . . . 7 ((𝑠 = 𝑆𝑡 = 𝑇) → (∀𝑥 ∈ (Base‘𝑠)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ↔ ∀𝑥𝐵𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦))))
23 fveq2 6229 . . . . . . . . . 10 (𝑠 = 𝑆 → (0g𝑠) = (0g𝑆))
24 ismhm.z . . . . . . . . . 10 0 = (0g𝑆)
2523, 24syl6eqr 2703 . . . . . . . . 9 (𝑠 = 𝑆 → (0g𝑠) = 0 )
2625fveq2d 6233 . . . . . . . 8 (𝑠 = 𝑆 → (𝑓‘(0g𝑠)) = (𝑓0 ))
27 fveq2 6229 . . . . . . . . 9 (𝑡 = 𝑇 → (0g𝑡) = (0g𝑇))
28 ismhm.y . . . . . . . . 9 𝑌 = (0g𝑇)
2927, 28syl6eqr 2703 . . . . . . . 8 (𝑡 = 𝑇 → (0g𝑡) = 𝑌)
3026, 29eqeqan12d 2667 . . . . . . 7 ((𝑠 = 𝑆𝑡 = 𝑇) → ((𝑓‘(0g𝑠)) = (0g𝑡) ↔ (𝑓0 ) = 𝑌))
3122, 30anbi12d 747 . . . . . 6 ((𝑠 = 𝑆𝑡 = 𝑇) → ((∀𝑥 ∈ (Base‘𝑠)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ∧ (𝑓‘(0g𝑠)) = (0g𝑡)) ↔ (∀𝑥𝐵𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓0 ) = 𝑌)))
329, 31rabeqbidv 3226 . . . . 5 ((𝑠 = 𝑆𝑡 = 𝑇) → {𝑓 ∈ ((Base‘𝑡) ↑𝑚 (Base‘𝑠)) ∣ (∀𝑥 ∈ (Base‘𝑠)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ∧ (𝑓‘(0g𝑠)) = (0g𝑡))} = {𝑓 ∈ (𝐶𝑚 𝐵) ∣ (∀𝑥𝐵𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓0 ) = 𝑌)})
33 ovex 6718 . . . . . 6 (𝐶𝑚 𝐵) ∈ V
3433rabex 4845 . . . . 5 {𝑓 ∈ (𝐶𝑚 𝐵) ∣ (∀𝑥𝐵𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓0 ) = 𝑌)} ∈ V
3532, 1, 34ovmpt2a 6833 . . . 4 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝑆 MndHom 𝑇) = {𝑓 ∈ (𝐶𝑚 𝐵) ∣ (∀𝑥𝐵𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓0 ) = 𝑌)})
3635eleq2d 2716 . . 3 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ 𝐹 ∈ {𝑓 ∈ (𝐶𝑚 𝐵) ∣ (∀𝑥𝐵𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓0 ) = 𝑌)}))
37 fvex 6239 . . . . . . 7 (Base‘𝑇) ∈ V
384, 37eqeltri 2726 . . . . . 6 𝐶 ∈ V
39 fvex 6239 . . . . . . 7 (Base‘𝑆) ∈ V
407, 39eqeltri 2726 . . . . . 6 𝐵 ∈ V
4138, 40elmap 7928 . . . . 5 (𝐹 ∈ (𝐶𝑚 𝐵) ↔ 𝐹:𝐵𝐶)
4241anbi1i 731 . . . 4 ((𝐹 ∈ (𝐶𝑚 𝐵) ∧ (∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ∧ (𝐹0 ) = 𝑌)) ↔ (𝐹:𝐵𝐶 ∧ (∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ∧ (𝐹0 ) = 𝑌)))
43 fveq1 6228 . . . . . . . 8 (𝑓 = 𝐹 → (𝑓‘(𝑥 + 𝑦)) = (𝐹‘(𝑥 + 𝑦)))
44 fveq1 6228 . . . . . . . . 9 (𝑓 = 𝐹 → (𝑓𝑥) = (𝐹𝑥))
45 fveq1 6228 . . . . . . . . 9 (𝑓 = 𝐹 → (𝑓𝑦) = (𝐹𝑦))
4644, 45oveq12d 6708 . . . . . . . 8 (𝑓 = 𝐹 → ((𝑓𝑥) (𝑓𝑦)) = ((𝐹𝑥) (𝐹𝑦)))
4743, 46eqeq12d 2666 . . . . . . 7 (𝑓 = 𝐹 → ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ↔ (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦))))
48472ralbidv 3018 . . . . . 6 (𝑓 = 𝐹 → (∀𝑥𝐵𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ↔ ∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦))))
49 fveq1 6228 . . . . . . 7 (𝑓 = 𝐹 → (𝑓0 ) = (𝐹0 ))
5049eqeq1d 2653 . . . . . 6 (𝑓 = 𝐹 → ((𝑓0 ) = 𝑌 ↔ (𝐹0 ) = 𝑌))
5148, 50anbi12d 747 . . . . 5 (𝑓 = 𝐹 → ((∀𝑥𝐵𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓0 ) = 𝑌) ↔ (∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ∧ (𝐹0 ) = 𝑌)))
5251elrab 3396 . . . 4 (𝐹 ∈ {𝑓 ∈ (𝐶𝑚 𝐵) ∣ (∀𝑥𝐵𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓0 ) = 𝑌)} ↔ (𝐹 ∈ (𝐶𝑚 𝐵) ∧ (∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ∧ (𝐹0 ) = 𝑌)))
53 3anass 1059 . . . 4 ((𝐹:𝐵𝐶 ∧ ∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ∧ (𝐹0 ) = 𝑌) ↔ (𝐹:𝐵𝐶 ∧ (∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ∧ (𝐹0 ) = 𝑌)))
5442, 52, 533bitr4i 292 . . 3 (𝐹 ∈ {𝑓 ∈ (𝐶𝑚 𝐵) ∣ (∀𝑥𝐵𝑦𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓0 ) = 𝑌)} ↔ (𝐹:𝐵𝐶 ∧ ∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ∧ (𝐹0 ) = 𝑌))
5536, 54syl6bb 276 . 2 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ (𝐹:𝐵𝐶 ∧ ∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ∧ (𝐹0 ) = 𝑌)))
562, 55biadan2 675 1 (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝐹:𝐵𝐶 ∧ ∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ∧ (𝐹0 ) = 𝑌)))
Colors of variables: wff setvar class
Syntax hints:  wb 196  wa 383  w3a 1054   = wceq 1523  wcel 2030  wral 2941  {crab 2945  Vcvv 3231  wf 5922  cfv 5926  (class class class)co 6690  𝑚 cmap 7899  Basecbs 15904  +gcplusg 15988  0gc0g 16147  Mndcmnd 17341   MndHom cmhm 17380
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-sbc 3469  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-br 4686  df-opab 4746  df-id 5053  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-fv 5934  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-map 7901  df-mhm 17382
This theorem is referenced by:  mhmf  17387  mhmpropd  17388  mhmlin  17389  mhm0  17390  idmhm  17391  mhmf1o  17392  0mhm  17405  resmhm  17406  resmhm2  17407  resmhm2b  17408  mhmco  17409  prdspjmhm  17414  pwsdiagmhm  17416  pwsco1mhm  17417  pwsco2mhm  17418  frmdup1  17448  mhmfmhm  17585  ghmmhm  17717  frgpmhm  18224  mulgmhm  18279  srglmhm  18581  srgrmhm  18582  dfrhm2  18765  isrhm2d  18776  expmhm  19863  mat1mhm  20338  scmatmhm  20388  mat2pmatmhm  20586  pm2mpmhm  20673  dchrelbas3  25008  xrge0iifmhm  30113  esumcocn  30270  elmrsubrn  31543  deg1mhm  38102  ismhm0  42130  mhmismgmhm  42131  c0mhm  42235
  Copyright terms: Public domain W3C validator