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

Theorem resmhm 18798
Description: Restriction of a monoid homomorphism to a submonoid is a homomorphism. (Contributed by Mario Carneiro, 12-Mar-2015.)
Hypothesis
Ref Expression
resmhm.u 𝑈 = (𝑆s 𝑋)
Assertion
Ref Expression
resmhm ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹𝑋) ∈ (𝑈 MndHom 𝑇))

Proof of Theorem resmhm
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mhmrcl2 18766 . . 3 (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝑇 ∈ Mnd)
2 resmhm.u . . . 4 𝑈 = (𝑆s 𝑋)
32submmnd 18791 . . 3 (𝑋 ∈ (SubMnd‘𝑆) → 𝑈 ∈ Mnd)
41, 3anim12ci 614 . 2 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝑈 ∈ Mnd ∧ 𝑇 ∈ Mnd))
5 eqid 2735 . . . . . 6 (Base‘𝑆) = (Base‘𝑆)
6 eqid 2735 . . . . . 6 (Base‘𝑇) = (Base‘𝑇)
75, 6mhmf 18767 . . . . 5 (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
85submss 18787 . . . . 5 (𝑋 ∈ (SubMnd‘𝑆) → 𝑋 ⊆ (Base‘𝑆))
9 fssres 6744 . . . . 5 ((𝐹:(Base‘𝑆)⟶(Base‘𝑇) ∧ 𝑋 ⊆ (Base‘𝑆)) → (𝐹𝑋):𝑋⟶(Base‘𝑇))
107, 8, 9syl2an 596 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹𝑋):𝑋⟶(Base‘𝑇))
118adantl 481 . . . . . 6 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → 𝑋 ⊆ (Base‘𝑆))
122, 5ressbas2 17259 . . . . . 6 (𝑋 ⊆ (Base‘𝑆) → 𝑋 = (Base‘𝑈))
1311, 12syl 17 . . . . 5 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → 𝑋 = (Base‘𝑈))
1413feq2d 6692 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋):𝑋⟶(Base‘𝑇) ↔ (𝐹𝑋):(Base‘𝑈)⟶(Base‘𝑇)))
1510, 14mpbid 232 . . 3 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹𝑋):(Base‘𝑈)⟶(Base‘𝑇))
16 simpll 766 . . . . . . 7 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝐹 ∈ (𝑆 MndHom 𝑇))
178ad2antlr 727 . . . . . . . 8 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝑋 ⊆ (Base‘𝑆))
18 simprl 770 . . . . . . . 8 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝑥𝑋)
1917, 18sseldd 3959 . . . . . . 7 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝑥 ∈ (Base‘𝑆))
20 simprr 772 . . . . . . . 8 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝑦𝑋)
2117, 20sseldd 3959 . . . . . . 7 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝑦 ∈ (Base‘𝑆))
22 eqid 2735 . . . . . . . 8 (+g𝑆) = (+g𝑆)
23 eqid 2735 . . . . . . . 8 (+g𝑇) = (+g𝑇)
245, 22, 23mhmlin 18771 . . . . . . 7 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
2516, 19, 21, 24syl3anc 1373 . . . . . 6 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
2622submcl 18790 . . . . . . . . 9 ((𝑋 ∈ (SubMnd‘𝑆) ∧ 𝑥𝑋𝑦𝑋) → (𝑥(+g𝑆)𝑦) ∈ 𝑋)
27263expb 1120 . . . . . . . 8 ((𝑋 ∈ (SubMnd‘𝑆) ∧ (𝑥𝑋𝑦𝑋)) → (𝑥(+g𝑆)𝑦) ∈ 𝑋)
2827adantll 714 . . . . . . 7 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → (𝑥(+g𝑆)𝑦) ∈ 𝑋)
2928fvresd 6896 . . . . . 6 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (𝐹‘(𝑥(+g𝑆)𝑦)))
30 fvres 6895 . . . . . . . 8 (𝑥𝑋 → ((𝐹𝑋)‘𝑥) = (𝐹𝑥))
31 fvres 6895 . . . . . . . 8 (𝑦𝑋 → ((𝐹𝑋)‘𝑦) = (𝐹𝑦))
3230, 31oveqan12d 7424 . . . . . . 7 ((𝑥𝑋𝑦𝑋) → (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
3332adantl 481 . . . . . 6 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
3425, 29, 333eqtr4d 2780 . . . . 5 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)))
3534ralrimivva 3187 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ∀𝑥𝑋𝑦𝑋 ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)))
362, 22ressplusg 17305 . . . . . . . . 9 (𝑋 ∈ (SubMnd‘𝑆) → (+g𝑆) = (+g𝑈))
3736adantl 481 . . . . . . . 8 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (+g𝑆) = (+g𝑈))
3837oveqd 7422 . . . . . . 7 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝑥(+g𝑆)𝑦) = (𝑥(+g𝑈)𝑦))
3938fveqeq2d 6884 . . . . . 6 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ↔ ((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦))))
4013, 39raleqbidv 3325 . . . . 5 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (∀𝑦𝑋 ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ↔ ∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦))))
4113, 40raleqbidv 3325 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (∀𝑥𝑋𝑦𝑋 ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ↔ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦))))
4235, 41mpbid 232 . . 3 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)))
43 eqid 2735 . . . . . . 7 (0g𝑆) = (0g𝑆)
4443subm0cl 18789 . . . . . 6 (𝑋 ∈ (SubMnd‘𝑆) → (0g𝑆) ∈ 𝑋)
4544adantl 481 . . . . 5 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (0g𝑆) ∈ 𝑋)
4645fvresd 6896 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋)‘(0g𝑆)) = (𝐹‘(0g𝑆)))
472, 43subm0 18793 . . . . . 6 (𝑋 ∈ (SubMnd‘𝑆) → (0g𝑆) = (0g𝑈))
4847adantl 481 . . . . 5 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (0g𝑆) = (0g𝑈))
4948fveq2d 6880 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋)‘(0g𝑆)) = ((𝐹𝑋)‘(0g𝑈)))
50 eqid 2735 . . . . . 6 (0g𝑇) = (0g𝑇)
5143, 50mhm0 18772 . . . . 5 (𝐹 ∈ (𝑆 MndHom 𝑇) → (𝐹‘(0g𝑆)) = (0g𝑇))
5251adantr 480 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹‘(0g𝑆)) = (0g𝑇))
5346, 49, 523eqtr3d 2778 . . 3 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋)‘(0g𝑈)) = (0g𝑇))
5415, 42, 533jca 1128 . 2 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋):(Base‘𝑈)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ∧ ((𝐹𝑋)‘(0g𝑈)) = (0g𝑇)))
55 eqid 2735 . . 3 (Base‘𝑈) = (Base‘𝑈)
56 eqid 2735 . . 3 (+g𝑈) = (+g𝑈)
57 eqid 2735 . . 3 (0g𝑈) = (0g𝑈)
5855, 6, 56, 23, 57, 50ismhm 18763 . 2 ((𝐹𝑋) ∈ (𝑈 MndHom 𝑇) ↔ ((𝑈 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ ((𝐹𝑋):(Base‘𝑈)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ∧ ((𝐹𝑋)‘(0g𝑈)) = (0g𝑇))))
594, 54, 58sylanbrc 583 1 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹𝑋) ∈ (𝑈 MndHom 𝑇))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1540  wcel 2108  wral 3051  wss 3926  cres 5656  wf 6527  cfv 6531  (class class class)co 7405  Basecbs 17228  s cress 17251  +gcplusg 17271  0gc0g 17453  Mndcmnd 18712   MndHom cmhm 18759  SubMndcsubmnd 18760
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729  ax-cnex 11185  ax-resscn 11186  ax-1cn 11187  ax-icn 11188  ax-addcl 11189  ax-addrcl 11190  ax-mulcl 11191  ax-mulrcl 11192  ax-mulcom 11193  ax-addass 11194  ax-mulass 11195  ax-distr 11196  ax-i2m1 11197  ax-1ne0 11198  ax-1rid 11199  ax-rnegex 11200  ax-rrecex 11201  ax-cnre 11202  ax-pre-lttri 11203  ax-pre-lttrn 11204  ax-pre-ltadd 11205  ax-pre-mulgt0 11206
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-rmo 3359  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-tr 5230  df-id 5548  df-eprel 5553  df-po 5561  df-so 5562  df-fr 5606  df-we 5608  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6290  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7362  df-ov 7408  df-oprab 7409  df-mpo 7410  df-om 7862  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8385  df-rdg 8424  df-er 8719  df-map 8842  df-en 8960  df-dom 8961  df-sdom 8962  df-pnf 11271  df-mnf 11272  df-xr 11273  df-ltxr 11274  df-le 11275  df-sub 11468  df-neg 11469  df-nn 12241  df-2 12303  df-sets 17183  df-slot 17201  df-ndx 17213  df-base 17229  df-ress 17252  df-plusg 17284  df-0g 17455  df-mgm 18618  df-sgrp 18697  df-mnd 18713  df-mhm 18761  df-submnd 18762
This theorem is referenced by:  resrhm  20561  dchrghm  27219
  Copyright terms: Public domain W3C validator