Theorem lsatset 40140

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 3471	. . 3 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V)
3		fveq2 6885	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
4		lsatset.v	. . . . . . . 8 ⊢ 𝑉 = (Base‘𝑊)
5	3, 4	eqtr4di 2813	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = 𝑉)
6		fveq2 6885	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (0g‘𝑤) = (0g‘𝑊))
7		lsatset.z	. . . . . . . . 9 ⊢ 0 = (0g‘𝑊)
8	6, 7	eqtr4di 2813	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (0g‘𝑤) = 0 )
9	8	sneqd 4592	. . . . . . 7 ⊢ (𝑤 = 𝑊 → {(0g‘𝑤)} = { 0 })
10	5, 9	difeq12d 4064	. . . . . 6 ⊢ (𝑤 = 𝑊 → ((Base‘𝑤) ∖ {(0g‘𝑤)}) = (𝑉 ∖ { 0 }))
11		fveq2 6885	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (LSpan‘𝑤) = (LSpan‘𝑊))
12		lsatset.n	. . . . . . . 8 ⊢ 𝑁 = (LSpan‘𝑊)
13	11, 12	eqtr4di 2813	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (LSpan‘𝑤) = 𝑁)
14	13	fveq1d 6887	. . . . . 6 ⊢ (𝑤 = 𝑊 → ((LSpan‘𝑤)‘{𝑣}) = (𝑁‘{𝑣}))
15	10, 14	mpteq12dv 5191	. . . . 5 ⊢ (𝑤 = 𝑊 → (𝑣 ∈ ((Base‘𝑤) ∖ {(0g‘𝑤)}) ↦ ((LSpan‘𝑤)‘{𝑣})) = (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
16	15	rneqd 5919	. . . 4 ⊢ (𝑤 = 𝑊 → ran (𝑣 ∈ ((Base‘𝑤) ∖ {(0g‘𝑤)}) ↦ ((LSpan‘𝑤)‘{𝑣})) = ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
17		df-lsatoms 40126	. . . 4 ⊢ LSAtoms = (𝑤 ∈ V ↦ ran (𝑣 ∈ ((Base‘𝑤) ∖ {(0g‘𝑤)}) ↦ ((LSpan‘𝑤)‘{𝑣})))
18	12	fvexi 6899	. . . . . . 7 ⊢ 𝑁 ∈ V
19	18	rnex 7922	. . . . . 6 ⊢ ran 𝑁 ∈ V
20		snex 5396	. . . . . 6 ⊢ {∅} ∈ V
21	19, 20	unex 7761	. . . . 5 ⊢ (ran 𝑁 ∪ {∅}) ∈ V
22		eqid 2760	. . . . . . 7 ⊢ (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})) = (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣}))
23		fvrn0 6913	. . . . . . . 8 ⊢ (𝑁‘{𝑣}) ∈ (ran 𝑁 ∪ {∅})
24	23	a1i 11	. . . . . . 7 ⊢ (𝑣 ∈ (𝑉 ∖ { 0 }) → (𝑁‘{𝑣}) ∈ (ran 𝑁 ∪ {∅}))
25	22, 24	fmpti 7112	. . . . . 6 ⊢ (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})):(𝑉 ∖ { 0 })⟶(ran 𝑁 ∪ {∅})
26		frn 6717	. . . . . 6 ⊢ ((𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})):(𝑉 ∖ { 0 })⟶(ran 𝑁 ∪ {∅}) → ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})) ⊆ (ran 𝑁 ∪ {∅}))
27	25, 26	ax-mp 5	. . . . 5 ⊢ ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})) ⊆ (ran 𝑁 ∪ {∅})
28	21, 27	ssexi 5283	. . . 4 ⊢ ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})) ∈ V
29	16, 17, 28	fvmpt 6993	. . 3 ⊢ (𝑊 ∈ V → (LSAtoms‘𝑊) = ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
30	2, 29	syl 18	. 2 ⊢ (𝑊 ∈ 𝑋 → (LSAtoms‘𝑊) = ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
31	1, 30	eqtrid 2807	1 ⊢ (𝑊 ∈ 𝑋 → 𝐴 = ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ⊆ wss 3895   ∖ cdif 4045   ∪ cun 4149  ∅c0 4278  {csn 4584   ↦ cmpt 5185  ran crn 5651  ⟶wf 6534  ‘cfv 6538  Basecbs 17392  0_gc0g 17615  LSpanclspn 21251  LSAtomsclsa 40124

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-lsatoms 40126

This theorem is used by:  islsat  40141  lsatlss  40146