Theorem reslmhm 21016

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 20997	. . 3 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝑆 ∈ LMod)
2		reslmhm.r	. . . 4 ⊢ 𝑅 = (𝑆 ↾s 𝑋)
3		reslmhm.u	. . . 4 ⊢ 𝑈 = (LSubSp‘𝑆)
4	2, 3	lsslmod 20923	. . 3 ⊢ ((𝑆 ∈ LMod ∧ 𝑋 ∈ 𝑈) → 𝑅 ∈ LMod)
5	1, 4	sylan 581	. 2 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → 𝑅 ∈ LMod)
6		lmhmlmod2 20996	. . 3 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝑇 ∈ LMod)
7	6	adantr 480	. 2 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → 𝑇 ∈ LMod)
8		lmghm 20995	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝐹 ∈ (𝑆 GrpHom 𝑇))
9	3	lsssubg 20920	. . . . 5 ⊢ ((𝑆 ∈ LMod ∧ 𝑋 ∈ 𝑈) → 𝑋 ∈ (SubGrp‘𝑆))
10	1, 9	sylan 581	. . . 4 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → 𝑋 ∈ (SubGrp‘𝑆))
11	2	resghm 19173	. . . 4 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋 ∈ (SubGrp‘𝑆)) → (𝐹 ↾ 𝑋) ∈ (𝑅 GrpHom 𝑇))
12	8, 10, 11	syl2an2r 686	. . 3 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → (𝐹 ↾ 𝑋) ∈ (𝑅 GrpHom 𝑇))
13		eqid 2737	. . . . 5 ⊢ (Scalar‘𝑆) = (Scalar‘𝑆)
14		eqid 2737	. . . . 5 ⊢ (Scalar‘𝑇) = (Scalar‘𝑇)
15	13, 14	lmhmsca 20994	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → (Scalar‘𝑇) = (Scalar‘𝑆))
16	2, 13	resssca 17275	. . . 4 ⊢ (𝑋 ∈ 𝑈 → (Scalar‘𝑆) = (Scalar‘𝑅))
17	15, 16	sylan9eq 2792	. . 3 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → (Scalar‘𝑇) = (Scalar‘𝑅))
18		simpll 767	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → 𝐹 ∈ (𝑆 LMHom 𝑇))
19		simprl 771	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → 𝑎 ∈ (Base‘(Scalar‘𝑆)))
20		eqid 2737	. . . . . . . . . . 11 ⊢ (Base‘𝑆) = (Base‘𝑆)
21	20, 3	lssss 20899	. . . . . . . . . 10 ⊢ (𝑋 ∈ 𝑈 → 𝑋 ⊆ (Base‘𝑆))
22	21	adantl 481	. . . . . . . . 9 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → 𝑋 ⊆ (Base‘𝑆))
23	22	adantr 480	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → 𝑋 ⊆ (Base‘𝑆))
24	2, 20	ressbas2 17177	. . . . . . . . . . . 12 ⊢ (𝑋 ⊆ (Base‘𝑆) → 𝑋 = (Base‘𝑅))
25	22, 24	syl 17	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → 𝑋 = (Base‘𝑅))
26	25	eleq2d 2823	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → (𝑏 ∈ 𝑋 ↔ 𝑏 ∈ (Base‘𝑅)))
27	26	biimpar 477	. . . . . . . . 9 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ 𝑏 ∈ (Base‘𝑅)) → 𝑏 ∈ 𝑋)
28	27	adantrl 717	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → 𝑏 ∈ 𝑋)
29	23, 28	sseldd 3936	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → 𝑏 ∈ (Base‘𝑆))
30		eqid 2737	. . . . . . . 8 ⊢ (Base‘(Scalar‘𝑆)) = (Base‘(Scalar‘𝑆))
31		eqid 2737	. . . . . . . 8 ⊢ ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘𝑆)
32		eqid 2737	. . . . . . . 8 ⊢ ( ·𝑠 ‘𝑇) = ( ·𝑠 ‘𝑇)
33	13, 30, 20, 31, 32	lmhmlin 20999	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑆)) → (𝐹‘(𝑎( ·𝑠 ‘𝑆)𝑏)) = (𝑎( ·𝑠 ‘𝑇)(𝐹‘𝑏)))
34	18, 19, 29, 33	syl3anc 1374	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → (𝐹‘(𝑎( ·𝑠 ‘𝑆)𝑏)) = (𝑎( ·𝑠 ‘𝑇)(𝐹‘𝑏)))
35	1	adantr 480	. . . . . . . . 9 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → 𝑆 ∈ LMod)
36	35	adantr 480	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → 𝑆 ∈ LMod)
37		simplr 769	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → 𝑋 ∈ 𝑈)
38	13, 31, 30, 3	lssvscl 20918	. . . . . . . 8 ⊢ (((𝑆 ∈ LMod ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ 𝑋)) → (𝑎( ·𝑠 ‘𝑆)𝑏) ∈ 𝑋)
39	36, 37, 19, 28, 38	syl22anc 839	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → (𝑎( ·𝑠 ‘𝑆)𝑏) ∈ 𝑋)
40	39	fvresd 6862	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → ((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑆)𝑏)) = (𝐹‘(𝑎( ·𝑠 ‘𝑆)𝑏)))
41		fvres 6861	. . . . . . . 8 ⊢ (𝑏 ∈ 𝑋 → ((𝐹 ↾ 𝑋)‘𝑏) = (𝐹‘𝑏))
42	41	oveq2d 7384	. . . . . . 7 ⊢ (𝑏 ∈ 𝑋 → (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)) = (𝑎( ·𝑠 ‘𝑇)(𝐹‘𝑏)))
43	28, 42	syl 17	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)) = (𝑎( ·𝑠 ‘𝑇)(𝐹‘𝑏)))
44	34, 40, 43	3eqtr4d 2782	. . . . 5 ⊢ (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑅))) → ((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑆)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)))
45	44	ralrimivva 3181	. . . 4 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → ∀𝑎 ∈ (Base‘(Scalar‘𝑆))∀𝑏 ∈ (Base‘𝑅)((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑆)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)))
46	16	adantl 481	. . . . . 6 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → (Scalar‘𝑆) = (Scalar‘𝑅))
47	46	fveq2d 6846	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → (Base‘(Scalar‘𝑆)) = (Base‘(Scalar‘𝑅)))
48	2, 31	ressvsca 17276	. . . . . . . . 9 ⊢ (𝑋 ∈ 𝑈 → ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘𝑅))
49	48	adantl 481	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘𝑅))
50	49	oveqd 7385	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → (𝑎( ·𝑠 ‘𝑆)𝑏) = (𝑎( ·𝑠 ‘𝑅)𝑏))
51	50	fveqeq2d 6850	. . . . . 6 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → (((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑆)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)) ↔ ((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑅)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏))))
52	51	ralbidv 3161	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → (∀𝑏 ∈ (Base‘𝑅)((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑆)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)) ↔ ∀𝑏 ∈ (Base‘𝑅)((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑅)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏))))
53	47, 52	raleqbidv 3318	. . . 4 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → (∀𝑎 ∈ (Base‘(Scalar‘𝑆))∀𝑏 ∈ (Base‘𝑅)((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑆)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)) ↔ ∀𝑎 ∈ (Base‘(Scalar‘𝑅))∀𝑏 ∈ (Base‘𝑅)((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑅)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏))))
54	45, 53	mpbid 232	. . 3 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → ∀𝑎 ∈ (Base‘(Scalar‘𝑅))∀𝑏 ∈ (Base‘𝑅)((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑅)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)))
55	12, 17, 54	3jca 1129	. 2 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → ((𝐹 ↾ 𝑋) ∈ (𝑅 GrpHom 𝑇) ∧ (Scalar‘𝑇) = (Scalar‘𝑅) ∧ ∀𝑎 ∈ (Base‘(Scalar‘𝑅))∀𝑏 ∈ (Base‘𝑅)((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑅)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏))))
56		eqid 2737	. . 3 ⊢ (Scalar‘𝑅) = (Scalar‘𝑅)
57		eqid 2737	. . 3 ⊢ (Base‘(Scalar‘𝑅)) = (Base‘(Scalar‘𝑅))
58		eqid 2737	. . 3 ⊢ (Base‘𝑅) = (Base‘𝑅)
59		eqid 2737	. . 3 ⊢ ( ·𝑠 ‘𝑅) = ( ·𝑠 ‘𝑅)
60	56, 14, 57, 58, 59, 32	islmhm 20991	. 2 ⊢ ((𝐹 ↾ 𝑋) ∈ (𝑅 LMHom 𝑇) ↔ ((𝑅 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ ((𝐹 ↾ 𝑋) ∈ (𝑅 GrpHom 𝑇) ∧ (Scalar‘𝑇) = (Scalar‘𝑅) ∧ ∀𝑎 ∈ (Base‘(Scalar‘𝑅))∀𝑏 ∈ (Base‘𝑅)((𝐹 ↾ 𝑋)‘(𝑎( ·𝑠 ‘𝑅)𝑏)) = (𝑎( ·𝑠 ‘𝑇)((𝐹 ↾ 𝑋)‘𝑏)))))
61	5, 7, 55, 60	syl21anbrc 1346	1 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝑈) → (𝐹 ↾ 𝑋) ∈ (𝑅 LMHom 𝑇))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  ∀wral 3052   ⊆ wss 3903   ↾ cres 5634  ‘cfv 6500  (class class class)co 7368  Basecbs 17148   ↾_s cress 17169  Scalarcsca 17192   ·_𝑠 cvsca 17193  SubGrpcsubg 19062   GrpHom cghm 19153  LModclmod 20823  LSubSpclss 20894   LMHom clmhm 20983

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-er 8645  df-map 8777  df-en 8896  df-dom 8897  df-sdom 8898  df-pnf 11180  df-mnf 11181  df-xr 11182  df-ltxr 11183  df-le 11184  df-sub 11378  df-neg 11379  df-nn 12158  df-2 12220  df-3 12221  df-4 12222  df-5 12223  df-6 12224  df-sets 17103  df-slot 17121  df-ndx 17133  df-base 17149  df-ress 17170  df-plusg 17202  df-sca 17205  df-vsca 17206  df-0g 17373  df-mgm 18577  df-sgrp 18656  df-mnd 18672  df-grp 18878  df-minusg 18879  df-sbg 18880  df-subg 19065  df-ghm 19154  df-mgp 20088  df-ur 20129  df-ring 20182  df-lmod 20825  df-lss 20895  df-lmhm 20986

This theorem is referenced by:  frlmsplit2  21740  dimkerim  33804  lmhmlnmsplit  43438  pwssplit4  43440