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

Theorem resmhm 18747
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 18715 . . 3 (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝑇 ∈ Mnd)
2 resmhm.u . . . 4 𝑈 = (𝑆s 𝑋)
32submmnd 18740 . . 3 (𝑋 ∈ (SubMnd‘𝑆) → 𝑈 ∈ Mnd)
41, 3anim12ci 614 . 2 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝑈 ∈ Mnd ∧ 𝑇 ∈ Mnd))
5 eqid 2729 . . . . . 6 (Base‘𝑆) = (Base‘𝑆)
6 eqid 2729 . . . . . 6 (Base‘𝑇) = (Base‘𝑇)
75, 6mhmf 18716 . . . . 5 (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
85submss 18736 . . . . 5 (𝑋 ∈ (SubMnd‘𝑆) → 𝑋 ⊆ (Base‘𝑆))
9 fssres 6726 . . . . 5 ((𝐹:(Base‘𝑆)⟶(Base‘𝑇) ∧ 𝑋 ⊆ (Base‘𝑆)) → (𝐹𝑋):𝑋⟶(Base‘𝑇))
107, 8, 9syl2an 596 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹𝑋):𝑋⟶(Base‘𝑇))
118adantl 481 . . . . . 6 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → 𝑋 ⊆ (Base‘𝑆))
122, 5ressbas2 17208 . . . . . 6 (𝑋 ⊆ (Base‘𝑆) → 𝑋 = (Base‘𝑈))
1311, 12syl 17 . . . . 5 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → 𝑋 = (Base‘𝑈))
1413feq2d 6672 . . . 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 3947 . . . . . . 7 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝑥 ∈ (Base‘𝑆))
20 simprr 772 . . . . . . . 8 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝑦𝑋)
2117, 20sseldd 3947 . . . . . . 7 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → 𝑦 ∈ (Base‘𝑆))
22 eqid 2729 . . . . . . . 8 (+g𝑆) = (+g𝑆)
23 eqid 2729 . . . . . . . 8 (+g𝑇) = (+g𝑇)
245, 22, 23mhmlin 18720 . . . . . . 7 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
2516, 19, 21, 24syl3anc 1373 . . . . . 6 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
2622submcl 18739 . . . . . . . . 9 ((𝑋 ∈ (SubMnd‘𝑆) ∧ 𝑥𝑋𝑦𝑋) → (𝑥(+g𝑆)𝑦) ∈ 𝑋)
27263expb 1120 . . . . . . . 8 ((𝑋 ∈ (SubMnd‘𝑆) ∧ (𝑥𝑋𝑦𝑋)) → (𝑥(+g𝑆)𝑦) ∈ 𝑋)
2827adantll 714 . . . . . . 7 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → (𝑥(+g𝑆)𝑦) ∈ 𝑋)
2928fvresd 6878 . . . . . 6 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (𝐹‘(𝑥(+g𝑆)𝑦)))
30 fvres 6877 . . . . . . . 8 (𝑥𝑋 → ((𝐹𝑋)‘𝑥) = (𝐹𝑥))
31 fvres 6877 . . . . . . . 8 (𝑦𝑋 → ((𝐹𝑋)‘𝑦) = (𝐹𝑦))
3230, 31oveqan12d 7406 . . . . . . 7 ((𝑥𝑋𝑦𝑋) → (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
3332adantl 481 . . . . . 6 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
3425, 29, 333eqtr4d 2774 . . . . 5 (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥𝑋𝑦𝑋)) → ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)))
3534ralrimivva 3180 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ∀𝑥𝑋𝑦𝑋 ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)))
362, 22ressplusg 17254 . . . . . . . . 9 (𝑋 ∈ (SubMnd‘𝑆) → (+g𝑆) = (+g𝑈))
3736adantl 481 . . . . . . . 8 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (+g𝑆) = (+g𝑈))
3837oveqd 7404 . . . . . . 7 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝑥(+g𝑆)𝑦) = (𝑥(+g𝑈)𝑦))
3938fveqeq2d 6866 . . . . . 6 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ↔ ((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦))))
4013, 39raleqbidv 3319 . . . . 5 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (∀𝑦𝑋 ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ↔ ∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦))))
4113, 40raleqbidv 3319 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (∀𝑥𝑋𝑦𝑋 ((𝐹𝑋)‘(𝑥(+g𝑆)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ↔ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦))))
4235, 41mpbid 232 . . 3 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)))
43 eqid 2729 . . . . . . 7 (0g𝑆) = (0g𝑆)
4443subm0cl 18738 . . . . . 6 (𝑋 ∈ (SubMnd‘𝑆) → (0g𝑆) ∈ 𝑋)
4544adantl 481 . . . . 5 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (0g𝑆) ∈ 𝑋)
4645fvresd 6878 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋)‘(0g𝑆)) = (𝐹‘(0g𝑆)))
472, 43subm0 18742 . . . . . 6 (𝑋 ∈ (SubMnd‘𝑆) → (0g𝑆) = (0g𝑈))
4847adantl 481 . . . . 5 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (0g𝑆) = (0g𝑈))
4948fveq2d 6862 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋)‘(0g𝑆)) = ((𝐹𝑋)‘(0g𝑈)))
50 eqid 2729 . . . . . 6 (0g𝑇) = (0g𝑇)
5143, 50mhm0 18721 . . . . 5 (𝐹 ∈ (𝑆 MndHom 𝑇) → (𝐹‘(0g𝑆)) = (0g𝑇))
5251adantr 480 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹‘(0g𝑆)) = (0g𝑇))
5346, 49, 523eqtr3d 2772 . . 3 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋)‘(0g𝑈)) = (0g𝑇))
5415, 42, 533jca 1128 . 2 ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹𝑋):(Base‘𝑈)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹𝑋)‘(𝑥(+g𝑈)𝑦)) = (((𝐹𝑋)‘𝑥)(+g𝑇)((𝐹𝑋)‘𝑦)) ∧ ((𝐹𝑋)‘(0g𝑈)) = (0g𝑇)))
55 eqid 2729 . . 3 (Base‘𝑈) = (Base‘𝑈)
56 eqid 2729 . . 3 (+g𝑈) = (+g𝑈)
57 eqid 2729 . . 3 (0g𝑈) = (0g𝑈)
5855, 6, 56, 23, 57, 50ismhm 18712 . 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 2109  wral 3044  wss 3914  cres 5640  wf 6507  cfv 6511  (class class class)co 7387  Basecbs 17179  s cress 17200  +gcplusg 17220  0gc0g 17402  Mndcmnd 18661   MndHom cmhm 18708  SubMndcsubmnd 18709
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 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711  ax-cnex 11124  ax-resscn 11125  ax-1cn 11126  ax-icn 11127  ax-addcl 11128  ax-addrcl 11129  ax-mulcl 11130  ax-mulrcl 11131  ax-mulcom 11132  ax-addass 11133  ax-mulass 11134  ax-distr 11135  ax-i2m1 11136  ax-1ne0 11137  ax-1rid 11138  ax-rnegex 11139  ax-rrecex 11140  ax-cnre 11141  ax-pre-lttri 11142  ax-pre-lttrn 11143  ax-pre-ltadd 11144  ax-pre-mulgt0 11145
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 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-om 7843  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-er 8671  df-map 8801  df-en 8919  df-dom 8920  df-sdom 8921  df-pnf 11210  df-mnf 11211  df-xr 11212  df-ltxr 11213  df-le 11214  df-sub 11407  df-neg 11408  df-nn 12187  df-2 12249  df-sets 17134  df-slot 17152  df-ndx 17164  df-base 17180  df-ress 17201  df-plusg 17233  df-0g 17404  df-mgm 18567  df-sgrp 18646  df-mnd 18662  df-mhm 18710  df-submnd 18711
This theorem is referenced by:  resrhm  20510  dchrghm  27167
  Copyright terms: Public domain W3C validator