MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  lspfval Structured version   Visualization version   GIF version

Theorem lspfval 21144
Description: The span function for a left vector space (or a left module). (df-span 31732 analog.) (Contributed by NM, 8-Dec-2013.) (Revised by Mario Carneiro, 19-Jun-2014.)
Hypotheses
Ref Expression
lspval.v 𝑉 = (Base‘𝑊)
lspval.s 𝑆 = (LSubSp‘𝑊)
lspval.n 𝑁 = (LSpan‘𝑊)
Assertion
Ref Expression
lspfval (𝑊𝑋𝑁 = (𝑠 ∈ 𝒫 𝑉 {𝑡𝑆𝑠𝑡}))
Distinct variable groups:   𝑡,𝑠,𝑆   𝑉,𝑠,𝑡   𝑊,𝑠
Allowed substitution hints:   𝑁(𝑡, 𝑠)   𝑊(𝑡)   𝑋(𝑡, 𝑠)

Proof of Theorem lspfval
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 lspval.n . 2 𝑁 = (LSpan‘𝑊)
2 elex 3478 . . 3 (𝑊𝑋𝑊 ∈ V)
3 fveq2 6885 . . . . . . 7 (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
4 lspval.v . . . . . . 7 𝑉 = (Base‘𝑊)
53, 4eqtr4di 2818 . . . . . 6 (𝑤 = 𝑊 → (Base‘𝑤) = 𝑉)
65pweqd 4581 . . . . 5 (𝑤 = 𝑊 → 𝒫 (Base‘𝑤) = 𝒫 𝑉)
7 fveq2 6885 . . . . . . . 8 (𝑤 = 𝑊 → (LSubSp‘𝑤) = (LSubSp‘𝑊))
8 lspval.s . . . . . . . 8 𝑆 = (LSubSp‘𝑊)
97, 8eqtr4di 2818 . . . . . . 7 (𝑤 = 𝑊 → (LSubSp‘𝑤) = 𝑆)
109rabeqdv 3433 . . . . . 6 (𝑤 = 𝑊 → {𝑡 ∈ (LSubSp‘𝑤) ∣ 𝑠𝑡} = {𝑡𝑆𝑠𝑡})
1110inteqd 4919 . . . . 5 (𝑤 = 𝑊 {𝑡 ∈ (LSubSp‘𝑤) ∣ 𝑠𝑡} = {𝑡𝑆𝑠𝑡})
126, 11mpteq12dv 5200 . . . 4 (𝑤 = 𝑊 → (𝑠 ∈ 𝒫 (Base‘𝑤) ↦ {𝑡 ∈ (LSubSp‘𝑤) ∣ 𝑠𝑡}) = (𝑠 ∈ 𝒫 𝑉 {𝑡𝑆𝑠𝑡}))
13 df-lsp 21143 . . . 4 LSpan = (𝑤 ∈ V ↦ (𝑠 ∈ 𝒫 (Base‘𝑤) ↦ {𝑡 ∈ (LSubSp‘𝑤) ∣ 𝑠𝑡}))
144fvexi 6899 . . . . . 6 𝑉 ∈ V
1514pwex 5353 . . . . 5 𝒫 𝑉 ∈ V
1615mptex 7228 . . . 4 (𝑠 ∈ 𝒫 𝑉 {𝑡𝑆𝑠𝑡}) ∈ V
1712, 13, 16fvmpt 6993 . . 3 (𝑊 ∈ V → (LSpan‘𝑊) = (𝑠 ∈ 𝒫 𝑉 {𝑡𝑆𝑠𝑡}))
182, 17syl 18 . 2 (𝑊𝑋 → (LSpan‘𝑊) = (𝑠 ∈ 𝒫 𝑉 {𝑡𝑆𝑠𝑡}))
191, 18eqtrid 2812 1 (𝑊𝑋𝑁 = (𝑠 ∈ 𝒫 𝑉 {𝑡𝑆𝑠𝑡}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  wcel 2146  {crab 3418  Vcvv 3457  wss 3906  𝒫 cpw 4564   cint 4914  cmpt 5194  cfv 6540  Basecbs 17291  LSubSpclss 21102  LSpanclspn 21142
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-lsp 21143
This theorem is used by:  lspf  21145  lspval  21146  00lsp  21152  mrclsp  21160  lsppropd  21189
  Copyright terms: Public domain W3C validator