Theorem reslmhm2b 21362

Description: Expansion of the codomain of a homomorphism. (Contributed by Stefan O'Rear, 3-Feb-2015.) (Revised by Mario Carneiro, 5-May-2015.)

Hypotheses

Ref	Expression
reslmhm2.u	⊢ 𝑈 = (𝑇 ↾s 𝑋)
reslmhm2.l	⊢ 𝐿 = (LSubSp‘𝑇)

Assertion

Ref	Expression
reslmhm2b	⊢ ((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿 ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ 𝐹 ∈ (𝑆 LMHom 𝑈)))

Proof of Theorem reslmhm2b

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

Step	Hyp	Ref	Expression
1		eqid 2763	. . 3 ⊢ (Base‘𝑆) = (Base‘𝑆)
2		eqid 2763	. . 3 ⊢ ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘𝑆)
3		eqid 2763	. . 3 ⊢ ( ·𝑠 ‘𝑈) = ( ·𝑠 ‘𝑈)
4		eqid 2763	. . 3 ⊢ (Scalar‘𝑆) = (Scalar‘𝑆)
5		eqid 2763	. . 3 ⊢ (Scalar‘𝑈) = (Scalar‘𝑈)
6		eqid 2763	. . 3 ⊢ (Base‘(Scalar‘𝑆)) = (Base‘(Scalar‘𝑆))
7		lmhmlmod1 21341	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝑆 ∈ LMod)
8	7	adantl 487	. . 3 ⊢ (((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿 ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 LMHom 𝑇)) → 𝑆 ∈ LMod)
9		simpl1 1210	. . . 4 ⊢ (((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿 ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 LMHom 𝑇)) → 𝑇 ∈ LMod)
10		simpl2 1211	. . . 4 ⊢ (((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿 ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 LMHom 𝑇)) → 𝑋 ∈ 𝐿)
11		reslmhm2.u	. . . . 5 ⊢ 𝑈 = (𝑇 ↾s 𝑋)
12		reslmhm2.l	. . . . 5 ⊢ 𝐿 = (LSubSp‘𝑇)
13	11, 12	lsslmod 21268	. . . 4 ⊢ ((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿) → 𝑈 ∈ LMod)
14	9, 10, 13	syl2anc 596	. . 3 ⊢ (((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿 ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 LMHom 𝑇)) → 𝑈 ∈ LMod)
15		eqid 2763	. . . . . 6 ⊢ (Scalar‘𝑇) = (Scalar‘𝑇)
16	11, 15	resssca 17546	. . . . 5 ⊢ (𝑋 ∈ 𝐿 → (Scalar‘𝑇) = (Scalar‘𝑈))
17	16	3ad2ant2 1152	. . . 4 ⊢ ((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿 ∧ ran 𝐹 ⊆ 𝑋) → (Scalar‘𝑇) = (Scalar‘𝑈))
18	4, 15	lmhmsca 21338	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → (Scalar‘𝑇) = (Scalar‘𝑆))
19	17, 18	sylan9req 2819	. . 3 ⊢ (((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿 ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 LMHom 𝑇)) → (Scalar‘𝑈) = (Scalar‘𝑆))
20		lmghm 21339	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝐹 ∈ (𝑆 GrpHom 𝑇))
21	12	lsssubg 21265	. . . . . 6 ⊢ ((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿) → 𝑋 ∈ (SubGrp‘𝑇))
22	11	resghm2b 19480	. . . . . 6 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ (𝑆 GrpHom 𝑈)))
23	21, 22	stoic3 1809	. . . . 5 ⊢ ((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿 ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ (𝑆 GrpHom 𝑈)))
24	23	biimpa 482	. . . 4 ⊢ (((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿 ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 GrpHom 𝑇)) → 𝐹 ∈ (𝑆 GrpHom 𝑈))
25	20, 24	sylan2 605	. . 3 ⊢ (((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿 ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 LMHom 𝑇)) → 𝐹 ∈ (𝑆 GrpHom 𝑈))
26		eqid 2763	. . . . . . 7 ⊢ ( ·𝑠 ‘𝑇) = ( ·𝑠 ‘𝑇)
27	4, 6, 1, 2, 26	lmhmlin 21343	. . . . . 6 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑥 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐹‘(𝑥( ·𝑠 ‘𝑆)𝑦)) = (𝑥( ·𝑠 ‘𝑇)(𝐹‘𝑦)))
28	27	3expb 1138	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ (𝑥 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥( ·𝑠 ‘𝑆)𝑦)) = (𝑥( ·𝑠 ‘𝑇)(𝐹‘𝑦)))
29	28	adantll 727	. . . 4 ⊢ ((((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿 ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 LMHom 𝑇)) ∧ (𝑥 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥( ·𝑠 ‘𝑆)𝑦)) = (𝑥( ·𝑠 ‘𝑇)(𝐹‘𝑦)))
30		simpll2 1232	. . . . 5 ⊢ ((((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿 ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 LMHom 𝑇)) ∧ (𝑥 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑦 ∈ (Base‘𝑆))) → 𝑋 ∈ 𝐿)
31	11, 26	ressvsca 17547	. . . . . 6 ⊢ (𝑋 ∈ 𝐿 → ( ·𝑠 ‘𝑇) = ( ·𝑠 ‘𝑈))
32	31	oveqd 7463	. . . . 5 ⊢ (𝑋 ∈ 𝐿 → (𝑥( ·𝑠 ‘𝑇)(𝐹‘𝑦)) = (𝑥( ·𝑠 ‘𝑈)(𝐹‘𝑦)))
33	30, 32	syl 18	. . . 4 ⊢ ((((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿 ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 LMHom 𝑇)) ∧ (𝑥 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝑥( ·𝑠 ‘𝑇)(𝐹‘𝑦)) = (𝑥( ·𝑠 ‘𝑈)(𝐹‘𝑦)))
34	29, 33	eqtrd 2798	. . 3 ⊢ ((((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿 ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 LMHom 𝑇)) ∧ (𝑥 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥( ·𝑠 ‘𝑆)𝑦)) = (𝑥( ·𝑠 ‘𝑈)(𝐹‘𝑦)))
35	1, 2, 3, 4, 5, 6, 8, 14, 19, 25, 34	islmhmd 21347	. 2 ⊢ (((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿 ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 LMHom 𝑇)) → 𝐹 ∈ (𝑆 LMHom 𝑈))
36		simpr 490	. . 3 ⊢ (((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿 ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 LMHom 𝑈)) → 𝐹 ∈ (𝑆 LMHom 𝑈))
37		simpl1 1210	. . 3 ⊢ (((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿 ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 LMHom 𝑈)) → 𝑇 ∈ LMod)
38		simpl2 1211	. . 3 ⊢ (((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿 ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 LMHom 𝑈)) → 𝑋 ∈ 𝐿)
39	11, 12	reslmhm2 21361	. . 3 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑈) ∧ 𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿) → 𝐹 ∈ (𝑆 LMHom 𝑇))
40	36, 37, 38, 39	syl3anc 1399	. 2 ⊢ (((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿 ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 LMHom 𝑈)) → 𝐹 ∈ (𝑆 LMHom 𝑇))
41	35, 40	impbida 813	1 ⊢ ((𝑇 ∈ LMod ∧ 𝑋 ∈ 𝐿 ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ 𝐹 ∈ (𝑆 LMHom 𝑈)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900  ran crn 5657  ‘cfv 6561  (class class class)co 7446  Basecbs 17419   ↾_s cress 17440  Scalarcsca 17463   ·_𝑠 cvsca 17464  SubGrpcsubg 19362   GrpHom cghm 19459  LModclmod 21168  LSubSpclss 21239   LMHom clmhm 21327

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778  ax-cnex 11286  ax-resscn 11287  ax-1cn 11288  ax-icn 11289  ax-addcl 11290  ax-addrcl 11291  ax-mulcl 11292  ax-mulrcl 11293  ax-mulcom 11294  ax-addass 11295  ax-mulass 11296  ax-distr 11297  ax-i2m1 11298  ax-1ne0 11299  ax-1rid 11300  ax-rnegex 11301  ax-rrecex 11302  ax-cnre 11303  ax-pre-lttri 11304  ax-pre-lttrn 11305  ax-pre-ltadd 11306  ax-pre-mulgt0 11307

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5551  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-pred 6325  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7403  df-ov 7449  df-oprab 7450  df-mpo 7451  df-om 7905  df-1st 8028  df-2nd 8029  df-frecs 8330  df-wrecs 8361  df-recs 8410  df-rdg 8449  df-er 8748  df-map 8880  df-en 9005  df-dom 9006  df-sdom 9007  df-pnf 11375  df-mnf 11376  df-xr 11377  df-ltxr 11378  df-le 11379  df-sub 11573  df-neg 11574  df-nn 12366  df-2 12435  df-3 12436  df-4 12437  df-5 12438  df-6 12439  df-sets 17374  df-slot 17392  df-ndx 17404  df-base 17420  df-ress 17441  df-plusg 17473  df-sca 17476  df-vsca 17477  df-0g 17644  df-mgm 18848  df-sgrp 18940  df-mnd 18956  df-mhm 19010  df-submnd 19011  df-grp 19179  df-minusg 19180  df-sbg 19181  df-subg 19365  df-ghm 19460  df-mgp 20394  df-ur 20441  df-ring 20494  df-lmod 21170  df-lss 21240  df-lmhm 21330

This theorem is used by:  pj1lmhm2  21409  frlmsplit2  22112  dimkerim  34342  algextdeglem2  34433