Theorem resmhm 17985

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.

Step	Hyp	Ref	Expression
1		mhmrcl2 17960	. . 3 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝑇 ∈ Mnd)
2		resmhm.u	. . . 4 ⊢ 𝑈 = (𝑆 ↾s 𝑋)
3	2	submmnd 17978	. . 3 ⊢ (𝑋 ∈ (SubMnd‘𝑆) → 𝑈 ∈ Mnd)
4	1, 3	anim12ci 615	. 2 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝑈 ∈ Mnd ∧ 𝑇 ∈ Mnd))
5		eqid 2821	. . . . . 6 ⊢ (Base‘𝑆) = (Base‘𝑆)
6		eqid 2821	. . . . . 6 ⊢ (Base‘𝑇) = (Base‘𝑇)
7	5, 6	mhmf 17961	. . . . 5 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
8	5	submss 17974	. . . . 5 ⊢ (𝑋 ∈ (SubMnd‘𝑆) → 𝑋 ⊆ (Base‘𝑆))
9		fssres 6544	. . . . 5 ⊢ ((𝐹:(Base‘𝑆)⟶(Base‘𝑇) ∧ 𝑋 ⊆ (Base‘𝑆)) → (𝐹 ↾ 𝑋):𝑋⟶(Base‘𝑇))
10	7, 8, 9	syl2an 597	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹 ↾ 𝑋):𝑋⟶(Base‘𝑇))
11	8	adantl 484	. . . . . 6 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → 𝑋 ⊆ (Base‘𝑆))
12	2, 5	ressbas2 16555	. . . . . 6 ⊢ (𝑋 ⊆ (Base‘𝑆) → 𝑋 = (Base‘𝑈))
13	11, 12	syl 17	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → 𝑋 = (Base‘𝑈))
14	13	feq2d 6500	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹 ↾ 𝑋):𝑋⟶(Base‘𝑇) ↔ (𝐹 ↾ 𝑋):(Base‘𝑈)⟶(Base‘𝑇)))
15	10, 14	mpbid 234	. . 3 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹 ↾ 𝑋):(Base‘𝑈)⟶(Base‘𝑇))
16		simpll 765	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝐹 ∈ (𝑆 MndHom 𝑇))
17	8	ad2antlr 725	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑋 ⊆ (Base‘𝑆))
18		simprl 769	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑥 ∈ 𝑋)
19	17, 18	sseldd 3968	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑥 ∈ (Base‘𝑆))
20		simprr 771	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑦 ∈ 𝑋)
21	17, 20	sseldd 3968	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑦 ∈ (Base‘𝑆))
22		eqid 2821	. . . . . . . 8 ⊢ (+g‘𝑆) = (+g‘𝑆)
23		eqid 2821	. . . . . . . 8 ⊢ (+g‘𝑇) = (+g‘𝑇)
24	5, 22, 23	mhmlin 17963	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
25	16, 19, 21, 24	syl3anc 1367	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
26	22	submcl 17977	. . . . . . . . 9 ⊢ ((𝑋 ∈ (SubMnd‘𝑆) ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑥(+g‘𝑆)𝑦) ∈ 𝑋)
27	26	3expb 1116	. . . . . . . 8 ⊢ ((𝑋 ∈ (SubMnd‘𝑆) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥(+g‘𝑆)𝑦) ∈ 𝑋)
28	27	adantll 712	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥(+g‘𝑆)𝑦) ∈ 𝑋)
29	28	fvresd 6690	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑆)𝑦)) = (𝐹‘(𝑥(+g‘𝑆)𝑦)))
30		fvres 6689	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑋 → ((𝐹 ↾ 𝑋)‘𝑥) = (𝐹‘𝑥))
31		fvres 6689	. . . . . . . 8 ⊢ (𝑦 ∈ 𝑋 → ((𝐹 ↾ 𝑋)‘𝑦) = (𝐹‘𝑦))
32	30, 31	oveqan12d 7175	. . . . . . 7 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
33	32	adantl 484	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
34	25, 29, 33	3eqtr4d 2866	. . . . 5 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑆)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦)))
35	34	ralrimivva 3191	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑆)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦)))
36	2, 22	ressplusg 16612	. . . . . . . . 9 ⊢ (𝑋 ∈ (SubMnd‘𝑆) → (+g‘𝑆) = (+g‘𝑈))
37	36	adantl 484	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (+g‘𝑆) = (+g‘𝑈))
38	37	oveqd 7173	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝑥(+g‘𝑆)𝑦) = (𝑥(+g‘𝑈)𝑦))
39	38	fveqeq2d 6678	. . . . . 6 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑆)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦)) ↔ ((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑈)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦))))
40	13, 39	raleqbidv 3401	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (∀𝑦 ∈ 𝑋 ((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑆)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦)) ↔ ∀𝑦 ∈ (Base‘𝑈)((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑈)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦))))
41	13, 40	raleqbidv 3401	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑆)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦)) ↔ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑈)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦))))
42	35, 41	mpbid 234	. . 3 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑈)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦)))
43		eqid 2821	. . . . . . 7 ⊢ (0g‘𝑆) = (0g‘𝑆)
44	43	subm0cl 17976	. . . . . 6 ⊢ (𝑋 ∈ (SubMnd‘𝑆) → (0g‘𝑆) ∈ 𝑋)
45	44	adantl 484	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (0g‘𝑆) ∈ 𝑋)
46	45	fvresd 6690	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹 ↾ 𝑋)‘(0g‘𝑆)) = (𝐹‘(0g‘𝑆)))
47	2, 43	subm0 17980	. . . . . 6 ⊢ (𝑋 ∈ (SubMnd‘𝑆) → (0g‘𝑆) = (0g‘𝑈))
48	47	adantl 484	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (0g‘𝑆) = (0g‘𝑈))
49	48	fveq2d 6674	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹 ↾ 𝑋)‘(0g‘𝑆)) = ((𝐹 ↾ 𝑋)‘(0g‘𝑈)))
50		eqid 2821	. . . . . 6 ⊢ (0g‘𝑇) = (0g‘𝑇)
51	43, 50	mhm0 17964	. . . . 5 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) → (𝐹‘(0g‘𝑆)) = (0g‘𝑇))
52	51	adantr 483	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹‘(0g‘𝑆)) = (0g‘𝑇))
53	46, 49, 52	3eqtr3d 2864	. . 3 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹 ↾ 𝑋)‘(0g‘𝑈)) = (0g‘𝑇))
54	15, 42, 53	3jca 1124	. 2 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹 ↾ 𝑋):(Base‘𝑈)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑈)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦)) ∧ ((𝐹 ↾ 𝑋)‘(0g‘𝑈)) = (0g‘𝑇)))
55		eqid 2821	. . 3 ⊢ (Base‘𝑈) = (Base‘𝑈)
56		eqid 2821	. . 3 ⊢ (+g‘𝑈) = (+g‘𝑈)
57		eqid 2821	. . 3 ⊢ (0g‘𝑈) = (0g‘𝑈)
58	55, 6, 56, 23, 57, 50	ismhm 17958	. 2 ⊢ ((𝐹 ↾ 𝑋) ∈ (𝑈 MndHom 𝑇) ↔ ((𝑈 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ ((𝐹 ↾ 𝑋):(Base‘𝑈)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑈)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦)) ∧ ((𝐹 ↾ 𝑋)‘(0g‘𝑈)) = (0g‘𝑇))))
59	4, 54, 58	sylanbrc 585	1 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹 ↾ 𝑋) ∈ (𝑈 MndHom 𝑇))

Syntax hints:   → wi 4   ∧ wa 398   ∧ w3a 1083   = wceq 1537   ∈ wcel 2114  ∀wral 3138   ⊆ wss 3936   ↾ cres 5557  ⟶wf 6351  ‘cfv 6355  (class class class)co 7156  Basecbs 16483   ↾_s cress 16484  +_gcplusg 16565  0_gc0g 16713  Mndcmnd 17911   MndHom cmhm 17954  SubMndcsubmnd 17955

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461  ax-cnex 10593  ax-resscn 10594  ax-1cn 10595  ax-icn 10596  ax-addcl 10597  ax-addrcl 10598  ax-mulcl 10599  ax-mulrcl 10600  ax-mulcom 10601  ax-addass 10602  ax-mulass 10603  ax-distr 10604  ax-i2m1 10605  ax-1ne0 10606  ax-1rid 10607  ax-rnegex 10608  ax-rrecex 10609  ax-cnre 10610  ax-pre-lttri 10611  ax-pre-lttrn 10612  ax-pre-ltadd 10613  ax-pre-mulgt0 10614

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-pred 6148  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-riota 7114  df-ov 7159  df-oprab 7160  df-mpo 7161  df-om 7581  df-wrecs 7947  df-recs 8008  df-rdg 8046  df-er 8289  df-map 8408  df-en 8510  df-dom 8511  df-sdom 8512  df-pnf 10677  df-mnf 10678  df-xr 10679  df-ltxr 10680  df-le 10681  df-sub 10872  df-neg 10873  df-nn 11639  df-2 11701  df-ndx 16486  df-slot 16487  df-base 16489  df-sets 16490  df-ress 16491  df-plusg 16578  df-0g 16715  df-mgm 17852  df-sgrp 17901  df-mnd 17912  df-mhm 17956  df-submnd 17957

This theorem is referenced by:  resrhm  19564  dchrghm  25832