Theorem reslmhm 21307

Description: Restriction of a homomorphism to a subspace. (Contributed by Stefan O'Rear, 1-Jan-2015.)

Hypotheses

Ref	Expression
reslmhm.u	⊢ 𝑈 = (LSubSp‘𝑆)
reslmhm.r	⊢ 𝑅 = (𝑆 ↾s 𝑋)

Assertion

Ref	Expression
reslmhm	⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → (𝐹 ↾ 𝑋) ∈ (𝑅 LMHom 𝑇))

Proof of Theorem reslmhm

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		lmhmlmod1 21288	. . 3 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝑆 ∈ LMod)
2		reslmhm.r	. . . 4 ⊢ 𝑅 = (𝑆 ↾s 𝑋)
3		reslmhm.u	. . . 4 ⊢ 𝑈 = (LSubSp‘𝑆)
4	2, 3	lsslmod 21215	. . 3 ⊢ ((𝑆 ∈ LMod ∧ 𝑋 ∈ 𝑈) → 𝑅 ∈ LMod)
5	1, 4	sylan 592	. 2 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → 𝑅 ∈ LMod)
6		lmhmlmod2 21287	. . 3 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝑇 ∈ LMod)
7	6	adantr 486	. 2 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → 𝑇 ∈ LMod)
8		lmghm 21286	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝐹 ∈ (𝑆 GrpHom 𝑇))
9	3	lsssubg 21212	. . . . 5 ⊢ ((𝑆 ∈ LMod ∧ 𝑋 ∈ 𝑈) → 𝑋 ∈ (SubGrp‘𝑆))
10	1, 9	sylan 592	. . . 4 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → 𝑋 ∈ (SubGrp‘𝑆))
11	2	resghm 19426	. . . 4 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) → (𝐹 ↾ 𝑋) ∈ (𝑅 GrpHom 𝑇))
12	8, 10, 11	syl2an2r 698	. . 3 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → (𝐹 ↾ 𝑋) ∈ (𝑅 GrpHom 𝑇))
13		eqid 2761	. . . . 5 ⊢ (Scalar‘𝑆) = (Scalar‘𝑆)
14		eqid 2761	. . . . 5 ⊢ (Scalar‘𝑇) = (Scalar‘𝑇)
15	13, 14	lmhmsca 21285	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → (Scalar‘𝑇) = (Scalar‘𝑆))
16	2, 13	resssca 17494	. . . 4 ⊢ (𝑋 ∈ 𝑈 → (Scalar‘𝑆) = (Scalar‘𝑅))
17	15, 16	sylan9eq 2816	. . 3 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → (Scalar‘𝑇) = (Scalar‘𝑅))
18		simpll 779	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → 𝐹 ∈ (𝑆 LMHom 𝑇))
19		simprl 783	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → 𝑎 ∈ (Base‘(Scalar‘𝑆)))
20		eqid 2761	. . . . . . . . . . 11 ⊢ (Base‘𝑆) = (Base‘𝑆)
21	20, 3	lssss 21191	. . . . . . . . . 10 ⊢ (𝑋 ∈ 𝑈 → 𝑋 ⊆ (Base‘𝑆))
22	21	adantl 487	. . . . . . . . 9 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → 𝑋 ⊆ (Base‘𝑆))
23	22	adantr 486	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → 𝑋 ⊆ (Base‘𝑆))
24	2, 20	ressbas2 17396	. . . . . . . . . . . 12 ⊢ (𝑋 ⊆ (Base‘𝑆) → 𝑋 = (Base‘𝑅))
25	22, 24	syl 18	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → 𝑋 = (Base‘𝑅))
26	25	eleq2d 2847	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → (𝑏 ∈ 𝑋 ↔ 𝑏 ∈ (Base‘𝑅)))
27	26	biimpar 483	. . . . . . . . 9 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ 𝑏 ∈ (Base‘𝑅)) → 𝑏 ∈ 𝑋)
28	27	adantrl 729	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → 𝑏 ∈ 𝑋)
29	23, 28	sseldd 3932	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → 𝑏 ∈ (Base‘𝑆))
30		eqid 2761	. . . . . . . 8 ⊢ (Base‘(Scalar‘𝑆)) = (Base‘(Scalar‘𝑆))
31		eqid 2761	. . . . . . . 8 ⊢ ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘𝑆)
32		eqid 2761	. . . . . . . 8 ⊢ ( ·𝑠 ‘𝑇) = ( ·𝑠 ‘𝑇)
33	13, 30, 20, 31, 32	lmhmlin 21290	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑆)) → (𝐹‘(𝑎( ·𝑠 ‘𝑆)𝑏)) = (𝑎( ·𝑠 ‘𝑇)(𝐹‘𝑏)))
34	18, 19, 29, 33	syl3anc 1398	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → (𝐹‘(𝑎( ·𝑠 ‘𝑆)𝑏)) = (𝑎( ·𝑠 ‘𝑇)(𝐹‘𝑏)))
35	1	adantr 486	. . . . . . . . 9 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → 𝑆 ∈ LMod)
36	35	adantr 486	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → 𝑆 ∈ LMod)
37		simplr 781	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → 𝑋 ∈ 𝑈)
38	13, 31, 30, 3	lssvscl 21210	. . . . . . . 8 ⊢ (((𝑆 ∈ LMod ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ 𝑋)) → (𝑎( ·𝑠 ‘𝑆)𝑏) ∈ 𝑋)
39	36, 37, 19, 28, 38	syl22anc 852	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → (𝑎( ·𝑠 ‘𝑆)𝑏) ∈ 𝑋)
40	39	fvresd 6897	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → ((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑆)𝑏)) = (𝐹‘(𝑎( ·𝑠 ‘𝑆)𝑏)))
41		fvres 6896	. . . . . . . 8 ⊢ (𝑏 ∈ 𝑋 → ((𝐹 ↾ 𝑋)‘𝑏) = (𝐹‘𝑏))
42	41	oveq2d 7428	. . . . . . 7 ⊢ (𝑏 ∈ 𝑋 → (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)) = (𝑎( ·𝑠 ‘𝑇)(𝐹‘𝑏)))
43	28, 42	syl 18	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)) = (𝑎( ·𝑠 ‘𝑇)(𝐹‘𝑏)))
44	34, 40, 43	3eqtr4d 2806	. . . . 5 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → ((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑆)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)))
45	44	ralrimivva 3206	. . . 4 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → ∀𝑎 ∈ (Base‘(Scalar‘𝑆))∀𝑏 ∈ (Base‘𝑅)((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑆)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)))
46	16	adantl 487	. . . . . 6 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → (Scalar‘𝑆) = (Scalar‘𝑅))
47	46	fveq2d 6881	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → (Base‘(Scalar‘𝑆)) = (Base‘(Scalar‘𝑅)))
48	2, 31	ressvsca 17495	. . . . . . . . 9 ⊢ (𝑋 ∈ 𝑈 → ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘𝑅))
49	48	adantl 487	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘𝑅))
50	49	oveqd 7429	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → (𝑎( ·𝑠 ‘𝑆)𝑏) = (𝑎( ·𝑠 ‘𝑅)𝑏))
51	50	fveqeq2d 6885	. . . . . 6 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → (((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑆)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)) ↔ ((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑅)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏))))
52	51	ralbidv 3186	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → (∀𝑏 ∈ (Base‘𝑅)((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑆)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)) ↔ ∀𝑏 ∈ (Base‘𝑅)((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑅)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏))))
53	47, 52	raleqbidv 3335	. . . 4 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → (∀𝑎 ∈ (Base‘(Scalar‘𝑆))∀𝑏 ∈ (Base‘𝑅)((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑆)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)) ↔ ∀𝑎 ∈ (Base‘(Scalar‘𝑅))∀𝑏 ∈ (Base‘𝑅)((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑅)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏))))
54	45, 53	mpbid 235	. . 3 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → ∀𝑎 ∈ (Base‘(Scalar‘𝑅))∀𝑏 ∈ (Base‘𝑅)((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑅)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)))
55	12, 17, 54	3jca 1146	. 2 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → ((𝐹 ↾ 𝑋) ∈ (𝑅 GrpHom 𝑇) ∧ (Scalar‘𝑇) = (Scalar‘𝑅) ∧ ∀𝑎 ∈ (Base‘(Scalar‘𝑅))∀𝑏 ∈ (Base‘𝑅)((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑅)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏))))
56		eqid 2761	. . 3 ⊢ (Scalar‘𝑅) = (Scalar‘𝑅)
57		eqid 2761	. . 3 ⊢ (Base‘(Scalar‘𝑅)) = (Base‘(Scalar‘𝑅))
58		eqid 2761	. . 3 ⊢ (Base‘𝑅) = (Base‘𝑅)
59		eqid 2761	. . 3 ⊢ ( ·𝑠 ‘𝑅) = ( ·𝑠 ‘𝑅)
60	56, 14, 57, 58, 59, 32	islmhm 21282	. 2 ⊢ ((𝐹 ↾ 𝑋) ∈ (𝑅 LMHom 𝑇) ↔ ((𝑅 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ ((𝐹 ↾ 𝑋) ∈ (𝑅 GrpHom 𝑇) ∧ (Scalar‘𝑇) = (Scalar‘𝑅) ∧ ∀𝑎 ∈ (Base‘(Scalar‘𝑅))∀𝑏 ∈ (Base‘𝑅)((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑅)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)))))
61	5, 7, 55, 60	syl21anbrc 1363	1 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → (𝐹 ↾ 𝑋) ∈ (𝑅 LMHom 𝑇))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077   ⊆ wss 3899   ↾ cres 5653  ‘cfv 6531  (class class class)co 7412  Basecbs 17367   ↾_s cress 17388  Scalarcsca 17411   ·_𝑠 cvsca 17412  SubGrpcsubg 19310   GrpHom cghm 19407  LModclmod 21115  LSubSpclss 21186   LMHom clmhm 21274

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-cnex 11237  ax-resscn 11238  ax-1cn 11239  ax-icn 11240  ax-addcl 11241  ax-addrcl 11242  ax-mulcl 11243  ax-mulrcl 11244  ax-mulcom 11245  ax-addass 11246  ax-mulass 11247  ax-distr 11248  ax-i2m1 11249  ax-1ne0 11250  ax-1rid 11251  ax-rnegex 11252  ax-rrecex 11253  ax-cnre 11254  ax-pre-lttri 11255  ax-pre-lttrn 11256  ax-pre-ltadd 11257  ax-pre-mulgt0 11258

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-er 8701  df-map 8833  df-en 8958  df-dom 8959  df-sdom 8960  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-sub 11524  df-neg 11525  df-nn 12317  df-2 12386  df-3 12387  df-4 12388  df-5 12389  df-6 12390  df-sets 17322  df-slot 17340  df-ndx 17352  df-base 17368  df-ress 17389  df-plusg 17421  df-sca 17424  df-vsca 17425  df-0g 17592  df-mgm 18796  df-sgrp 18888  df-mnd 18904  df-grp 19127  df-minusg 19128  df-sbg 19129  df-subg 19313  df-ghm 19408  df-mgp 20341  df-ur 20388  df-ring 20441  df-lmod 21117  df-lss 21187  df-lmhm 21277

This theorem is used by:  frlmsplit2  22059  dimkerim  34241  lmhmlnmsplit  44047  pwssplit4  44049