Theorem islssm 14315

Description: The predicate "is a subspace" (of a left module or left vector space). (Contributed by NM, 8-Dec-2013.) (Revised by Mario Carneiro, 8-Jan-2015.)

Hypotheses

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

Assertion

Ref	Expression
islssm	⊢ (𝑈 ∈ 𝑆 ↔ (𝑈 ⊆ 𝑉 ∧ ∃𝑗 𝑗 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑈 ∀𝑏 ∈ 𝑈 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑈))

Distinct variable groups:   𝑥,𝐵   𝑎,𝑏,𝑥,𝑊   𝑈,𝑎,𝑏,𝑥,𝑗

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

Proof of Theorem islssm

Dummy variables 𝑠 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		lssset.s	. . 3 ⊢ 𝑆 = (LSubSp‘𝑊)
2	1	lssmex 14313	. 2 ⊢ (𝑈 ∈ 𝑆 → 𝑊 ∈ V)
3		eleq1w 2290	. . . . . 6 ⊢ (𝑘 = 𝑗 → (𝑘 ∈ 𝑈 ↔ 𝑗 ∈ 𝑈))
4	3	cbvexv 1965	. . . . 5 ⊢ (∃𝑘 𝑘 ∈ 𝑈 ↔ ∃𝑗 𝑗 ∈ 𝑈)
5		ssel 3218	. . . . . . 7 ⊢ (𝑈 ⊆ 𝑉 → (𝑘 ∈ 𝑈 → 𝑘 ∈ 𝑉))
6		lssset.v	. . . . . . . 8 ⊢ 𝑉 = (Base‘𝑊)
7	6	basmex 13087	. . . . . . 7 ⊢ (𝑘 ∈ 𝑉 → 𝑊 ∈ V)
8	5, 7	syl6 33	. . . . . 6 ⊢ (𝑈 ⊆ 𝑉 → (𝑘 ∈ 𝑈 → 𝑊 ∈ V))
9	8	exlimdv 1865	. . . . 5 ⊢ (𝑈 ⊆ 𝑉 → (∃𝑘 𝑘 ∈ 𝑈 → 𝑊 ∈ V))
10	4, 9	biimtrrid 153	. . . 4 ⊢ (𝑈 ⊆ 𝑉 → (∃𝑗 𝑗 ∈ 𝑈 → 𝑊 ∈ V))
11	10	imp 124	. . 3 ⊢ ((𝑈 ⊆ 𝑉 ∧ ∃𝑗 𝑗 ∈ 𝑈) → 𝑊 ∈ V)
12	11	3adant3 1041	. 2 ⊢ ((𝑈 ⊆ 𝑉 ∧ ∃𝑗 𝑗 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑈 ∀𝑏 ∈ 𝑈 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑈) → 𝑊 ∈ V)
13		lssset.f	. . . . 5 ⊢ 𝐹 = (Scalar‘𝑊)
14		lssset.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐹)
15		lssset.p	. . . . 5 ⊢ + = (+g‘𝑊)
16		lssset.t	. . . . 5 ⊢ · = ( ·𝑠 ‘𝑊)
17	13, 14, 6, 15, 16, 1	lsssetm 14314	. . . 4 ⊢ (𝑊 ∈ V → 𝑆 = {𝑠 ∈ 𝒫 𝑉 ∣ (∃𝑗 𝑗 ∈ 𝑠 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠)})
18	17	eleq2d 2299	. . 3 ⊢ (𝑊 ∈ V → (𝑈 ∈ 𝑆 ↔ 𝑈 ∈ {𝑠 ∈ 𝒫 𝑉 ∣ (∃𝑗 𝑗 ∈ 𝑠 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠)}))
19		basfn 13086	. . . . . . . 8 ⊢ Base Fn V
20		funfvex 5643	. . . . . . . . 9 ⊢ ((Fun Base ∧ 𝑊 ∈ dom Base) → (Base‘𝑊) ∈ V)
21	20	funfni 5422	. . . . . . . 8 ⊢ ((Base Fn V ∧ 𝑊 ∈ V) → (Base‘𝑊) ∈ V)
22	19, 21	mpan 424	. . . . . . 7 ⊢ (𝑊 ∈ V → (Base‘𝑊) ∈ V)
23	6, 22	eqeltrid 2316	. . . . . 6 ⊢ (𝑊 ∈ V → 𝑉 ∈ V)
24		elpw2g 4239	. . . . . 6 ⊢ (𝑉 ∈ V → (𝑈 ∈ 𝒫 𝑉 ↔ 𝑈 ⊆ 𝑉))
25	23, 24	syl 14	. . . . 5 ⊢ (𝑊 ∈ V → (𝑈 ∈ 𝒫 𝑉 ↔ 𝑈 ⊆ 𝑉))
26	25	anbi1d 465	. . . 4 ⊢ (𝑊 ∈ V → ((𝑈 ∈ 𝒫 𝑉 ∧ (∃𝑗 𝑗 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑈 ∀𝑏 ∈ 𝑈 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑈)) ↔ (𝑈 ⊆ 𝑉 ∧ (∃𝑗 𝑗 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑈 ∀𝑏 ∈ 𝑈 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑈))))
27		eleq2 2293	. . . . . . 7 ⊢ (𝑠 = 𝑈 → (𝑗 ∈ 𝑠 ↔ 𝑗 ∈ 𝑈))
28	27	exbidv 1871	. . . . . 6 ⊢ (𝑠 = 𝑈 → (∃𝑗 𝑗 ∈ 𝑠 ↔ ∃𝑗 𝑗 ∈ 𝑈))
29		eleq2 2293	. . . . . . . . 9 ⊢ (𝑠 = 𝑈 → (((𝑥 · 𝑎) + 𝑏) ∈ 𝑠 ↔ ((𝑥 · 𝑎) + 𝑏) ∈ 𝑈))
30	29	raleqbi1dv 2740	. . . . . . . 8 ⊢ (𝑠 = 𝑈 → (∀𝑏 ∈ 𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠 ↔ ∀𝑏 ∈ 𝑈 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑈))
31	30	raleqbi1dv 2740	. . . . . . 7 ⊢ (𝑠 = 𝑈 → (∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠 ↔ ∀𝑎 ∈ 𝑈 ∀𝑏 ∈ 𝑈 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑈))
32	31	ralbidv 2530	. . . . . 6 ⊢ (𝑠 = 𝑈 → (∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠 ↔ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑈 ∀𝑏 ∈ 𝑈 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑈))
33	28, 32	anbi12d 473	. . . . 5 ⊢ (𝑠 = 𝑈 → ((∃𝑗 𝑗 ∈ 𝑠 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠) ↔ (∃𝑗 𝑗 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑈 ∀𝑏 ∈ 𝑈 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑈)))
34	33	elrab 2959	. . . 4 ⊢ (𝑈 ∈ {𝑠 ∈ 𝒫 𝑉 ∣ (∃𝑗 𝑗 ∈ 𝑠 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠)} ↔ (𝑈 ∈ 𝒫 𝑉 ∧ (∃𝑗 𝑗 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑈 ∀𝑏 ∈ 𝑈 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑈)))
35		3anass 1006	. . . 4 ⊢ ((𝑈 ⊆ 𝑉 ∧ ∃𝑗 𝑗 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑈 ∀𝑏 ∈ 𝑈 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑈) ↔ (𝑈 ⊆ 𝑉 ∧ (∃𝑗 𝑗 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑈 ∀𝑏 ∈ 𝑈 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑈)))
36	26, 34, 35	3bitr4g 223	. . 3 ⊢ (𝑊 ∈ V → (𝑈 ∈ {𝑠 ∈ 𝒫 𝑉 ∣ (∃𝑗 𝑗 ∈ 𝑠 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠)} ↔ (𝑈 ⊆ 𝑉 ∧ ∃𝑗 𝑗 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑈 ∀𝑏 ∈ 𝑈 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑈)))
37	18, 36	bitrd 188	. 2 ⊢ (𝑊 ∈ V → (𝑈 ∈ 𝑆 ↔ (𝑈 ⊆ 𝑉 ∧ ∃𝑗 𝑗 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑈 ∀𝑏 ∈ 𝑈 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑈)))
38	2, 12, 37	pm5.21nii 709	1 ⊢ (𝑈 ∈ 𝑆 ↔ (𝑈 ⊆ 𝑉 ∧ ∃𝑗 𝑗 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑈 ∀𝑏 ∈ 𝑈 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑈))

Syntax hints:   ∧ wa 104   ↔ wb 105   ∧ w3a 1002   = wceq 1395  ∃wex 1538   ∈ wcel 2200  ∀wral 2508  {crab 2512  Vcvv 2799   ⊆ wss 3197  𝒫 cpw 3649   Fn wfn 5312  ‘cfv 5317  (class class class)co 6000  Basecbs 13027  +_gcplusg 13105  Scalarcsca 13108   ·_𝑠 cvsca 13109  LSubSpclss 14310

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-cnex 8086  ax-resscn 8087  ax-1re 8089  ax-addrcl 8092

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-iota 5277  df-fun 5319  df-fn 5320  df-fv 5325  df-ov 6003  df-inn 9107  df-ndx 13030  df-slot 13031  df-base 13033  df-lssm 14311

This theorem is referenced by:  islidlm  14437