Theorem lsatset 39871

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 3474	. . 3 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V)
3		fveq2 6882	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
4		lsatset.v	. . . . . . . 8 ⊢ 𝑉 = (Base‘𝑊)
5	3, 4	eqtr4di 2815	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = 𝑉)
6		fveq2 6882	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (0g‘𝑤) = (0g‘𝑊))
7		lsatset.z	. . . . . . . . 9 ⊢ 0 = (0g‘𝑊)
8	6, 7	eqtr4di 2815	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (0g‘𝑤) = 0 )
9	8	sneqd 4599	. . . . . . 7 ⊢ (𝑤 = 𝑊 → {(0g‘𝑤)} = { 0 })
10	5, 9	difeq12d 4078	. . . . . 6 ⊢ (𝑤 = 𝑊 → ((Base‘𝑤) ∖ {(0g‘𝑤)}) = (𝑉 ∖ { 0 }))
11		fveq2 6882	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (LSpan‘𝑤) = (LSpan‘𝑊))
12		lsatset.n	. . . . . . . 8 ⊢ 𝑁 = (LSpan‘𝑊)
13	11, 12	eqtr4di 2815	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (LSpan‘𝑤) = 𝑁)
14	13	fveq1d 6884	. . . . . 6 ⊢ (𝑤 = 𝑊 → ((LSpan‘𝑤)‘{𝑣}) = (𝑁‘{𝑣}))
15	10, 14	mpteq12dv 5196	. . . . 5 ⊢ (𝑤 = 𝑊 → (𝑣 ∈ ((Base‘𝑤) ∖ {(0g‘𝑤)}) ↦ ((LSpan‘𝑤)‘{𝑣})) = (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
16	15	rneqd 5926	. . . 4 ⊢ (𝑤 = 𝑊 → ran (𝑣 ∈ ((Base‘𝑤) ∖ {(0g‘𝑤)}) ↦ ((LSpan‘𝑤)‘{𝑣})) = ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
17		df-lsatoms 39857	. . . 4 ⊢ LSAtoms = (𝑤 ∈ V ↦ ran (𝑣 ∈ ((Base‘𝑤) ∖ {(0g‘𝑤)}) ↦ ((LSpan‘𝑤)‘{𝑣})))
18	12	fvexi 6896	. . . . . . 7 ⊢ 𝑁 ∈ V
19	18	rnex 7911	. . . . . 6 ⊢ ran 𝑁 ∈ V
20		snex 5408	. . . . . 6 ⊢ {∅} ∈ V
21	19, 20	unex 7750	. . . . 5 ⊢ (ran 𝑁 ∪ {∅}) ∈ V
22		eqid 2762	. . . . . . 7 ⊢ (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})) = (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣}))
23		fvrn0 6910	. . . . . . . 8 ⊢ (𝑁‘{𝑣}) ∈ (ran 𝑁 ∪ {∅})
24	23	a1i 11	. . . . . . 7 ⊢ (𝑣 ∈ (𝑉 ∖ { 0 }) → (𝑁‘{𝑣}) ∈ (ran 𝑁 ∪ {∅}))
25	22, 24	fmpti 7109	. . . . . 6 ⊢ (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})):(𝑉 ∖ { 0 })⟶(ran 𝑁 ∪ {∅})
26		frn 6714	. . . . . 6 ⊢ ((𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})):(𝑉 ∖ { 0 })⟶(ran 𝑁 ∪ {∅}) → ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})) ⊆ (ran 𝑁 ∪ {∅}))
27	25, 26	ax-mp 5	. . . . 5 ⊢ ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})) ⊆ (ran 𝑁 ∪ {∅})
28	21, 27	ssexi 5291	. . . 4 ⊢ ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})) ∈ V
29	16, 17, 28	fvmpt 6990	. . 3 ⊢ (𝑊 ∈ V → (LSAtoms‘𝑊) = ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
30	2, 29	syl 18	. 2 ⊢ (𝑊 ∈ 𝑋 → (LSAtoms‘𝑊) = ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
31	1, 30	eqtrid 2809	1 ⊢ (𝑊 ∈ 𝑋 → 𝐴 = ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3453   ∖ cdif 3899   ∪ cun 3900   ⊆ wss 3902  ∅c0 4282  {csn 4587   ↦ cmpt 5190  ran crn 5660  ⟶wf 6533  ‘cfv 6537  Basecbs 17307  0_gc0g 17530  LSpanclspn 21161  LSAtomsclsa 39855

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7740

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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-lsatoms 39857

This theorem is used by:  islsat  39872  lsatlss  39877