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

Theorem mhmrcl2 19033
Description: Reverse closure of a monoid homomorphism. (Contributed by Mario Carneiro, 7-Mar-2015.)
Assertion
Ref Expression
mhmrcl2 (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝑇 ∈ Mnd)

Proof of Theorem mhmrcl2
Dummy variables 𝑓 𝑠 𝑡 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-mhm 19028 . 2 MndHom = (𝑠 ∈ Mnd, 𝑡 ∈ Mnd ↦ {𝑓 ∈ ((Base‘𝑡) ↑m (Base‘𝑠)) ∣ (∀𝑥 ∈ (Base‘𝑠)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g‘𝑠)𝑦)) = ((𝑓‘𝑥)(+g‘𝑡)(𝑓‘𝑦)) ∧ (𝑓‘(0g‘𝑠)) = (0g‘𝑡))})
21elmpocl2 7696 1 (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝑇 ∈ Mnd)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416  ‘cfv 6566  (class class class)co 7451   ↑m cmap 8885  Basecbs 17431  +gcplusg 17472  0gc0g 17660  Mndcmnd 18973   MndHom cmhm 19026
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-xp 5664  df-dm 5668  df-iota 6520  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-mhm 19028
This theorem is used by:  mhmf1o  19041  resmhm  19066  mhmco  19069  mhmima  19071  pwsco2mhm  19079  gsumwmhm  19091  mhmmulg  19375  mhmhmeotmd  34670
  Copyright terms: Public domain W3C validator