Theorem clsf 23367

Description: The closure function is a function from subsets of the base to closed sets. (Contributed by Mario Carneiro, 11-Apr-2015.)

Hypothesis

Ref	Expression
clscld.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
clsf	⊢ (𝐽 ∈ Top → (cls‘𝐽):𝒫 𝑋⟶(Clsd‘𝐽))

Proof of Theorem clsf

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elpwi 4563	. . 3 ⊢ (𝑥 ∈ 𝒫 𝑋 → 𝑥 ⊆ 𝑋)
2		clscld.1	. . . . 5 ⊢ 𝑋 = ∪ 𝐽
3	2	clsval 23356	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ⊆ 𝑋) → ((cls‘𝐽)‘𝑥) = ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦})
4		fvex 6898	. . . 4 ⊢ ((cls‘𝐽)‘𝑥) ∈ V
5	3, 4	eqeltrrdi 2869	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ⊆ 𝑋) → ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦} ∈ V)
6	1, 5	sylan2 605	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ 𝒫 𝑋) → ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦} ∈ V)
7	2	clsfval 23344	. 2 ⊢ (𝐽 ∈ Top → (cls‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}))
8		elpwi 4563	. . 3 ⊢ (𝑦 ∈ 𝒫 𝑋 → 𝑦 ⊆ 𝑋)
9	2	clscld 23366	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑦 ⊆ 𝑋) → ((cls‘𝐽)‘𝑦) ∈ (Clsd‘𝐽))
10	8, 9	sylan2 605	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑦 ∈ 𝒫 𝑋) → ((cls‘𝐽)‘𝑦) ∈ (Clsd‘𝐽))
11	6, 7, 10	fmpt2d 7125	1 ⊢ (𝐽 ∈ Top → (cls‘𝐽):𝒫 𝑋⟶(Clsd‘𝐽))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {crab 3412  Vcvv 3450   ⊆ wss 3895  𝒫 cpw 4556  ∪ cuni 4866  ∩ cint 4906  ⟶wf 6534  ‘cfv 6538  Topctop 23212  Clsdccld 23335  clsccl 23337

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 5326  ax-pr 5390  ax-un 7751

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 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-iin 4953  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  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 23213  df-cld 23338  df-cls 23340

This theorem is used by:  clsf2  45202