Theorem lspfval 21257

Description: The span function for a left vector space (or a left module). (df-span 31920 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 3471	. . 3 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V)
3		fveq2 6890	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
4		lspval.v	. . . . . . 7 ⊢ 𝑉 = (Base‘𝑊)
5	3, 4	eqtr4di 2813	. . . . . 6 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = 𝑉)
6	5	pweqd 4573	. . . . 5 ⊢ (𝑤 = 𝑊 → 𝒫 (Base‘𝑤) = 𝒫 𝑉)
7		fveq2 6890	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (LSubSp‘𝑤) = (LSubSp‘𝑊))
8		lspval.s	. . . . . . . 8 ⊢ 𝑆 = (LSubSp‘𝑊)
9	7, 8	eqtr4di 2813	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (LSubSp‘𝑤) = 𝑆)
10	9	rabeqdv 3427	. . . . . 6 ⊢ (𝑤 = 𝑊 → {𝑡 ∈ (LSubSp‘𝑤) ∣ 𝑠 ⊆ 𝑡} = {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})
11	10	inteqd 4911	. . . . 5 ⊢ (𝑤 = 𝑊 → ∩ {𝑡 ∈ (LSubSp‘𝑤) ∣ 𝑠 ⊆ 𝑡} = ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})
12	6, 11	mpteq12dv 5191	. . . 4 ⊢ (𝑤 = 𝑊 → (𝑠 ∈ 𝒫 (Base‘𝑤) ↦ ∩ {𝑡 ∈ (LSubSp‘𝑤) ∣ 𝑠 ⊆ 𝑡}) = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}))
13		df-lsp 21256	. . . 4 ⊢ LSpan = (𝑤 ∈ V ↦ (𝑠 ∈ 𝒫 (Base‘𝑤) ↦ ∩ {𝑡 ∈ (LSubSp‘𝑤) ∣ 𝑠 ⊆ 𝑡}))
14	4	fvexi 6904	. . . . . 6 ⊢ 𝑉 ∈ V
15	14	pwex 5342	. . . . 5 ⊢ 𝒫 𝑉 ∈ V
16	15	mptex 7233	. . . 4 ⊢ (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}) ∈ V
17	12, 13, 16	fvmpt 6998	. . 3 ⊢ (𝑊 ∈ V → (LSpan‘𝑊) = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}))
18	2, 17	syl 18	. 2 ⊢ (𝑊 ∈ 𝑋 → (LSpan‘𝑊) = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}))
19	1, 18	eqtrid 2807	1 ⊢ (𝑊 ∈ 𝑋 → 𝑁 = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}))

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  {crab 3412  Vcvv 3450   ⊆ wss 3896  𝒫 cpw 4556  ∩ cint 4906   ↦ cmpt 5185  ‘cfv 6543  Basecbs 17396  LSubSpclss 21215  LSpanclspn 21255

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-lsp 21256

This theorem is used by:  lspf  21258  lspval  21259  00lsp  21265  mrclsp  21273  lsppropd  21302