Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  lsatset Structured version   Visualization version   GIF version

Theorem lsatset 37452
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.
StepHypRef Expression
1 lsatset.a . 2 𝐴 = (LSAtoms‘𝑊)
2 elex 3463 . . 3 (𝑊𝑋𝑊 ∈ V)
3 fveq2 6842 . . . . . . . 8 (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
4 lsatset.v . . . . . . . 8 𝑉 = (Base‘𝑊)
53, 4eqtr4di 2794 . . . . . . 7 (𝑤 = 𝑊 → (Base‘𝑤) = 𝑉)
6 fveq2 6842 . . . . . . . . 9 (𝑤 = 𝑊 → (0g𝑤) = (0g𝑊))
7 lsatset.z . . . . . . . . 9 0 = (0g𝑊)
86, 7eqtr4di 2794 . . . . . . . 8 (𝑤 = 𝑊 → (0g𝑤) = 0 )
98sneqd 4598 . . . . . . 7 (𝑤 = 𝑊 → {(0g𝑤)} = { 0 })
105, 9difeq12d 4083 . . . . . 6 (𝑤 = 𝑊 → ((Base‘𝑤) ∖ {(0g𝑤)}) = (𝑉 ∖ { 0 }))
11 fveq2 6842 . . . . . . . 8 (𝑤 = 𝑊 → (LSpan‘𝑤) = (LSpan‘𝑊))
12 lsatset.n . . . . . . . 8 𝑁 = (LSpan‘𝑊)
1311, 12eqtr4di 2794 . . . . . . 7 (𝑤 = 𝑊 → (LSpan‘𝑤) = 𝑁)
1413fveq1d 6844 . . . . . 6 (𝑤 = 𝑊 → ((LSpan‘𝑤)‘{𝑣}) = (𝑁‘{𝑣}))
1510, 14mpteq12dv 5196 . . . . 5 (𝑤 = 𝑊 → (𝑣 ∈ ((Base‘𝑤) ∖ {(0g𝑤)}) ↦ ((LSpan‘𝑤)‘{𝑣})) = (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
1615rneqd 5893 . . . 4 (𝑤 = 𝑊 → ran (𝑣 ∈ ((Base‘𝑤) ∖ {(0g𝑤)}) ↦ ((LSpan‘𝑤)‘{𝑣})) = ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
17 df-lsatoms 37438 . . . 4 LSAtoms = (𝑤 ∈ V ↦ ran (𝑣 ∈ ((Base‘𝑤) ∖ {(0g𝑤)}) ↦ ((LSpan‘𝑤)‘{𝑣})))
1812fvexi 6856 . . . . . . 7 𝑁 ∈ V
1918rnex 7849 . . . . . 6 ran 𝑁 ∈ V
20 p0ex 5339 . . . . . 6 {∅} ∈ V
2119, 20unex 7680 . . . . 5 (ran 𝑁 ∪ {∅}) ∈ V
22 eqid 2736 . . . . . . 7 (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})) = (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣}))
23 fvrn0 6872 . . . . . . . 8 (𝑁‘{𝑣}) ∈ (ran 𝑁 ∪ {∅})
2423a1i 11 . . . . . . 7 (𝑣 ∈ (𝑉 ∖ { 0 }) → (𝑁‘{𝑣}) ∈ (ran 𝑁 ∪ {∅}))
2522, 24fmpti 7060 . . . . . 6 (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})):(𝑉 ∖ { 0 })⟶(ran 𝑁 ∪ {∅})
26 frn 6675 . . . . . 6 ((𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})):(𝑉 ∖ { 0 })⟶(ran 𝑁 ∪ {∅}) → ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})) ⊆ (ran 𝑁 ∪ {∅}))
2725, 26ax-mp 5 . . . . 5 ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})) ⊆ (ran 𝑁 ∪ {∅})
2821, 27ssexi 5279 . . . 4 ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})) ∈ V
2916, 17, 28fvmpt 6948 . . 3 (𝑊 ∈ V → (LSAtoms‘𝑊) = ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
302, 29syl 17 . 2 (𝑊𝑋 → (LSAtoms‘𝑊) = ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
311, 30eqtrid 2788 1 (𝑊𝑋𝐴 = ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wcel 2106  Vcvv 3445  cdif 3907  cun 3908  wss 3910  c0 4282  {csn 4586  cmpt 5188  ran crn 5634  wf 6492  cfv 6496  Basecbs 17083  0gc0g 17321  LSpanclspn 20432  LSAtomsclsa 37436
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-fv 6504  df-lsatoms 37438
This theorem is referenced by:  islsat  37453  lsatlss  37458
  Copyright terms: Public domain W3C validator