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

Theorem resmhm 17802
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 17782 . . 3 (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝑇 ∈ Mnd)
2 resmhm.u . . . 4 𝑈 = (𝑆s 𝑋)
32submmnd 17797 . . 3 (𝑋 ∈ (SubMnd‘𝑆) → 𝑈 ∈ Mnd)
41, 3anim12ci 613 . 2 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝑈 ∈ Mnd ∧ 𝑇 ∈ Mnd))
5 eqid 2797 . . . . . 6 (Base‘𝑆) = (Base‘𝑆)
6 eqid 2797 . . . . . 6 (Base‘𝑇) = (Base‘𝑇)
75, 6mhmf 17783 . . . . 5 (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
85submss 17793 . . . . 5 (𝑋 ∈ (SubMnd‘𝑆) → 𝑋 ⊆ (Base‘𝑆))
9 fssres 6419 . . . . 5 ((𝐹:(Base‘𝑆)⟶(Base‘𝑇) ∧ 𝑋 ⊆ (Base‘𝑆)) → (𝐹𝑋):𝑋⟶(Base‘𝑇))
107, 8, 9syl2an 595 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹𝑋):𝑋⟶(Base‘𝑇))
118adantl 482 . . . . . 6 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → 𝑋 ⊆ (Base‘𝑆))
122, 5ressbas2 16388 . . . . . 6 (𝑋 ⊆ (Base‘𝑆) → 𝑋 = (Base‘𝑈))
1311, 12syl 17 . . . . 5 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → 𝑋 = (Base‘𝑈))
1413feq2d 6375 . . . 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 3896 . . . . . . 7 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝑥 ∈ (Base‘𝑆))
20 simprr 769 . . . . . . . 8 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝑦𝑋)
2117, 20sseldd 3896 . . . . . . 7 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝑦 ∈ (Base‘𝑆))
22 eqid 2797 . . . . . . . 8 (+g𝑆) = (+g𝑆)
23 eqid 2797 . . . . . . . 8 (+g𝑇) = (+g𝑇)
245, 22, 23mhmlin 17785 . . . . . . 7 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
2516, 19, 21, 24syl3anc 1364 . . . . . 6 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
2622submcl 17796 . . . . . . . . 9 ((𝑋 ∈ (SubMnd‘𝑆) ∧ 𝑥𝑋𝑦𝑋) → (𝑥(+g𝑆)𝑦) ∈ 𝑋)
27263expb 1113 . . . . . . . 8 ((𝑋 ∈ (SubMnd‘𝑆) ∧ (𝑥𝑋𝑦𝑋)) → (𝑥(+g𝑆)𝑦) ∈ 𝑋)
2827adantll 710 . . . . . . 7 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → (𝑥(+g𝑆)𝑦) ∈ 𝑋)
2928fvresd 6565 . . . . . 6 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (𝐹‘(𝑥(+g𝑆)𝑦)))
30 fvres 6564 . . . . . . . 8 (𝑥𝑋 → ((𝐹𝑋)‘𝑥) = (𝐹𝑥))
31 fvres 6564 . . . . . . . 8 (𝑦𝑋 → ((𝐹𝑋)‘𝑦) = (𝐹𝑦))
3230, 31oveqan12d 7042 . . . . . . 7 ((𝑥𝑋𝑦𝑋) → (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
3332adantl 482 . . . . . 6 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
3425, 29, 333eqtr4d 2843 . . . . 5 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)))
3534ralrimivva 3160 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ∀𝑥𝑋𝑦𝑋 ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)))
362, 22ressplusg 16445 . . . . . . . . 9 (𝑋 ∈ (SubMnd‘𝑆) → (+g𝑆) = (+g𝑈))
3736adantl 482 . . . . . . . 8 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (+g𝑆) = (+g𝑈))
3837oveqd 7040 . . . . . . 7 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝑥(+g𝑆)𝑦) = (𝑥(+g𝑈)𝑦))
3938fveqeq2d 6553 . . . . . 6 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ↔ ((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦))))
4013, 39raleqbidv 3363 . . . . 5 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (∀𝑦𝑋 ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ↔ ∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦))))
4113, 40raleqbidv 3363 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (∀𝑥𝑋𝑦𝑋 ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ↔ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦))))
4235, 41mpbid 233 . . 3 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)))
43 eqid 2797 . . . . . . 7 (0g𝑆) = (0g𝑆)
4443subm0cl 17795 . . . . . 6 (𝑋 ∈ (SubMnd‘𝑆) → (0g𝑆) ∈ 𝑋)
4544adantl 482 . . . . 5 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (0g𝑆) ∈ 𝑋)
4645fvresd 6565 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋)‘(0g𝑆)) = (𝐹‘(0g𝑆)))
472, 43subm0 17799 . . . . . 6 (𝑋 ∈ (SubMnd‘𝑆) → (0g𝑆) = (0g𝑈))
4847adantl 482 . . . . 5 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (0g𝑆) = (0g𝑈))
4948fveq2d 6549 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋)‘(0g𝑆)) = ((𝐹𝑋)‘(0g𝑈)))
50 eqid 2797 . . . . . 6 (0g𝑇) = (0g𝑇)
5143, 50mhm0 17786 . . . . 5 (𝐹 ∈ (𝑆 MndHom 𝑇) → (𝐹‘(0g𝑆)) = (0g𝑇))
5251adantr 481 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹‘(0g𝑆)) = (0g𝑇))
5346, 49, 523eqtr3d 2841 . . 3 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋)‘(0g𝑈)) = (0g𝑇))
5415, 42, 533jca 1121 . 2 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋):(Base‘𝑈)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ∧ ((𝐹𝑋)‘(0g𝑈)) = (0g𝑇)))
55 eqid 2797 . . 3 (Base‘𝑈) = (Base‘𝑈)
56 eqid 2797 . . 3 (+g𝑈) = (+g𝑈)
57 eqid 2797 . . 3 (0g𝑈) = (0g𝑈)
5855, 6, 56, 23, 57, 50ismhm 17780 . 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 1080   = wceq 1525  wcel 2083  wral 3107  wss 3865  cres 5452  wf 6228  cfv 6232  (class class class)co 7023  Basecbs 16316  s cress 16317  +gcplusg 16398  0gc0g 16546  Mndcmnd 17737   MndHom cmhm 17776  SubMndcsubmnd 17777
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1781  ax-4 1795  ax-5 1892  ax-6 1951  ax-7 1996  ax-8 2085  ax-9 2093  ax-10 2114  ax-11 2128  ax-12 2143  ax-13 2346  ax-ext 2771  ax-sep 5101  ax-nul 5108  ax-pow 5164  ax-pr 5228  ax-un 7326  ax-cnex 10446  ax-resscn 10447  ax-1cn 10448  ax-icn 10449  ax-addcl 10450  ax-addrcl 10451  ax-mulcl 10452  ax-mulrcl 10453  ax-mulcom 10454  ax-addass 10455  ax-mulass 10456  ax-distr 10457  ax-i2m1 10458  ax-1ne0 10459  ax-1rid 10460  ax-rnegex 10461  ax-rrecex 10462  ax-cnre 10463  ax-pre-lttri 10464  ax-pre-lttrn 10465  ax-pre-ltadd 10466  ax-pre-mulgt0 10467
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-3or 1081  df-3an 1082  df-tru 1528  df-ex 1766  df-nf 1770  df-sb 2045  df-mo 2578  df-eu 2614  df-clab 2778  df-cleq 2790  df-clel 2865  df-nfc 2937  df-ne 2987  df-nel 3093  df-ral 3112  df-rex 3113  df-reu 3114  df-rmo 3115  df-rab 3116  df-v 3442  df-sbc 3712  df-csb 3818  df-dif 3868  df-un 3870  df-in 3872  df-ss 3880  df-pss 3882  df-nul 4218  df-if 4388  df-pw 4461  df-sn 4479  df-pr 4481  df-tp 4483  df-op 4485  df-uni 4752  df-iun 4833  df-br 4969  df-opab 5031  df-mpt 5048  df-tr 5071  df-id 5355  df-eprel 5360  df-po 5369  df-so 5370  df-fr 5409  df-we 5411  df-xp 5456  df-rel 5457  df-cnv 5458  df-co 5459  df-dm 5460  df-rn 5461  df-res 5462  df-ima 5463  df-pred 6030  df-ord 6076  df-on 6077  df-lim 6078  df-suc 6079  df-iota 6196  df-fun 6234  df-fn 6235  df-f 6236  df-f1 6237  df-fo 6238  df-f1o 6239  df-fv 6240  df-riota 6984  df-ov 7026  df-oprab 7027  df-mpo 7028  df-om 7444  df-wrecs 7805  df-recs 7867  df-rdg 7905  df-er 8146  df-map 8265  df-en 8365  df-dom 8366  df-sdom 8367  df-pnf 10530  df-mnf 10531  df-xr 10532  df-ltxr 10533  df-le 10534  df-sub 10725  df-neg 10726  df-nn 11493  df-2 11554  df-ndx 16319  df-slot 16320  df-base 16322  df-sets 16323  df-ress 16324  df-plusg 16411  df-0g 16548  df-mgm 17685  df-sgrp 17727  df-mnd 17738  df-mhm 17778  df-submnd 17779
This theorem is referenced by:  resrhm  19258  dchrghm  25518
  Copyright terms: Public domain W3C validator