Theorem clsfval 23163

Description: The closure function on the subsets of a topology's base set. (Contributed by NM, 3-Oct-2006.) (Revised by Mario Carneiro, 11-Nov-2013.)

Hypothesis

Ref	Expression
cldval.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
clsfval	⊢ (𝐽 ∈ Top → (cls‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}))

Distinct variable groups:   𝑥,𝑦,𝐽   𝑥,𝑋

Allowed substitution hint:   𝑋(𝑦)

Proof of Theorem clsfval

Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cldval.1	. . . 4 ⊢ 𝑋 = ∪ 𝐽
2	1	topopn 23044	. . 3 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽)
3		pwexg 5351	. . 3 ⊢ (𝑋 ∈ 𝐽 → 𝒫 𝑋 ∈ V)
4		mptexg 7221	. . 3 ⊢ (𝒫 𝑋 ∈ V → (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}) ∈ V)
5	2, 3, 4	3syl 19	. 2 ⊢ (𝐽 ∈ Top → (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}) ∈ V)
6		unieq 4884	. . . . . 6 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = ∪ 𝐽)
7	6, 1	eqtr4di 2816	. . . . 5 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = 𝑋)
8	7	pweqd 4580	. . . 4 ⊢ (𝑗 = 𝐽 → 𝒫 ∪ 𝑗 = 𝒫 𝑋)
9		fveq2 6883	. . . . . 6 ⊢ (𝑗 = 𝐽 → (Clsd‘𝑗) = (Clsd‘𝐽))
10	9	rabeqdv 3431	. . . . 5 ⊢ (𝑗 = 𝐽 → {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥 ⊆ 𝑦} = {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦})
11	10	inteqd 4918	. . . 4 ⊢ (𝑗 = 𝐽 → ∩ {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥 ⊆ 𝑦} = ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦})
12	8, 11	mpteq12dv 5199	. . 3 ⊢ (𝑗 = 𝐽 → (𝑥 ∈ 𝒫 ∪ 𝑗 ↦ ∩ {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥 ⊆ 𝑦}) = (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}))
13		df-cls 23159	. . 3 ⊢ cls = (𝑗 ∈ Top ↦ (𝑥 ∈ 𝒫 ∪ 𝑗 ↦ ∩ {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥 ⊆ 𝑦}))
14	12, 13	fvmptg 6989	. 2 ⊢ ((𝐽 ∈ Top ∧ (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}) ∈ V) → (cls‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}))
15	5, 14	mpdan 699	1 ⊢ (𝐽 ∈ Top → (cls‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}))

Syntax hints:   → wi 4   = wceq 1570   ∈ wcel 2143  {crab 3416  Vcvv 3455   ⊆ wss 3906  𝒫 cpw 4563  ∪ cuni 4873  ∩ cint 4913   ↦ cmpt 5193  ‘cfv 6538  Topctop 23031  Clsdccld 23154  clsccl 23156

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-int 4914  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  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 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-top 23032  df-cls 23159

This theorem is referenced by:  clsval  23175  clsf  23186  mrccls  23217