Theorem lspfval 21157

Description: The span function for a left vector space (or a left module). (df-span 31790 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 6878	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
4		lspval.v	. . . . . . 7 ⊢ 𝑉 = (Base‘𝑊)
5	3, 4	eqtr4di 2813	. . . . . 6 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = 𝑉)
6	5	pweqd 4574	. . . . 5 ⊢ (𝑤 = 𝑊 → 𝒫 (Base‘𝑤) = 𝒫 𝑉)
7		fveq2 6878	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (LSubSp‘𝑤) = (LSubSp‘𝑊))
8		lspval.s	. . . . . . . 8 ⊢ 𝑆 = (LSubSp‘𝑊)
9	7, 8	eqtr4di 2813	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (LSubSp‘𝑤) = 𝑆)
10	9	rabeqdv 3427	. . . . . 6 ⊢ (𝑤 = 𝑊 → {𝑡 ∈ (LSubSp‘𝑤) ∣ 𝑠 ⊆ 𝑡} = {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})
11	10	inteqd 4912	. . . . 5 ⊢ (𝑤 = 𝑊 → ∩ {𝑡 ∈ (LSubSp‘𝑤) ∣ 𝑠 ⊆ 𝑡} = ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡})
12	6, 11	mpteq12dv 5192	. . . 4 ⊢ (𝑤 = 𝑊 → (𝑠 ∈ 𝒫 (Base‘𝑤) ↦ ∩ {𝑡 ∈ (LSubSp‘𝑤) ∣ 𝑠 ⊆ 𝑡}) = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}))
13		df-lsp 21156	. . . 4 ⊢ LSpan = (𝑤 ∈ V ↦ (𝑠 ∈ 𝒫 (Base‘𝑤) ↦ ∩ {𝑡 ∈ (LSubSp‘𝑤) ∣ 𝑠 ⊆ 𝑡}))
14	4	fvexi 6892	. . . . . 6 ⊢ 𝑉 ∈ V
15	14	pwex 5345	. . . . 5 ⊢ 𝒫 𝑉 ∈ V
16	15	mptex 7222	. . . 4 ⊢ (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ 𝑆 ∣ 𝑠 ⊆ 𝑡}) ∈ V
17	12, 13, 16	fvmpt 6986	. . 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 1570   ∈ wcel 2145  {crab 3412  Vcvv 3450   ⊆ wss 3899  𝒫 cpw 4557  ∩ cint 4907   ↦ cmpt 5186  ‘cfv 6533  Basecbs 17301  LSubSpclss 21115  LSpanclspn 21155

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  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 2100  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 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-lsp 21156

This theorem is used by:  lspf  21158  lspval  21159  00lsp  21165  mrclsp  21173  lsppropd  21202