Theorem clsf 23277

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 4567	. . 3 ⊢ (𝑥 ∈ 𝒫 𝑋 → 𝑥 ⊆ 𝑋)
2		clscld.1	. . . . 5 ⊢ 𝑋 = ∪ 𝐽
3	2	clsval 23266	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ⊆ 𝑋) → ((cls‘𝐽)‘𝑥) = ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦})
4		fvex 6895	. . . 4 ⊢ ((cls‘𝐽)‘𝑥) ∈ V
5	3, 4	eqeltrrdi 2871	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ⊆ 𝑋) → ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦} ∈ V)
6	1, 5	sylan2 605	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ 𝒫 𝑋) → ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦} ∈ V)
7	2	clsfval 23254	. 2 ⊢ (𝐽 ∈ Top → (cls‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}))
8		elpwi 4567	. . 3 ⊢ (𝑦 ∈ 𝒫 𝑋 → 𝑦 ⊆ 𝑋)
9	2	clscld 23276	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑦 ⊆ 𝑋) → ((cls‘𝐽)‘𝑦) ∈ (Clsd‘𝐽))
10	8, 9	sylan2 605	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑦 ∈ 𝒫 𝑋) → ((cls‘𝐽)‘𝑦) ∈ (Clsd‘𝐽))
11	6, 7, 10	fmpt2d 7121	1 ⊢ (𝐽 ∈ Top → (cls‘𝐽):𝒫 𝑋⟶(Clsd‘𝐽))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {crab 3414  Vcvv 3453   ⊆ wss 3902  𝒫 cpw 4560  ∪ cuni 4870  ∩ cint 4910  ⟶wf 6533  ‘cfv 6537  Topctop 23122  Clsdccld 23245  clsccl 23247

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-top 23123  df-cld 23248  df-cls 23250

This theorem is used by:  clsf2  44968