Theorem lsatset 40250

Description: The set of all 1-dim subspaces (atoms) of a left module or left vector space. (Contributed by NM, 9-Apr-2014.) (Revised by Mario Carneiro, 22-Sep-2015.)

Hypotheses

Ref	Expression
lsatset.v	⊢ 𝑉 = (Base‘𝑊)
lsatset.n	⊢ 𝑁 = (LSpan‘𝑊)
lsatset.z	⊢ 0 = (0g‘𝑊)
lsatset.a	⊢ 𝐴 = (LSAtoms‘𝑊)

Assertion

Ref	Expression
lsatset	⊢ (𝑊 ∈ 𝑋 → 𝐴 = ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))

Distinct variable groups:   𝑣,𝑁   𝑣,𝑉   𝑣,𝑊   𝑣, 0   𝑣,𝑋

Allowed substitution hint:   𝐴(𝑣)

Proof of Theorem lsatset

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		lsatset.a	. 2 ⊢ 𝐴 = (LSAtoms‘𝑊)
2		elex 3475	. . 3 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V)
3		fveq2 6911	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
4		lsatset.v	. . . . . . . 8 ⊢ 𝑉 = (Base‘𝑊)
5	3, 4	eqtr4di 2816	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = 𝑉)
6		fveq2 6911	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (0g‘𝑤) = (0g‘𝑊))
7		lsatset.z	. . . . . . . . 9 ⊢ 0 = (0g‘𝑊)
8	6, 7	eqtr4di 2816	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (0g‘𝑤) = 0 )
9	8	sneqd 4596	. . . . . . 7 ⊢ (𝑤 = 𝑊 → {(0g‘𝑤)} = { 0 })
10	5, 9	difeq12d 4067	. . . . . 6 ⊢ (𝑤 = 𝑊 → ((Base‘𝑤) ∖ {(0g‘𝑤)}) = (𝑉 ∖ { 0 }))
11		fveq2 6911	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (LSpan‘𝑤) = (LSpan‘𝑊))
12		lsatset.n	. . . . . . . 8 ⊢ 𝑁 = (LSpan‘𝑊)
13	11, 12	eqtr4di 2816	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (LSpan‘𝑤) = 𝑁)
14	13	fveq1d 6913	. . . . . 6 ⊢ (𝑤 = 𝑊 → ((LSpan‘𝑤)‘{𝑣}) = (𝑁‘{𝑣}))
15	10, 14	mpteq12dv 5196	. . . . 5 ⊢ (𝑤 = 𝑊 → (𝑣 ∈ ((Base‘𝑤) ∖ {(0g‘𝑤)}) ↦ ((LSpan‘𝑤)‘{𝑣})) = (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
16	15	rneqd 5928	. . . 4 ⊢ (𝑤 = 𝑊 → ran (𝑣 ∈ ((Base‘𝑤) ∖ {(0g‘𝑤)}) ↦ ((LSpan‘𝑤)‘{𝑣})) = ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
17		df-lsatoms 40236	. . . 4 ⊢ LSAtoms = (𝑤 ∈ V ↦ ran (𝑣 ∈ ((Base‘𝑤) ∖ {(0g‘𝑤)}) ↦ ((LSpan‘𝑤)‘{𝑣})))
18	12	fvexi 6925	. . . . . . 7 ⊢ 𝑁 ∈ V
19	18	rnex 7949	. . . . . 6 ⊢ ran 𝑁 ∈ V
20		snex 5402	. . . . . 6 ⊢ {∅} ∈ V
21	19, 20	unex 7788	. . . . 5 ⊢ (ran 𝑁 ∪ {∅}) ∈ V
22		eqid 2763	. . . . . . 7 ⊢ (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})) = (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣}))
23		fvrn0 6939	. . . . . . . 8 ⊢ (𝑁‘{𝑣}) ∈ (ran 𝑁 ∪ {∅})
24	23	a1i 11	. . . . . . 7 ⊢ (𝑣 ∈ (𝑉 ∖ { 0 }) → (𝑁‘{𝑣}) ∈ (ran 𝑁 ∪ {∅}))
25	22, 24	fmpti 7139	. . . . . 6 ⊢ (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})):(𝑉 ∖ { 0 })⟶(ran 𝑁 ∪ {∅})
26		frn 6742	. . . . . 6 ⊢ ((𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})):(𝑉 ∖ { 0 })⟶(ran 𝑁 ∪ {∅}) → ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})) ⊆ (ran 𝑁 ∪ {∅}))
27	25, 26	ax-mp 5	. . . . 5 ⊢ ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})) ⊆ (ran 𝑁 ∪ {∅})
28	21, 27	ssexi 5289	. . . 4 ⊢ ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})) ∈ V
29	16, 17, 28	fvmpt 7019	. . 3 ⊢ (𝑊 ∈ V → (LSAtoms‘𝑊) = ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
30	2, 29	syl 18	. 2 ⊢ (𝑊 ∈ 𝑋 → (LSAtoms‘𝑊) = ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
31	1, 30	eqtrid 2810	1 ⊢ (𝑊 ∈ 𝑋 → 𝐴 = ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   ∖ cdif 4048   ∪ cun 4152  ∅c0 4281  {csn 4588   ↦ cmpt 5190  ran crn 5657  ⟶wf 6557  ‘cfv 6561  Basecbs 17419  0_gc0g 17642  LSpanclspn 21279  LSAtomsclsa 40234

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-pr 5396  ax-un 7778

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  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-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-fv 6569  df-lsatoms 40236

This theorem is used by:  islsat  40251  lsatlss  40256