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 42404

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 20881	. . . . . 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 2726	. . . . . 6 ⊢ (LSpan‘𝑆) = (LSpan‘𝑆)
10		eqid 2726	. . . . . 6 ⊢ (Base‘𝑆) = (Base‘𝑆)
11	7, 8, 9, 10	islssfg2 42391	. . . . 5 ⊢ ((𝑆 ∈ LMod ∧ 𝐴 ∈ 𝑈) → (𝑋 ∈ LFinGen ↔ ∃𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)((LSpan‘𝑆)‘𝑥) = 𝐴))
12	5, 6, 11	syl2anc 583	. . . 4 ⊢ (𝜑 → (𝑋 ∈ LFinGen ↔ ∃𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)((LSpan‘𝑆)‘𝑥) = 𝐴))
13	2, 12	mpbid 231	. . 3 ⊢ (𝜑 → ∃𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)((LSpan‘𝑆)‘𝑥) = 𝐴)
14		inss1 4223	. . . . . . . . . 10 ⊢ (𝒫 (Base‘𝑆) ∩ Fin) ⊆ 𝒫 (Base‘𝑆)
15	14	sseli 3973	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin) → 𝑥 ∈ 𝒫 (Base‘𝑆))
16	15	elpwid 4606	. . . . . . . 8 ⊢ (𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin) → 𝑥 ⊆ (Base‘𝑆))
17		eqid 2726	. . . . . . . . 9 ⊢ (LSpan‘𝑇) = (LSpan‘𝑇)
18	10, 9, 17	lmhmlsp 20897	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑥 ⊆ (Base‘𝑆)) → (𝐹 “ ((LSpan‘𝑆)‘𝑥)) = ((LSpan‘𝑇)‘(𝐹 “ 𝑥)))
19	3, 16, 18	syl2an 595	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → (𝐹 “ ((LSpan‘𝑆)‘𝑥)) = ((LSpan‘𝑇)‘(𝐹 “ 𝑥)))
20	19	oveq2d 7421	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → (𝑇 ↾_s (𝐹 “ ((LSpan‘𝑆)‘𝑥))) = (𝑇 ↾_s ((LSpan‘𝑇)‘(𝐹 “ 𝑥))))
21		lmhmlmod2 20880	. . . . . . . . 9 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝑇 ∈ LMod)
22	3, 21	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑇 ∈ LMod)
23	22	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → 𝑇 ∈ LMod)
24		imassrn 6064	. . . . . . . . 9 ⊢ (𝐹 “ 𝑥) ⊆ ran 𝐹
25		eqid 2726	. . . . . . . . . . . 12 ⊢ (Base‘𝑇) = (Base‘𝑇)
26	10, 25	lmhmf 20882	. . . . . . . . . . 11 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
27	3, 26	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
28	27	frnd 6719	. . . . . . . . 9 ⊢ (𝜑 → ran 𝐹 ⊆ (Base‘𝑇))
29	24, 28	sstrid 3988	. . . . . . . 8 ⊢ (𝜑 → (𝐹 “ 𝑥) ⊆ (Base‘𝑇))
30	29	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → (𝐹 “ 𝑥) ⊆ (Base‘𝑇))
31		inss2 4224	. . . . . . . . . 10 ⊢ (𝒫 (Base‘𝑆) ∩ Fin) ⊆ Fin
32	31	sseli 3973	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin) → 𝑥 ∈ Fin)
33	32	adantl 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → 𝑥 ∈ Fin)
34	27	ffund 6715	. . . . . . . . . 10 ⊢ (𝜑 → Fun 𝐹)
35	34	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → Fun 𝐹)
36	16	adantl 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → 𝑥 ⊆ (Base‘𝑆))
37	27	fdmd 6722	. . . . . . . . . . 11 ⊢ (𝜑 → dom 𝐹 = (Base‘𝑆))
38	37	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → dom 𝐹 = (Base‘𝑆))
39	36, 38	sseqtrrd 4018	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → 𝑥 ⊆ dom 𝐹)
40		fores 6809	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑥 ⊆ dom 𝐹) → (𝐹 ↾ 𝑥):𝑥–onto→(𝐹 “ 𝑥))
41	35, 39, 40	syl2anc 583	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → (𝐹 ↾ 𝑥):𝑥–onto→(𝐹 “ 𝑥))
42		fofi 9340	. . . . . . . 8 ⊢ ((𝑥 ∈ Fin ∧ (𝐹 ↾ 𝑥):𝑥–onto→(𝐹 “ 𝑥)) → (𝐹 “ 𝑥) ∈ Fin)
43	33, 41, 42	syl2anc 583	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → (𝐹 “ 𝑥) ∈ Fin)
44		eqid 2726	. . . . . . . 8 ⊢ (𝑇 ↾_s ((LSpan‘𝑇)‘(𝐹 “ 𝑥))) = (𝑇 ↾_s ((LSpan‘𝑇)‘(𝐹 “ 𝑥)))
45	17, 25, 44	islssfgi 42392	. . . . . . 7 ⊢ ((𝑇 ∈ LMod ∧ (𝐹 “ 𝑥) ⊆ (Base‘𝑇) ∧ (𝐹 “ 𝑥) ∈ Fin) → (𝑇 ↾_s ((LSpan‘𝑇)‘(𝐹 “ 𝑥))) ∈ LFinGen)
46	23, 30, 43, 45	syl3anc 1368	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → (𝑇 ↾_s ((LSpan‘𝑇)‘(𝐹 “ 𝑥))) ∈ LFinGen)
47	20, 46	eqeltrd 2827	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → (𝑇 ↾_s (𝐹 “ ((LSpan‘𝑆)‘𝑥))) ∈ LFinGen)
48		imaeq2 6049	. . . . . . 7 ⊢ (((LSpan‘𝑆)‘𝑥) = 𝐴 → (𝐹 “ ((LSpan‘𝑆)‘𝑥)) = (𝐹 “ 𝐴))
49	48	oveq2d 7421	. . . . . 6 ⊢ (((LSpan‘𝑆)‘𝑥) = 𝐴 → (𝑇 ↾_s (𝐹 “ ((LSpan‘𝑆)‘𝑥))) = (𝑇 ↾_s (𝐹 “ 𝐴)))
50	49	eleq1d 2812	. . . . 5 ⊢ (((LSpan‘𝑆)‘𝑥) = 𝐴 → ((𝑇 ↾_s (𝐹 “ ((LSpan‘𝑆)‘𝑥))) ∈ LFinGen ↔ (𝑇 ↾_s (𝐹 “ 𝐴)) ∈ LFinGen))
51	47, 50	syl5ibcom 244	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)) → (((LSpan‘𝑆)‘𝑥) = 𝐴 → (𝑇 ↾_s (𝐹 “ 𝐴)) ∈ LFinGen))
52	51	rexlimdva 3149	. . 3 ⊢ (𝜑 → (∃𝑥 ∈ (𝒫 (Base‘𝑆) ∩ Fin)((LSpan‘𝑆)‘𝑥) = 𝐴 → (𝑇 ↾_s (𝐹 “ 𝐴)) ∈ LFinGen))
53	13, 52	mpd 15	. 2 ⊢ (𝜑 → (𝑇 ↾_s (𝐹 “ 𝐴)) ∈ LFinGen)
54	1, 53	eqeltrid 2831	1 ⊢ (𝜑 → 𝑌 ∈ LFinGen)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1533 ∈ wcel 2098 ∃wrex 3064 ∩ cin 3942 ⊆ wss 3943 𝒫 cpw 4597 dom cdm 5669 ran crn 5670 ↾ cres 5671 “ cima 5672 Fun wfun 6531 ⟶wf 6533 –onto→wfo 6535 ‘cfv 6537 (class class class)co 7405 Fincfn 8941 Basecbs 17153 ↾_s cress 17182 LModclmod 20706 LSubSpclss 20778 LSpanclspn 20818 LMHom clmhm 20867 LFinGenclfig 42387

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7722 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-nel 3041 df-ral 3056 df-rex 3065 df-rmo 3370 df-reu 3371 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-pss 3962 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-op 4630 df-uni 4903 df-int 4944 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6294 df-ord 6361 df-on 6362 df-lim 6363 df-suc 6364 df-iota 6489 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7853 df-1st 7974 df-2nd 7975 df-frecs 8267 df-wrecs 8298 df-recs 8372 df-rdg 8411 df-1o 8467 df-er 8705 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-nn 12217 df-2 12279 df-3 12280 df-4 12281 df-5 12282 df-6 12283 df-sets 17106 df-slot 17124 df-ndx 17136 df-base 17154 df-ress 17183 df-plusg 17219 df-sca 17222 df-vsca 17223 df-0g 17396 df-mgm 18573 df-sgrp 18652 df-mnd 18668 df-grp 18866 df-minusg 18867 df-sbg 18868 df-subg 19050 df-ghm 19139 df-mgp 20040 df-ur 20087 df-ring 20140 df-lmod 20708 df-lss 20779 df-lsp 20819 df-lmhm 20870 df-lfig 42388

This theorem is referenced by: lnmepi 42405

W3C validator