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

Theorem resmhm 18910
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 18877 . . 3 (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝑇 ∈ Mnd)
2 resmhm.u . . . 4 𝑈 = (𝑆s 𝑋)
32submmnd 18903 . . 3 (𝑋 ∈ (SubMnd‘𝑆) → 𝑈 ∈ Mnd)
41, 3anim12ci 626 . 2 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝑈 ∈ Mnd ∧ 𝑇 ∈ Mnd))
5 eqid 2766 . . . . . 6 (Base‘𝑆) = (Base‘𝑆)
6 eqid 2766 . . . . . 6 (Base‘𝑇) = (Base‘𝑇)
75, 6mhmf 18878 . . . . 5 (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
85submss 18898 . . . . 5 (𝑋 ∈ (SubMnd‘𝑆) → 𝑋 ⊆ (Base‘𝑆))
9 fssres 6751 . . . . 5 ((𝐹:(Base‘𝑆)⟶(Base‘𝑇) ∧ 𝑋 ⊆ (Base‘𝑆)) → (𝐹𝑋):𝑋⟶(Base‘𝑇))
107, 8, 9syl2an 608 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹𝑋):𝑋⟶(Base‘𝑇))
118adantl 487 . . . . . 6 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → 𝑋 ⊆ (Base‘𝑆))
122, 5ressbas2 17323 . . . . . 6 (𝑋 ⊆ (Base‘𝑆) → 𝑋 = (Base‘𝑈))
1311, 12syl 18 . . . . 5 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → 𝑋 = (Base‘𝑈))
1413feq2d 6696 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋):𝑋⟶(Base‘𝑇) ↔ (𝐹𝑋):(Base‘𝑈)⟶(Base‘𝑇)))
1510, 14mpbid 235 . . 3 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹𝑋):(Base‘𝑈)⟶(Base‘𝑇))
16 simpll 779 . . . . . . 7 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝐹 ∈ (𝑆 MndHom 𝑇))
178ad2antlr 740 . . . . . . . 8 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝑋 ⊆ (Base‘𝑆))
18 simprl 783 . . . . . . . 8 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝑥𝑋)
1917, 18sseldd 3941 . . . . . . 7 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝑥 ∈ (Base‘𝑆))
20 simprr 785 . . . . . . . 8 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝑦𝑋)
2117, 20sseldd 3941 . . . . . . 7 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝑦 ∈ (Base‘𝑆))
22 eqid 2766 . . . . . . . 8 (+g𝑆) = (+g𝑆)
23 eqid 2766 . . . . . . . 8 (+g𝑇) = (+g𝑇)
245, 22, 23mhmlin 18882 . . . . . . 7 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
2516, 19, 21, 24syl3anc 1398 . . . . . 6 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
2622submcl 18901 . . . . . . . . 9 ((𝑋 ∈ (SubMnd‘𝑆) ∧ 𝑥𝑋𝑦𝑋) → (𝑥(+g𝑆)𝑦) ∈ 𝑋)
27263expb 1138 . . . . . . . 8 ((𝑋 ∈ (SubMnd‘𝑆) ∧ (𝑥𝑋𝑦𝑋)) → (𝑥(+g𝑆)𝑦) ∈ 𝑋)
2827adantll 727 . . . . . . 7 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → (𝑥(+g𝑆)𝑦) ∈ 𝑋)
2928fvresd 6908 . . . . . 6 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (𝐹‘(𝑥(+g𝑆)𝑦)))
30 fvres 6907 . . . . . . . 8 (𝑥𝑋 → ((𝐹𝑋)‘𝑥) = (𝐹𝑥))
31 fvres 6907 . . . . . . . 8 (𝑦𝑋 → ((𝐹𝑋)‘𝑦) = (𝐹𝑦))
3230, 31oveqan12d 7442 . . . . . . 7 ((𝑥𝑋𝑦𝑋) → (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
3332adantl 487 . . . . . 6 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
3425, 29, 333eqtr4d 2811 . . . . 5 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)))
3534ralrimivva 3211 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ∀𝑥𝑋𝑦𝑋 ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)))
362, 22ressplusg 17369 . . . . . . . . 9 (𝑋 ∈ (SubMnd‘𝑆) → (+g𝑆) = (+g𝑈))
3736adantl 487 . . . . . . . 8 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (+g𝑆) = (+g𝑈))
3837oveqd 7440 . . . . . . 7 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝑥(+g𝑆)𝑦) = (𝑥(+g𝑈)𝑦))
3938fveqeq2d 6896 . . . . . 6 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ↔ ((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦))))
4013, 39raleqbidv 3341 . . . . 5 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (∀𝑦𝑋 ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ↔ ∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦))))
4113, 40raleqbidv 3341 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (∀𝑥𝑋𝑦𝑋 ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ↔ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦))))
4235, 41mpbid 235 . . 3 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)))
43 eqid 2766 . . . . . . 7 (0g𝑆) = (0g𝑆)
4443subm0cl 18900 . . . . . 6 (𝑋 ∈ (SubMnd‘𝑆) → (0g𝑆) ∈ 𝑋)
4544adantl 487 . . . . 5 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (0g𝑆) ∈ 𝑋)
4645fvresd 6908 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋)‘(0g𝑆)) = (𝐹‘(0g𝑆)))
472, 43subm0 18905 . . . . . 6 (𝑋 ∈ (SubMnd‘𝑆) → (0g𝑆) = (0g𝑈))
4847adantl 487 . . . . 5 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (0g𝑆) = (0g𝑈))
4948fveq2d 6892 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋)‘(0g𝑆)) = ((𝐹𝑋)‘(0g𝑈)))
50 eqid 2766 . . . . . 6 (0g𝑇) = (0g𝑇)
5143, 50mhm0 18883 . . . . 5 (𝐹 ∈ (𝑆 MndHom 𝑇) → (𝐹‘(0g𝑆)) = (0g𝑇))
5251adantr 486 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹‘(0g𝑆)) = (0g𝑇))
5346, 49, 523eqtr3d 2809 . . 3 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋)‘(0g𝑈)) = (0g𝑇))
5415, 42, 533jca 1146 . 2 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋):(Base‘𝑈)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ∧ ((𝐹𝑋)‘(0g𝑈)) = (0g𝑇)))
55 eqid 2766 . . 3 (Base‘𝑈) = (Base‘𝑈)
56 eqid 2766 . . 3 (+g𝑈) = (+g𝑈)
57 eqid 2766 . . 3 (0g𝑈) = (0g𝑈)
5855, 6, 56, 23, 57, 50ismhm 18874 . 2 ((𝐹𝑋) ∈ (𝑈 MndHom 𝑇) ↔ ((𝑈 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ ((𝐹𝑋):(Base‘𝑈)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ∧ ((𝐹𝑋)‘(0g𝑈)) = (0g𝑇))))
594, 54, 58sylanbrc 595 1 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹𝑋) ∈ (𝑈 MndHom 𝑇))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  w3a 1103   = wceq 1570  wcel 2146  wral 3082  wss 3908  cres 5668  wf 6539  cfv 6543  (class class class)co 7423  Basecbs 17294  s cress 17315  +gcplusg 17335  0gc0g 17517  Mndcmnd 18821   MndHom cmhm 18870  SubMndcsubmnd 18871
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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745  ax-cnex 11174  ax-resscn 11175  ax-1cn 11176  ax-icn 11177  ax-addcl 11178  ax-addrcl 11179  ax-mulcl 11180  ax-mulrcl 11181  ax-mulcom 11182  ax-addass 11183  ax-mulass 11184  ax-distr 11185  ax-i2m1 11186  ax-1ne0 11187  ax-1rid 11188  ax-rnegex 11189  ax-rrecex 11190  ax-cnre 11191  ax-pre-lttri 11192  ax-pre-lttrn 11193  ax-pre-ltadd 11194  ax-pre-mulgt0 11195
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-nel 3068  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309  df-ord 6370  df-on 6371  df-lim 6372  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-om 7872  df-2nd 7996  df-frecs 8287  df-wrecs 8318  df-recs 8367  df-rdg 8406  df-er 8703  df-map 8835  df-en 8953  df-dom 8954  df-sdom 8955  df-pnf 11263  df-mnf 11264  df-xr 11265  df-ltxr 11266  df-le 11267  df-sub 11461  df-neg 11462  df-nn 12252  df-2 12321  df-sets 17249  df-slot 17267  df-ndx 17279  df-base 17295  df-ress 17316  df-plusg 17348  df-0g 17519  df-mgm 18723  df-sgrp 18806  df-mnd 18822  df-mhm 18872  df-submnd 18873
This theorem is used by:  resrhm  20737  dchrghm  27457
  Copyright terms: Public domain W3C validator