Theorem resmhm 13059

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 13036	. . 3 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝑇 ∈ Mnd)
2		resmhm.u	. . . 4 ⊢ 𝑈 = (𝑆 ↾s 𝑋)
3	2	submmnd 13052	. . 3 ⊢ (𝑋 ∈ (SubMnd‘𝑆) → 𝑈 ∈ Mnd)
4	1, 3	anim12ci 339	. 2 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝑈 ∈ Mnd ∧ 𝑇 ∈ Mnd))
5		eqid 2193	. . . . . 6 ⊢ (Base‘𝑆) = (Base‘𝑆)
6		eqid 2193	. . . . . 6 ⊢ (Base‘𝑇) = (Base‘𝑇)
7	5, 6	mhmf 13037	. . . . 5 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
8	5	submss 13048	. . . . 5 ⊢ (𝑋 ∈ (SubMnd‘𝑆) → 𝑋 ⊆ (Base‘𝑆))
9		fssres 5429	. . . . 5 ⊢ ((𝐹:(Base‘𝑆)⟶(Base‘𝑇) ∧ 𝑋 ⊆ (Base‘𝑆)) → (𝐹 ↾ 𝑋):𝑋⟶(Base‘𝑇))
10	7, 8, 9	syl2an 289	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹 ↾ 𝑋):𝑋⟶(Base‘𝑇))
11	2	a1i 9	. . . . . 6 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → 𝑈 = (𝑆 ↾s 𝑋))
12		eqidd 2194	. . . . . 6 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (Base‘𝑆) = (Base‘𝑆))
13		submrcl 13043	. . . . . . 7 ⊢ (𝑋 ∈ (SubMnd‘𝑆) → 𝑆 ∈ Mnd)
14	13	adantl 277	. . . . . 6 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → 𝑆 ∈ Mnd)
15	8	adantl 277	. . . . . 6 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → 𝑋 ⊆ (Base‘𝑆))
16	11, 12, 14, 15	ressbas2d 12686	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → 𝑋 = (Base‘𝑈))
17	16	feq2d 5391	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹 ↾ 𝑋):𝑋⟶(Base‘𝑇) ↔ (𝐹 ↾ 𝑋):(Base‘𝑈)⟶(Base‘𝑇)))
18	10, 17	mpbid 147	. . 3 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹 ↾ 𝑋):(Base‘𝑈)⟶(Base‘𝑇))
19		simpll 527	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝐹 ∈ (𝑆 MndHom 𝑇))
20	8	ad2antlr 489	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑋 ⊆ (Base‘𝑆))
21		simprl 529	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑥 ∈ 𝑋)
22	20, 21	sseldd 3180	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑥 ∈ (Base‘𝑆))
23		simprr 531	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑦 ∈ 𝑋)
24	20, 23	sseldd 3180	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑦 ∈ (Base‘𝑆))
25		eqid 2193	. . . . . . . 8 ⊢ (+g‘𝑆) = (+g‘𝑆)
26		eqid 2193	. . . . . . . 8 ⊢ (+g‘𝑇) = (+g‘𝑇)
27	5, 25, 26	mhmlin 13039	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
28	19, 22, 24, 27	syl3anc 1249	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
29	25	submcl 13051	. . . . . . . . 9 ⊢ ((𝑋 ∈ (SubMnd‘𝑆) ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑥(+g‘𝑆)𝑦) ∈ 𝑋)
30	29	3expb 1206	. . . . . . . 8 ⊢ ((𝑋 ∈ (SubMnd‘𝑆) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥(+g‘𝑆)𝑦) ∈ 𝑋)
31	30	adantll 476	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥(+g‘𝑆)𝑦) ∈ 𝑋)
32	31	fvresd 5579	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑆)𝑦)) = (𝐹‘(𝑥(+g‘𝑆)𝑦)))
33		fvres 5578	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑋 → ((𝐹 ↾ 𝑋)‘𝑥) = (𝐹‘𝑥))
34		fvres 5578	. . . . . . . 8 ⊢ (𝑦 ∈ 𝑋 → ((𝐹 ↾ 𝑋)‘𝑦) = (𝐹‘𝑦))
35	33, 34	oveqan12d 5937	. . . . . . 7 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
36	35	adantl 277	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
37	28, 32, 36	3eqtr4d 2236	. . . . 5 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑆)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦)))
38	37	ralrimivva 2576	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑆)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦)))
39	2	a1i 9	. . . . . . . . . 10 ⊢ (𝑋 ∈ (SubMnd‘𝑆) → 𝑈 = (𝑆 ↾s 𝑋))
40		eqidd 2194	. . . . . . . . . 10 ⊢ (𝑋 ∈ (SubMnd‘𝑆) → (+g‘𝑆) = (+g‘𝑆))
41		id 19	. . . . . . . . . 10 ⊢ (𝑋 ∈ (SubMnd‘𝑆) → 𝑋 ∈ (SubMnd‘𝑆))
42	39, 40, 41, 13	ressplusgd 12746	. . . . . . . . 9 ⊢ (𝑋 ∈ (SubMnd‘𝑆) → (+g‘𝑆) = (+g‘𝑈))
43	42	adantl 277	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (+g‘𝑆) = (+g‘𝑈))
44	43	oveqd 5935	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝑥(+g‘𝑆)𝑦) = (𝑥(+g‘𝑈)𝑦))
45	44	fveqeq2d 5562	. . . . . 6 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑆)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦)) ↔ ((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑈)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦))))
46	16, 45	raleqbidv 2706	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (∀𝑦 ∈ 𝑋 ((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑆)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦)) ↔ ∀𝑦 ∈ (Base‘𝑈)((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑈)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦))))
47	16, 46	raleqbidv 2706	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑆)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦)) ↔ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑈)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦))))
48	38, 47	mpbid 147	. . 3 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑈)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦)))
49		eqid 2193	. . . . . . 7 ⊢ (0g‘𝑆) = (0g‘𝑆)
50	49	subm0cl 13050	. . . . . 6 ⊢ (𝑋 ∈ (SubMnd‘𝑆) → (0g‘𝑆) ∈ 𝑋)
51	50	adantl 277	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (0g‘𝑆) ∈ 𝑋)
52	51	fvresd 5579	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹 ↾ 𝑋)‘(0g‘𝑆)) = (𝐹‘(0g‘𝑆)))
53	2, 49	subm0 13054	. . . . . 6 ⊢ (𝑋 ∈ (SubMnd‘𝑆) → (0g‘𝑆) = (0g‘𝑈))
54	53	adantl 277	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (0g‘𝑆) = (0g‘𝑈))
55	54	fveq2d 5558	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹 ↾ 𝑋)‘(0g‘𝑆)) = ((𝐹 ↾ 𝑋)‘(0g‘𝑈)))
56		eqid 2193	. . . . . 6 ⊢ (0g‘𝑇) = (0g‘𝑇)
57	49, 56	mhm0 13040	. . . . 5 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) → (𝐹‘(0g‘𝑆)) = (0g‘𝑇))
58	57	adantr 276	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹‘(0g‘𝑆)) = (0g‘𝑇))
59	52, 55, 58	3eqtr3d 2234	. . 3 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹 ↾ 𝑋)‘(0g‘𝑈)) = (0g‘𝑇))
60	18, 48, 59	3jca 1179	. 2 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → ((𝐹 ↾ 𝑋):(Base‘𝑈)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑈)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦)) ∧ ((𝐹 ↾ 𝑋)‘(0g‘𝑈)) = (0g‘𝑇)))
61		eqid 2193	. . 3 ⊢ (Base‘𝑈) = (Base‘𝑈)
62		eqid 2193	. . 3 ⊢ (+g‘𝑈) = (+g‘𝑈)
63		eqid 2193	. . 3 ⊢ (0g‘𝑈) = (0g‘𝑈)
64	61, 6, 62, 26, 63, 56	ismhm 13033	. 2 ⊢ ((𝐹 ↾ 𝑋) ∈ (𝑈 MndHom 𝑇) ↔ ((𝑈 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ ((𝐹 ↾ 𝑋):(Base‘𝑈)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)((𝐹 ↾ 𝑋)‘(𝑥(+g‘𝑈)𝑦)) = (((𝐹 ↾ 𝑋)‘𝑥)(+g‘𝑇)((𝐹 ↾ 𝑋)‘𝑦)) ∧ ((𝐹 ↾ 𝑋)‘(0g‘𝑈)) = (0g‘𝑇))))
65	4, 60, 64	sylanbrc 417	1 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ (SubMnd‘𝑆)) → (𝐹 ↾ 𝑋) ∈ (𝑈 MndHom 𝑇))

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 980   = wceq 1364   ∈ wcel 2164  ∀wral 2472   ⊆ wss 3153   ↾ cres 4661  ⟶wf 5250  ‘cfv 5254  (class class class)co 5918  Basecbs 12618   ↾_s cress 12619  +_gcplusg 12695  0_gc0g 12867  Mndcmnd 12997   MndHom cmhm 13029  SubMndcsubmnd 13030

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-addcom 7972  ax-addass 7974  ax-i2m1 7977  ax-0lt1 7978  ax-0id 7980  ax-rnegex 7981  ax-pre-ltirr 7984  ax-pre-ltadd 7988

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-map 6704  df-pnf 8056  df-mnf 8057  df-ltxr 8059  df-inn 8983  df-2 9041  df-ndx 12621  df-slot 12622  df-base 12624  df-sets 12625  df-iress 12626  df-plusg 12708  df-0g 12869  df-mgm 12939  df-sgrp 12985  df-mnd 12998  df-mhm 13031  df-submnd 13032

This theorem is referenced by:  resrhm  13744