Theorem resmhm2b 12938

Description: Restriction of the codomain of a homomorphism. (Contributed by Mario Carneiro, 18-Jun-2015.)

Hypothesis

Ref	Expression
resmhm2.u	⊢ 𝑈 = (𝑇 ↾s 𝑋)

Assertion

Ref	Expression
resmhm2b	⊢ ((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ 𝐹 ∈ (𝑆 MndHom 𝑈)))

Proof of Theorem resmhm2b

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mhmrcl1 12912	. . . 4 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝑆 ∈ Mnd)
2	1	adantl 277	. . 3 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → 𝑆 ∈ Mnd)
3		resmhm2.u	. . . . 5 ⊢ 𝑈 = (𝑇 ↾s 𝑋)
4	3	submmnd 12929	. . . 4 ⊢ (𝑋 ∈ (SubMnd‘𝑇) → 𝑈 ∈ Mnd)
5	4	ad2antrr 488	. . 3 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → 𝑈 ∈ Mnd)
6		eqid 2189	. . . . . . . . 9 ⊢ (Base‘𝑆) = (Base‘𝑆)
7		eqid 2189	. . . . . . . . 9 ⊢ (Base‘𝑇) = (Base‘𝑇)
8	6, 7	mhmf 12914	. . . . . . . 8 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
9	8	adantl 277	. . . . . . 7 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
10	9	ffnd 5385	. . . . . 6 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → 𝐹 Fn (Base‘𝑆))
11		simplr 528	. . . . . 6 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → ran 𝐹 ⊆ 𝑋)
12		df-f 5239	. . . . . 6 ⊢ (𝐹:(Base‘𝑆)⟶𝑋 ↔ (𝐹 Fn (Base‘𝑆) ∧ ran 𝐹 ⊆ 𝑋))
13	10, 11, 12	sylanbrc 417	. . . . 5 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → 𝐹:(Base‘𝑆)⟶𝑋)
14	3	submbas 12930	. . . . . . 7 ⊢ (𝑋 ∈ (SubMnd‘𝑇) → 𝑋 = (Base‘𝑈))
15	14	ad2antrr 488	. . . . . 6 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → 𝑋 = (Base‘𝑈))
16	15	feq3d 5373	. . . . 5 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → (𝐹:(Base‘𝑆)⟶𝑋 ↔ 𝐹:(Base‘𝑆)⟶(Base‘𝑈)))
17	13, 16	mpbid 147	. . . 4 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → 𝐹:(Base‘𝑆)⟶(Base‘𝑈))
18		eqid 2189	. . . . . . . . 9 ⊢ (+g‘𝑆) = (+g‘𝑆)
19		eqid 2189	. . . . . . . . 9 ⊢ (+g‘𝑇) = (+g‘𝑇)
20	6, 18, 19	mhmlin 12916	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
21	20	3expb 1206	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
22	21	adantll 476	. . . . . 6 ⊢ ((((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
23	3	a1i 9	. . . . . . . . 9 ⊢ (𝑋 ∈ (SubMnd‘𝑇) → 𝑈 = (𝑇 ↾s 𝑋))
24		eqidd 2190	. . . . . . . . 9 ⊢ (𝑋 ∈ (SubMnd‘𝑇) → (+g‘𝑇) = (+g‘𝑇))
25		id 19	. . . . . . . . 9 ⊢ (𝑋 ∈ (SubMnd‘𝑇) → 𝑋 ∈ (SubMnd‘𝑇))
26		submrcl 12920	. . . . . . . . 9 ⊢ (𝑋 ∈ (SubMnd‘𝑇) → 𝑇 ∈ Mnd)
27	23, 24, 25, 26	ressplusgd 12637	. . . . . . . 8 ⊢ (𝑋 ∈ (SubMnd‘𝑇) → (+g‘𝑇) = (+g‘𝑈))
28	27	ad3antrrr 492	. . . . . . 7 ⊢ ((((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (+g‘𝑇) = (+g‘𝑈))
29	28	oveqd 5912	. . . . . 6 ⊢ ((((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)))
30	22, 29	eqtrd 2222	. . . . 5 ⊢ ((((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)))
31	30	ralrimivva 2572	. . . 4 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)))
32		eqid 2189	. . . . . . 7 ⊢ (0g‘𝑆) = (0g‘𝑆)
33		eqid 2189	. . . . . . 7 ⊢ (0g‘𝑇) = (0g‘𝑇)
34	32, 33	mhm0 12917	. . . . . 6 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) → (𝐹‘(0g‘𝑆)) = (0g‘𝑇))
35	34	adantl 277	. . . . 5 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → (𝐹‘(0g‘𝑆)) = (0g‘𝑇))
36	3, 33	subm0 12931	. . . . . 6 ⊢ (𝑋 ∈ (SubMnd‘𝑇) → (0g‘𝑇) = (0g‘𝑈))
37	36	ad2antrr 488	. . . . 5 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → (0g‘𝑇) = (0g‘𝑈))
38	35, 37	eqtrd 2222	. . . 4 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → (𝐹‘(0g‘𝑆)) = (0g‘𝑈))
39	17, 31, 38	3jca 1179	. . 3 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → (𝐹:(Base‘𝑆)⟶(Base‘𝑈) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)) ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑈)))
40		eqid 2189	. . . 4 ⊢ (Base‘𝑈) = (Base‘𝑈)
41		eqid 2189	. . . 4 ⊢ (+g‘𝑈) = (+g‘𝑈)
42		eqid 2189	. . . 4 ⊢ (0g‘𝑈) = (0g‘𝑈)
43	6, 40, 18, 41, 32, 42	ismhm 12910	. . 3 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑈) ↔ ((𝑆 ∈ Mnd ∧ 𝑈 ∈ Mnd) ∧ (𝐹:(Base‘𝑆)⟶(Base‘𝑈) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)) ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑈))))
44	2, 5, 39, 43	syl21anbrc 1184	. 2 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → 𝐹 ∈ (𝑆 MndHom 𝑈))
45	3	resmhm2 12937	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) → 𝐹 ∈ (𝑆 MndHom 𝑇))
46	45	ancoms 268	. . 3 ⊢ ((𝑋 ∈ (SubMnd‘𝑇) ∧ 𝐹 ∈ (𝑆 MndHom 𝑈)) → 𝐹 ∈ (𝑆 MndHom 𝑇))
47	46	adantlr 477	. 2 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑈)) → 𝐹 ∈ (𝑆 MndHom 𝑇))
48	44, 47	impbida 596	1 ⊢ ((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ 𝐹 ∈ (𝑆 MndHom 𝑈)))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 980   = wceq 1364   ∈ wcel 2160  ∀wral 2468   ⊆ wss 3144  ran crn 4645   Fn wfn 5230  ⟶wf 5231  ‘cfv 5235  (class class class)co 5895  Basecbs 12511   ↾_s cress 12512  +_gcplusg 12586  0_gc0g 12758  Mndcmnd 12874   MndHom cmhm 12906  SubMndcsubmnd 12907

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 2162  ax-14 2163  ax-ext 2171  ax-sep 4136  ax-pow 4192  ax-pr 4227  ax-un 4451  ax-setind 4554  ax-cnex 7931  ax-resscn 7932  ax-1cn 7933  ax-1re 7934  ax-icn 7935  ax-addcl 7936  ax-addrcl 7937  ax-mulcl 7938  ax-addcom 7940  ax-addass 7942  ax-i2m1 7945  ax-0lt1 7946  ax-0id 7948  ax-rnegex 7949  ax-pre-ltirr 7952  ax-pre-ltadd 7956

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 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-nel 2456  df-ral 2473  df-rex 2474  df-reu 2475  df-rmo 2476  df-rab 2477  df-v 2754  df-sbc 2978  df-csb 3073  df-dif 3146  df-un 3148  df-in 3150  df-ss 3157  df-nul 3438  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-int 3860  df-iun 3903  df-br 4019  df-opab 4080  df-mpt 4081  df-id 4311  df-xp 4650  df-rel 4651  df-cnv 4652  df-co 4653  df-dm 4654  df-rn 4655  df-res 4656  df-ima 4657  df-iota 5196  df-fun 5237  df-fn 5238  df-f 5239  df-fv 5243  df-riota 5851  df-ov 5898  df-oprab 5899  df-mpo 5900  df-1st 6164  df-2nd 6165  df-map 6675  df-pnf 8023  df-mnf 8024  df-ltxr 8026  df-inn 8949  df-2 9007  df-ndx 12514  df-slot 12515  df-base 12517  df-sets 12518  df-iress 12519  df-plusg 12599  df-0g 12760  df-mgm 12829  df-sgrp 12862  df-mnd 12875  df-mhm 12908  df-submnd 12909

This theorem is referenced by:  resghm2b  13198