| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > clsfval | GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| cldval.1 | ⊢ 𝑋 = ∪ 𝐽 |
| Ref | Expression |
|---|---|
| clsfval | ⊢ (𝐽 ∈ Top → (cls‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cldval.1 | . . . 4 ⊢ 𝑋 = ∪ 𝐽 | |
| 2 | 1 | topopn 14860 | . . 3 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽) |
| 3 | pwexg 4292 | . . 3 ⊢ (𝑋 ∈ 𝐽 → 𝒫 𝑋 ∈ V) | |
| 4 | mptexg 5910 | . . 3 ⊢ (𝒫 𝑋 ∈ V → (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}) ∈ V) | |
| 5 | 2, 3, 4 | 3syl 17 | . 2 ⊢ (𝐽 ∈ Top → (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}) ∈ V) |
| 6 | unieq 3922 | . . . . . 6 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = ∪ 𝐽) | |
| 7 | 6, 1 | eqtr4di 2283 | . . . . 5 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = 𝑋) |
| 8 | 7 | pweqd 3673 | . . . 4 ⊢ (𝑗 = 𝐽 → 𝒫 ∪ 𝑗 = 𝒫 𝑋) |
| 9 | fveq2 5669 | . . . . . 6 ⊢ (𝑗 = 𝐽 → (Clsd‘𝑗) = (Clsd‘𝐽)) | |
| 10 | rabeq 2804 | . . . . . 6 ⊢ ((Clsd‘𝑗) = (Clsd‘𝐽) → {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥 ⊆ 𝑦} = {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}) | |
| 11 | 9, 10 | syl 14 | . . . . 5 ⊢ (𝑗 = 𝐽 → {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥 ⊆ 𝑦} = {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}) |
| 12 | 11 | inteqd 3953 | . . . 4 ⊢ (𝑗 = 𝐽 → ∩ {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥 ⊆ 𝑦} = ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}) |
| 13 | 8, 12 | mpteq12dv 4191 | . . 3 ⊢ (𝑗 = 𝐽 → (𝑥 ∈ 𝒫 ∪ 𝑗 ↦ ∩ {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥 ⊆ 𝑦}) = (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦})) |
| 14 | df-cls 14949 | . . 3 ⊢ cls = (𝑗 ∈ Top ↦ (𝑥 ∈ 𝒫 ∪ 𝑗 ↦ ∩ {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥 ⊆ 𝑦})) | |
| 15 | 13, 14 | fvmptg 5752 | . 2 ⊢ ((𝐽 ∈ Top ∧ (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}) ∈ V) → (cls‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦})) |
| 16 | 5, 15 | mpdan 421 | 1 ⊢ (𝐽 ∈ Top → (cls‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦})) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2203 {crab 2524 Vcvv 2812 ⊆ wss 3210 𝒫 cpw 3668 ∪ cuni 3913 ∩ cint 3948 ↦ cmpt 4170 ‘cfv 5351 Topctop 14849 Clsdccld 14944 clsccl 14946 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2206 ax-ext 2214 ax-coll 4224 ax-sep 4227 ax-pow 4286 ax-pr 4321 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-un 3214 df-in 3216 df-ss 3223 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-id 4413 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-top 14850 df-cls 14949 |
| This theorem is referenced by: clsval 14963 |
| Copyright terms: Public domain | W3C validator |