Theorem lsssetm 14693

Description: The set of all (not necessarily closed) linear subspaces of a left module or left vector space. (Contributed by NM, 8-Dec-2013.) (Revised by Mario Carneiro, 15-Jul-2014.)

Hypotheses

Ref	Expression
lssset.f	⊢ 𝐹 = (Scalar‘𝑊)
lssset.b	⊢ 𝐵 = (Base‘𝐹)
lssset.v	⊢ 𝑉 = (Base‘𝑊)
lssset.p	⊢ + = (+g‘𝑊)
lssset.t	⊢ · = ( ·𝑠 ‘𝑊)
lssset.s	⊢ 𝑆 = (LSubSp‘𝑊)

Assertion

Ref	Expression
lsssetm	⊢ (𝑊 ∈ 𝑋 → 𝑆 = {𝑠 ∈ 𝒫 𝑉 ∣ (∃𝑗 𝑗 ∈ 𝑠 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠)})

Distinct variable groups:   + ,𝑠   𝑥,𝑠,𝐵   𝑉,𝑠   𝑎,𝑏,𝑠,𝑥,𝑊   · ,𝑠   𝑗,𝑎,𝑏,𝑠,𝑥

Allowed substitution hints:   𝐵(𝑗, 𝑎, 𝑏)   + (𝑥, 𝑗, 𝑎, 𝑏)   𝑆(𝑥, 𝑗, 𝑠, 𝑎, 𝑏)   · (𝑥, 𝑗, 𝑎, 𝑏)   𝐹(𝑥, 𝑗, 𝑠, 𝑎, 𝑏)   𝑉(𝑥, 𝑗, 𝑎, 𝑏)   𝑊(𝑗)   𝑋(𝑥, 𝑗, 𝑠, 𝑎, 𝑏)

Proof of Theorem lsssetm

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		lssset.s	. 2 ⊢ 𝑆 = (LSubSp‘𝑊)
2		df-lssm 14690	. . 3 ⊢ LSubSp = (𝑤 ∈ V ↦ {𝑠 ∈ 𝒫 (Base‘𝑤) ∣ (∃𝑗 𝑗 ∈ 𝑠 ∧ ∀𝑥 ∈ (Base‘(Scalar‘𝑤))∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑥( ·𝑠 ‘𝑤)𝑎)(+g‘𝑤)𝑏) ∈ 𝑠)})
3		fveq2 5695	. . . . . 6 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
4		lssset.v	. . . . . 6 ⊢ 𝑉 = (Base‘𝑊)
5	3, 4	eqtr4di 2289	. . . . 5 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = 𝑉)
6	5	pweqd 3693	. . . 4 ⊢ (𝑤 = 𝑊 → 𝒫 (Base‘𝑤) = 𝒫 𝑉)
7		fveq2 5695	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (Scalar‘𝑤) = (Scalar‘𝑊))
8		lssset.f	. . . . . . . . 9 ⊢ 𝐹 = (Scalar‘𝑊)
9	7, 8	eqtr4di 2289	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (Scalar‘𝑤) = 𝐹)
10	9	fveq2d 5699	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (Base‘(Scalar‘𝑤)) = (Base‘𝐹))
11		lssset.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐹)
12	10, 11	eqtr4di 2289	. . . . . 6 ⊢ (𝑤 = 𝑊 → (Base‘(Scalar‘𝑤)) = 𝐵)
13		fveq2 5695	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑊 → ( ·𝑠 ‘𝑤) = ( ·𝑠 ‘𝑊))
14		lssset.t	. . . . . . . . . . . 12 ⊢ · = ( ·𝑠 ‘𝑊)
15	13, 14	eqtr4di 2289	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑊 → ( ·𝑠 ‘𝑤) = · )
16	15	oveqd 6102	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (𝑥( ·𝑠 ‘𝑤)𝑎) = (𝑥 · 𝑎))
17	16	oveq1d 6100	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → ((𝑥( ·𝑠 ‘𝑤)𝑎)(+g‘𝑤)𝑏) = ((𝑥 · 𝑎)(+g‘𝑤)𝑏))
18		fveq2 5695	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑊 → (+g‘𝑤) = (+g‘𝑊))
19		lssset.p	. . . . . . . . . . 11 ⊢ + = (+g‘𝑊)
20	18, 19	eqtr4di 2289	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (+g‘𝑤) = + )
21	20	oveqd 6102	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → ((𝑥 · 𝑎)(+g‘𝑤)𝑏) = ((𝑥 · 𝑎) + 𝑏))
22	17, 21	eqtrd 2271	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → ((𝑥( ·𝑠 ‘𝑤)𝑎)(+g‘𝑤)𝑏) = ((𝑥 · 𝑎) + 𝑏))
23	22	eleq1d 2307	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (((𝑥( ·𝑠 ‘𝑤)𝑎)(+g‘𝑤)𝑏) ∈ 𝑠 ↔ ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠))
24	23	2ralbidv 2574	. . . . . 6 ⊢ (𝑤 = 𝑊 → (∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑥( ·𝑠 ‘𝑤)𝑎)(+g‘𝑤)𝑏) ∈ 𝑠 ↔ ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠))
25	12, 24	raleqbidv 2765	. . . . 5 ⊢ (𝑤 = 𝑊 → (∀𝑥 ∈ (Base‘(Scalar‘𝑤))∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑥( ·𝑠 ‘𝑤)𝑎)(+g‘𝑤)𝑏) ∈ 𝑠 ↔ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠))
26	25	anbi2d 468	. . . 4 ⊢ (𝑤 = 𝑊 → ((∃𝑗 𝑗 ∈ 𝑠 ∧ ∀𝑥 ∈ (Base‘(Scalar‘𝑤))∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑥( ·𝑠 ‘𝑤)𝑎)(+g‘𝑤)𝑏) ∈ 𝑠) ↔ (∃𝑗 𝑗 ∈ 𝑠 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠)))
27	6, 26	rabeqbidv 2816	. . 3 ⊢ (𝑤 = 𝑊 → {𝑠 ∈ 𝒫 (Base‘𝑤) ∣ (∃𝑗 𝑗 ∈ 𝑠 ∧ ∀𝑥 ∈ (Base‘(Scalar‘𝑤))∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑥( ·𝑠 ‘𝑤)𝑎)(+g‘𝑤)𝑏) ∈ 𝑠)} = {𝑠 ∈ 𝒫 𝑉 ∣ (∃𝑗 𝑗 ∈ 𝑠 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠)})
28		elex 2833	. . 3 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V)
29		basfn 13411	. . . . . . 7 ⊢ Base Fn V
30		funfvex 5712	. . . . . . . 8 ⊢ ((Fun Base ∧ 𝑊 ∈ dom Base) → (Base‘𝑊) ∈ V)
31	30	funfni 5483	. . . . . . 7 ⊢ ((Base Fn V ∧ 𝑊 ∈ V) → (Base‘𝑊) ∈ V)
32	29, 28, 31	sylancr 418	. . . . . 6 ⊢ (𝑊 ∈ 𝑋 → (Base‘𝑊) ∈ V)
33	4, 32	eqeltrid 2325	. . . . 5 ⊢ (𝑊 ∈ 𝑋 → 𝑉 ∈ V)
34	33	pwexd 4318	. . . 4 ⊢ (𝑊 ∈ 𝑋 → 𝒫 𝑉 ∈ V)
35		rabexg 4279	. . . 4 ⊢ (𝒫 𝑉 ∈ V → {𝑠 ∈ 𝒫 𝑉 ∣ (∃𝑗 𝑗 ∈ 𝑠 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠)} ∈ V)
36	34, 35	syl 14	. . 3 ⊢ (𝑊 ∈ 𝑋 → {𝑠 ∈ 𝒫 𝑉 ∣ (∃𝑗 𝑗 ∈ 𝑠 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠)} ∈ V)
37	2, 27, 28, 36	fvmptd3 5799	. 2 ⊢ (𝑊 ∈ 𝑋 → (LSubSp‘𝑊) = {𝑠 ∈ 𝒫 𝑉 ∣ (∃𝑗 𝑗 ∈ 𝑠 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠)})
38	1, 37	eqtrid 2283	1 ⊢ (𝑊 ∈ 𝑋 → 𝑆 = {𝑠 ∈ 𝒫 𝑉 ∣ (∃𝑗 𝑗 ∈ 𝑠 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠)})

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402  ∃wex 1545   ∈ wcel 2209  ∀wral 2528  {crab 2532  Vcvv 2821  𝒫 cpw 3688   Fn wfn 5372  ‘cfv 5377  (class class class)co 6085  Basecbs 13352  +_gcplusg 13431  Scalarcsca 13434   ·_𝑠 cvsca 13435  LSubSpclss 14689

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-ov 6088  df-inn 9305  df-ndx 13355  df-slot 13356  df-base 13358  df-lssm 14690

This theorem is used by:  islssm  14694  islssmg  14695