lmhmfgima - Mathbox for Stefan O'Rear

	Mathbox for Stefan O'Rear		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > lmhmfgima		Structured version Visualization version GIF version

Theorem lmhmfgima 41811

Description: A homomorphism maps finitely generated submodules to finitely generated submodules. (Contributed by Stefan O'Rear, 24-Jan-2015.)

**Hypotheses**
Ref	Expression
lmhmfgima.y	⊢ 𝑌 = (𝑇 ↾_s (𝐹 “ 𝐴))
lmhmfgima.x	⊢ 𝑋 = (𝑆 ↾_s 𝐴)
lmhmfgima.u	⊢ 𝑈 = (LSubSp‘𝑆)
lmhmfgima.xf	⊢ (𝜑 → 𝑋 ∈ LFinGen)
lmhmfgima.a	⊢ (𝜑 → 𝐴 ∈ 𝑈)
lmhmfgima.f	⊢ (𝜑 → 𝐹 ∈ (𝑆 LMHom 𝑇))

**Assertion**
Ref	Expression
lmhmfgima	⊢ (𝜑 → 𝑌 ∈ LFinGen)

Proof of Theorem lmhmfgima Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		lmhmfgima.y	. 2 ⊢ 𝑌 = (𝑇 ↾_s (𝐹 “ 𝐴))
2		lmhmfgima.xf	. . . 4 ⊢ (𝜑 → 𝑋 ∈ LFinGen)
3		lmhmfgima.f	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (𝑆 LMHom 𝑇))
4		lmhmlmod1 20636	. . . . . 6 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝑆 ∈ LMod)
5	3, 4	syl 17	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ LMod)
6		lmhmfgima.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑈)
7		lmhmfgima.x	. . . . . 6 ⊢ 𝑋 = (𝑆 ↾_s 𝐴)
8		lmhmfgima.u	. . . . . 6 ⊢ 𝑈 = (LSubSp‘𝑆)
9		eqid 2732	. . . . . 6 ⊢ (LSpan‘𝑆) = (LSpan‘𝑆)
10		eqid 2732	. . . . . 6 ⊢ (Base‘𝑆) = (Base‘𝑆)
11	7, 8, 9, 10	islssfg2 41798	. . . . 5 ⊢ ((𝑆 ∈ LMod ∧ 𝐴 ∈ 𝑈) → (𝑋 ∈ LFinGen ↔ ∃𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)((LSpan‘𝑆)‘𝑥) = 𝐴))
12	5, 6, 11	syl2anc 584	. . . 4 ⊢ (𝜑 → (𝑋 ∈ LFinGen ↔ ∃𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)((LSpan‘𝑆)‘𝑥) = 𝐴))
13	2, 12	mpbid 231	. . 3 ⊢ (𝜑 → ∃𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)((LSpan‘𝑆)‘𝑥) = 𝐴)
14		inss1 4227	. . . . . . . . . 10 ⊢ (𝒫 (Base‘𝑆) ∩ Fin) ⊆ 𝒫 (Base‘𝑆)
15	14	sseli 3977	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin) → 𝑥 ∈ 𝒫 (Base‘𝑆))
16	15	elpwid 4610	. . . . . . . 8 ⊢ (𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin) → 𝑥 ⊆ (Base‘𝑆))
17		eqid 2732	. . . . . . . . 9 ⊢ (LSpan‘𝑇) = (LSpan‘𝑇)
18	10, 9, 17	lmhmlsp 20652	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑥 ⊆ (Base‘𝑆)) → (𝐹 “ ((LSpan‘𝑆)‘𝑥)) = ((LSpan‘𝑇)‘(𝐹 “ 𝑥)))
19	3, 16, 18	syl2an 596	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → (𝐹 “ ((LSpan‘𝑆)‘𝑥)) = ((LSpan‘𝑇)‘(𝐹 “ 𝑥)))
20	19	oveq2d 7421	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → (𝑇 ↾_s (𝐹 “ ((LSpan‘𝑆)‘𝑥))) = (𝑇 ↾_s ((LSpan‘𝑇)‘(𝐹 “ 𝑥))))
21		lmhmlmod2 20635	. . . . . . . . 9 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝑇 ∈ LMod)
22	3, 21	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑇 ∈ LMod)
23	22	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → 𝑇 ∈ LMod)
24		imassrn 6068	. . . . . . . . 9 ⊢ (𝐹 “ 𝑥) ⊆ ran 𝐹
25		eqid 2732	. . . . . . . . . . . 12 ⊢ (Base‘𝑇) = (Base‘𝑇)
26	10, 25	lmhmf 20637	. . . . . . . . . . 11 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
27	3, 26	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
28	27	frnd 6722	. . . . . . . . 9 ⊢ (𝜑 → ran 𝐹 ⊆ (Base‘𝑇))
29	24, 28	sstrid 3992	. . . . . . . 8 ⊢ (𝜑 → (𝐹 “ 𝑥) ⊆ (Base‘𝑇))
30	29	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → (𝐹 “ 𝑥) ⊆ (Base‘𝑇))
31		inss2 4228	. . . . . . . . . 10 ⊢ (𝒫 (Base‘𝑆) ∩ Fin) ⊆ Fin
32	31	sseli 3977	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin) → 𝑥 ∈ Fin)
33	32	adantl 482	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → 𝑥 ∈ Fin)
34	27	ffund 6718	. . . . . . . . . 10 ⊢ (𝜑 → Fun 𝐹)
35	34	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → Fun 𝐹)
36	16	adantl 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → 𝑥 ⊆ (Base‘𝑆))
37	27	fdmd 6725	. . . . . . . . . . 11 ⊢ (𝜑 → dom 𝐹 = (Base‘𝑆))
38	37	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → dom 𝐹 = (Base‘𝑆))
39	36, 38	sseqtrrd 4022	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → 𝑥 ⊆ dom 𝐹)
40		fores 6812	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑥 ⊆ dom 𝐹) → (𝐹 ↾ 𝑥):𝑥–onto→(𝐹 “ 𝑥))
41	35, 39, 40	syl2anc 584	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → (𝐹 ↾ 𝑥):𝑥–onto→(𝐹 “ 𝑥))
42		fofi 9334	. . . . . . . 8 ⊢ ((𝑥 ∈ Fin ∧ (𝐹 ↾ 𝑥):𝑥–onto→(𝐹 “ 𝑥)) → (𝐹 “ 𝑥) ∈ Fin)
43	33, 41, 42	syl2anc 584	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → (𝐹 “ 𝑥) ∈ Fin)
44		eqid 2732	. . . . . . . 8 ⊢ (𝑇 ↾_s ((LSpan‘𝑇)‘(𝐹 “ 𝑥))) = (𝑇 ↾_s ((LSpan‘𝑇)‘(𝐹 “ 𝑥)))
45	17, 25, 44	islssfgi 41799	. . . . . . 7 ⊢ ((𝑇 ∈ LMod ∧ (𝐹 “ 𝑥) ⊆ (Base‘𝑇) ∧ (𝐹 “ 𝑥) ∈ Fin) → (𝑇 ↾_s ((LSpan‘𝑇)‘(𝐹 “ 𝑥))) ∈ LFinGen)
46	23, 30, 43, 45	syl3anc 1371	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → (𝑇 ↾_s ((LSpan‘𝑇)‘(𝐹 “ 𝑥))) ∈ LFinGen)
47	20, 46	eqeltrd 2833	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → (𝑇 ↾_s (𝐹 “ ((LSpan‘𝑆)‘𝑥))) ∈ LFinGen)
48		imaeq2 6053	. . . . . . 7 ⊢ (((LSpan‘𝑆)‘𝑥) = 𝐴 → (𝐹 “ ((LSpan‘𝑆)‘𝑥)) = (𝐹 “ 𝐴))
49	48	oveq2d 7421	. . . . . 6 ⊢ (((LSpan‘𝑆)‘𝑥) = 𝐴 → (𝑇 ↾_s (𝐹 “ ((LSpan‘𝑆)‘𝑥))) = (𝑇 ↾_s (𝐹 “ 𝐴)))
50	49	eleq1d 2818	. . . . 5 ⊢ (((LSpan‘𝑆)‘𝑥) = 𝐴 → ((𝑇 ↾_s (𝐹 “ ((LSpan‘𝑆)‘𝑥))) ∈ LFinGen ↔ (𝑇 ↾_s (𝐹 “ 𝐴)) ∈ LFinGen))
51	47, 50	syl5ibcom 244	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → (((LSpan‘𝑆)‘𝑥) = 𝐴 → (𝑇 ↾_s (𝐹 “ 𝐴)) ∈ LFinGen))
52	51	rexlimdva 3155	. . 3 ⊢ (𝜑 → (∃𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)((LSpan‘𝑆)‘𝑥) = 𝐴 → (𝑇 ↾_s (𝐹 “ 𝐴)) ∈ LFinGen))
53	13, 52	mpd 15	. 2 ⊢ (𝜑 → (𝑇 ↾_s (𝐹 “ 𝐴)) ∈ LFinGen)
54	1, 53	eqeltrid 2837	1 ⊢ (𝜑 → 𝑌 ∈ LFinGen)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∃wrex 3070 ∩ cin 3946 ⊆ wss 3947 𝒫 cpw 4601 dom cdm 5675 ran crn 5676 ↾ cres 5677 “ cima 5678 Fun wfun 6534 ⟶wf 6536 –onto→wfo 6538 ‘cfv 6540 (class class class)co 7405 Fincfn 8935 Basecbs 17140 ↾_s cress 17169 LModclmod 20463 LSubSpclss 20534 LSpanclspn 20574 LMHom clmhm 20622 LFinGenclfig 41794

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8699 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-nn 12209 df-2 12271 df-3 12272 df-4 12273 df-5 12274 df-6 12275 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17141 df-ress 17170 df-plusg 17206 df-sca 17209 df-vsca 17210 df-0g 17383 df-mgm 18557 df-sgrp 18606 df-mnd 18622 df-grp 18818 df-minusg 18819 df-sbg 18820 df-subg 18997 df-ghm 19084 df-mgp 19982 df-ur 19999 df-ring 20051 df-lmod 20465 df-lss 20535 df-lsp 20575 df-lmhm 20625 df-lfig 41795

This theorem is referenced by: lnmepi 41812

W3C validator