Theorem lspfval 21299

Description: The span function for a left vector space (or a left module). (df-span 31968 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.

Step	Hyp	Ref	Expression
1		lspval.n	. 2 ⊢ 𝑁 = (LSpan‘𝑊)
2		elex 3475	. . 3 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V)
3		fveq2 6916	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
4		lspval.v	. . . . . . 7 ⊢ 𝑉 = (Base‘𝑊)
5	3, 4	eqtr4di 2816	. . . . . 6 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = 𝑉)
6	5	pweqd 4577	. . . . 5 ⊢ (𝑤 = 𝑊 → 𝒫 (Base‘𝑤) = 𝒫 𝑉)
7		fveq2 6916	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (LSubSp‘𝑤) = (LSubSp‘𝑊))
8		lspval.s	. . . . . . . 8 ⊢ 𝑆 = (LSubSp‘𝑊)
9	7, 8	eqtr4di 2816	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (LSubSp‘𝑤) = 𝑆)
10	9	rabeqdv 3431	. . . . . 6 ⊢ (𝑤 = 𝑊 → {𝑡 ∈ (LSubSp‘𝑤) ∣ 𝑠 ⊆ 𝑡} = {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})
11	10	inteqd 4917	. . . . 5 ⊢ (𝑤 = 𝑊 → ∩ {𝑡 ∈ (LSubSp‘𝑤) ∣ 𝑠 ⊆ 𝑡} = ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})
12	6, 11	mpteq12dv 5198	. . . 4 ⊢ (𝑤 = 𝑊 → (𝑠 ∈ 𝒫 (Base‘𝑤) ↦ ∩ {𝑡 ∈ (LSubSp‘𝑤) ∣ 𝑠 ⊆ 𝑡}) = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}))
13		df-lsp 21298	. . . 4 ⊢ LSpan = (𝑤 ∈ V ↦ (𝑠 ∈ 𝒫 (Base‘𝑤) ↦ ∩ {𝑡 ∈ (LSubSp‘𝑤) ∣ 𝑠 ⊆ 𝑡}))
14	4	fvexi 6930	. . . . . 6 ⊢ 𝑉 ∈ V
15	14	pwex 5349	. . . . 5 ⊢ 𝒫 𝑉 ∈ V
16	15	mptex 7260	. . . 4 ⊢ (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}) ∈ V
17	12, 13, 16	fvmpt 7024	. . 3 ⊢ (𝑊 ∈ V → (LSpan‘𝑊) = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}))
18	2, 17	syl 18	. 2 ⊢ (𝑊 ∈ 𝑋 → (LSpan‘𝑊) = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}))
19	1, 18	eqtrid 2810	1 ⊢ (𝑊 ∈ 𝑋 → 𝑁 = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  {crab 3416  Vcvv 3454   ⊆ wss 3900  𝒫 cpw 4560  ∩ cint 4912   ↦ cmpt 5192  ‘cfv 6566  Basecbs 17431  LSubSpclss 21257  LSpanclspn 21297

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-lsp 21298

This theorem is used by:  lspf  21300  lspval  21301  00lsp  21307  mrclsp  21315  lsppropd  21344