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 39626
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 3478 . . 3 (𝑊𝑋𝑊 ∈ V)
3 fveq2 6871 . . . . . . . 8 (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
4 lsatset.v . . . . . . . 8 𝑉 = (Base‘𝑊)
53, 4eqtr4di 2818 . . . . . . 7 (𝑤 = 𝑊 → (Base‘𝑤) = 𝑉)
6 fveq2 6871 . . . . . . . . 9 (𝑤 = 𝑊 → (0g𝑤) = (0g𝑊))
7 lsatset.z . . . . . . . . 9 0 = (0g𝑊)
86, 7eqtr4di 2818 . . . . . . . 8 (𝑤 = 𝑊 → (0g𝑤) = 0 )
98sneqd 4597 . . . . . . 7 (𝑤 = 𝑊 → {(0g𝑤)} = { 0 })
105, 9difeq12d 4084 . . . . . 6 (𝑤 = 𝑊 → ((Base‘𝑤) ∖ {(0g𝑤)}) = (𝑉 ∖ { 0 }))
11 fveq2 6871 . . . . . . . 8 (𝑤 = 𝑊 → (LSpan‘𝑤) = (LSpan‘𝑊))
12 lsatset.n . . . . . . . 8 𝑁 = (LSpan‘𝑊)
1311, 12eqtr4di 2818 . . . . . . 7 (𝑤 = 𝑊 → (LSpan‘𝑤) = 𝑁)
1413fveq1d 6873 . . . . . 6 (𝑤 = 𝑊 → ((LSpan‘𝑤)‘{𝑣}) = (𝑁‘{𝑣}))
1510, 14mpteq12dv 5192 . . . . 5 (𝑤 = 𝑊 → (𝑣 ∈ ((Base‘𝑤) ∖ {(0g𝑤)}) ↦ ((LSpan‘𝑤)‘{𝑣})) = (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
1615rneqd 5919 . . . 4 (𝑤 = 𝑊 → ran (𝑣 ∈ ((Base‘𝑤) ∖ {(0g𝑤)}) ↦ ((LSpan‘𝑤)‘{𝑣})) = ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
17 df-lsatoms 39612 . . . 4 LSAtoms = (𝑤 ∈ V ↦ ran (𝑣 ∈ ((Base‘𝑤) ∖ {(0g𝑤)}) ↦ ((LSpan‘𝑤)‘{𝑣})))
1812fvexi 6885 . . . . . . 7 𝑁 ∈ V
1918rnex 7895 . . . . . 6 ran 𝑁 ∈ V
20 snex 5401 . . . . . 6 {∅} ∈ V
2119, 20unex 7731 . . . . 5 (ran 𝑁 ∪ {∅}) ∈ V
22 eqid 2765 . . . . . . 7 (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})) = (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣}))
23 fvrn0 6899 . . . . . . . 8 (𝑁‘{𝑣}) ∈ (ran 𝑁 ∪ {∅})
2423a1i 11 . . . . . . 7 (𝑣 ∈ (𝑉 ∖ { 0 }) → (𝑁‘{𝑣}) ∈ (ran 𝑁 ∪ {∅}))
2522, 24fmpti 7097 . . . . . 6 (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})):(𝑉 ∖ { 0 })⟶(ran 𝑁 ∪ {∅})
26 frn 6703 . . . . . 6 ((𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})):(𝑉 ∖ { 0 })⟶(ran 𝑁 ∪ {∅}) → ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})) ⊆ (ran 𝑁 ∪ {∅}))
2725, 26ax-mp 5 . . . . 5 ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})) ⊆ (ran 𝑁 ∪ {∅})
2821, 27ssexi 5283 . . . 4 ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})) ∈ V
2916, 17, 28fvmpt 6979 . . 3 (𝑊 ∈ V → (LSAtoms‘𝑊) = ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
302, 29syl 18 . 2 (𝑊𝑋 → (LSAtoms‘𝑊) = ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
311, 30eqtrid 2812 1 (𝑊𝑋𝐴 = ran (𝑣 ∈ (𝑉 ∖ { 0 }) ↦ (𝑁‘{𝑣})))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1563  wcel 2145  Vcvv 3457  cdif 3904  cun 3905  wss 3907  c0 4288  {csn 4585  cmpt 5186  ran crn 5653  wf 6521  cfv 6525  Basecbs 17259  0gc0g 17482  LSpanclspn 21061  LSAtomsclsa 39610
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-nul 5261  ax-pr 5395  ax-un 7722
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-opab 5168  df-mpt 5187  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-fv 6533  df-lsatoms 39612
This theorem is referenced by:  islsat  39627  lsatlss  39632
  Copyright terms: Public domain W3C validator