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

Theorem resmhm 17973
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 17948 . . 3 (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝑇 ∈ Mnd)
2 resmhm.u . . . 4 𝑈 = (𝑆s 𝑋)
32submmnd 17966 . . 3 (𝑋 ∈ (SubMnd‘𝑆) → 𝑈 ∈ Mnd)
41, 3anim12ci 613 . 2 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝑈 ∈ Mnd ∧ 𝑇 ∈ Mnd))
5 eqid 2818 . . . . . 6 (Base‘𝑆) = (Base‘𝑆)
6 eqid 2818 . . . . . 6 (Base‘𝑇) = (Base‘𝑇)
75, 6mhmf 17949 . . . . 5 (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
85submss 17962 . . . . 5 (𝑋 ∈ (SubMnd‘𝑆) → 𝑋 ⊆ (Base‘𝑆))
9 fssres 6537 . . . . 5 ((𝐹:(Base‘𝑆)⟶(Base‘𝑇) ∧ 𝑋 ⊆ (Base‘𝑆)) → (𝐹𝑋):𝑋⟶(Base‘𝑇))
107, 8, 9syl2an 595 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹𝑋):𝑋⟶(Base‘𝑇))
118adantl 482 . . . . . 6 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → 𝑋 ⊆ (Base‘𝑆))
122, 5ressbas2 16543 . . . . . 6 (𝑋 ⊆ (Base‘𝑆) → 𝑋 = (Base‘𝑈))
1311, 12syl 17 . . . . 5 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → 𝑋 = (Base‘𝑈))
1413feq2d 6493 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋):𝑋⟶(Base‘𝑇) ↔ (𝐹𝑋):(Base‘𝑈)⟶(Base‘𝑇)))
1510, 14mpbid 233 . . 3 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹𝑋):(Base‘𝑈)⟶(Base‘𝑇))
16 simpll 763 . . . . . . 7 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝐹 ∈ (𝑆 MndHom 𝑇))
178ad2antlr 723 . . . . . . . 8 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝑋 ⊆ (Base‘𝑆))
18 simprl 767 . . . . . . . 8 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝑥𝑋)
1917, 18sseldd 3965 . . . . . . 7 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝑥 ∈ (Base‘𝑆))
20 simprr 769 . . . . . . . 8 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝑦𝑋)
2117, 20sseldd 3965 . . . . . . 7 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝑦 ∈ (Base‘𝑆))
22 eqid 2818 . . . . . . . 8 (+g𝑆) = (+g𝑆)
23 eqid 2818 . . . . . . . 8 (+g𝑇) = (+g𝑇)
245, 22, 23mhmlin 17951 . . . . . . 7 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
2516, 19, 21, 24syl3anc 1363 . . . . . 6 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
2622submcl 17965 . . . . . . . . 9 ((𝑋 ∈ (SubMnd‘𝑆) ∧ 𝑥𝑋𝑦𝑋) → (𝑥(+g𝑆)𝑦) ∈ 𝑋)
27263expb 1112 . . . . . . . 8 ((𝑋 ∈ (SubMnd‘𝑆) ∧ (𝑥𝑋𝑦𝑋)) → (𝑥(+g𝑆)𝑦) ∈ 𝑋)
2827adantll 710 . . . . . . 7 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → (𝑥(+g𝑆)𝑦) ∈ 𝑋)
2928fvresd 6683 . . . . . 6 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (𝐹‘(𝑥(+g𝑆)𝑦)))
30 fvres 6682 . . . . . . . 8 (𝑥𝑋 → ((𝐹𝑋)‘𝑥) = (𝐹𝑥))
31 fvres 6682 . . . . . . . 8 (𝑦𝑋 → ((𝐹𝑋)‘𝑦) = (𝐹𝑦))
3230, 31oveqan12d 7164 . . . . . . 7 ((𝑥𝑋𝑦𝑋) → (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
3332adantl 482 . . . . . 6 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
3425, 29, 333eqtr4d 2863 . . . . 5 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)))
3534ralrimivva 3188 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ∀𝑥𝑋𝑦𝑋 ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)))
362, 22ressplusg 16600 . . . . . . . . 9 (𝑋 ∈ (SubMnd‘𝑆) → (+g𝑆) = (+g𝑈))
3736adantl 482 . . . . . . . 8 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (+g𝑆) = (+g𝑈))
3837oveqd 7162 . . . . . . 7 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝑥(+g𝑆)𝑦) = (𝑥(+g𝑈)𝑦))
3938fveqeq2d 6671 . . . . . 6 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ↔ ((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦))))
4013, 39raleqbidv 3399 . . . . 5 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (∀𝑦𝑋 ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ↔ ∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦))))
4113, 40raleqbidv 3399 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (∀𝑥𝑋𝑦𝑋 ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ↔ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦))))
4235, 41mpbid 233 . . 3 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)))
43 eqid 2818 . . . . . . 7 (0g𝑆) = (0g𝑆)
4443subm0cl 17964 . . . . . 6 (𝑋 ∈ (SubMnd‘𝑆) → (0g𝑆) ∈ 𝑋)
4544adantl 482 . . . . 5 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (0g𝑆) ∈ 𝑋)
4645fvresd 6683 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋)‘(0g𝑆)) = (𝐹‘(0g𝑆)))
472, 43subm0 17968 . . . . . 6 (𝑋 ∈ (SubMnd‘𝑆) → (0g𝑆) = (0g𝑈))
4847adantl 482 . . . . 5 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (0g𝑆) = (0g𝑈))
4948fveq2d 6667 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋)‘(0g𝑆)) = ((𝐹𝑋)‘(0g𝑈)))
50 eqid 2818 . . . . . 6 (0g𝑇) = (0g𝑇)
5143, 50mhm0 17952 . . . . 5 (𝐹 ∈ (𝑆 MndHom 𝑇) → (𝐹‘(0g𝑆)) = (0g𝑇))
5251adantr 481 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹‘(0g𝑆)) = (0g𝑇))
5346, 49, 523eqtr3d 2861 . . 3 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋)‘(0g𝑈)) = (0g𝑇))
5415, 42, 533jca 1120 . 2 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋):(Base‘𝑈)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ∧ ((𝐹𝑋)‘(0g𝑈)) = (0g𝑇)))
55 eqid 2818 . . 3 (Base‘𝑈) = (Base‘𝑈)
56 eqid 2818 . . 3 (+g𝑈) = (+g𝑈)
57 eqid 2818 . . 3 (0g𝑈) = (0g𝑈)
5855, 6, 56, 23, 57, 50ismhm 17946 . 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 396  w3a 1079   = wceq 1528  wcel 2105  wral 3135  wss 3933  cres 5550  wf 6344  cfv 6348  (class class class)co 7145  Basecbs 16471  s cress 16472  +gcplusg 16553  0gc0g 16701  Mndcmnd 17899   MndHom cmhm 17942  SubMndcsubmnd 17943
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7450  ax-cnex 10581  ax-resscn 10582  ax-1cn 10583  ax-icn 10584  ax-addcl 10585  ax-addrcl 10586  ax-mulcl 10587  ax-mulrcl 10588  ax-mulcom 10589  ax-addass 10590  ax-mulass 10591  ax-distr 10592  ax-i2m1 10593  ax-1ne0 10594  ax-1rid 10595  ax-rnegex 10596  ax-rrecex 10597  ax-cnre 10598  ax-pre-lttri 10599  ax-pre-lttrn 10600  ax-pre-ltadd 10601  ax-pre-mulgt0 10602
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3or 1080  df-3an 1081  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2615  df-eu 2647  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ne 3014  df-nel 3121  df-ral 3140  df-rex 3141  df-reu 3142  df-rmo 3143  df-rab 3144  df-v 3494  df-sbc 3770  df-csb 3881  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-pss 3951  df-nul 4289  df-if 4464  df-pw 4537  df-sn 4558  df-pr 4560  df-tp 4562  df-op 4564  df-uni 4831  df-iun 4912  df-br 5058  df-opab 5120  df-mpt 5138  df-tr 5164  df-id 5453  df-eprel 5458  df-po 5467  df-so 5468  df-fr 5507  df-we 5509  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-pred 6141  df-ord 6187  df-on 6188  df-lim 6189  df-suc 6190  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-riota 7103  df-ov 7148  df-oprab 7149  df-mpo 7150  df-om 7570  df-wrecs 7936  df-recs 7997  df-rdg 8035  df-er 8278  df-map 8397  df-en 8498  df-dom 8499  df-sdom 8500  df-pnf 10665  df-mnf 10666  df-xr 10667  df-ltxr 10668  df-le 10669  df-sub 10860  df-neg 10861  df-nn 11627  df-2 11688  df-ndx 16474  df-slot 16475  df-base 16477  df-sets 16478  df-ress 16479  df-plusg 16566  df-0g 16703  df-mgm 17840  df-sgrp 17889  df-mnd 17900  df-mhm 17944  df-submnd 17945
This theorem is referenced by:  resrhm  19493  dchrghm  25759
  Copyright terms: Public domain W3C validator