| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cldval | Structured version Visualization version GIF version | ||
| Description: The set of closed sets of a topology. (Note that the set of open sets is just the topology itself, so we don't have a separate definition.) (Contributed by NM, 2-Oct-2006.) (Revised by Mario Carneiro, 11-Nov-2013.) |
| Ref | Expression |
|---|---|
| cldval.1 | ⊢ 𝑋 = ∪ 𝐽 |
| Ref | Expression |
|---|---|
| cldval | ⊢ (𝐽 ∈ Top → (Clsd‘𝐽) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cldval.1 | . . . 4 ⊢ 𝑋 = ∪ 𝐽 | |
| 2 | 1 | topopn 23092 | . . 3 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽) |
| 3 | pwexg 5351 | . . 3 ⊢ (𝑋 ∈ 𝐽 → 𝒫 𝑋 ∈ V) | |
| 4 | rabexg 5310 | . . 3 ⊢ (𝒫 𝑋 ∈ V → {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽} ∈ V) | |
| 5 | 2, 3, 4 | 3syl 19 | . 2 ⊢ (𝐽 ∈ Top → {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽} ∈ V) |
| 6 | unieq 4885 | . . . . . 6 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = ∪ 𝐽) | |
| 7 | 6, 1 | eqtr4di 2818 | . . . . 5 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = 𝑋) |
| 8 | 7 | pweqd 4581 | . . . 4 ⊢ (𝑗 = 𝐽 → 𝒫 ∪ 𝑗 = 𝒫 𝑋) |
| 9 | 7 | difeq1d 4080 | . . . . 5 ⊢ (𝑗 = 𝐽 → (∪ 𝑗 ∖ 𝑥) = (𝑋 ∖ 𝑥)) |
| 10 | eleq12 2855 | . . . . 5 ⊢ (((∪ 𝑗 ∖ 𝑥) = (𝑋 ∖ 𝑥) ∧ 𝑗 = 𝐽) → ((∪ 𝑗 ∖ 𝑥) ∈ 𝑗 ↔ (𝑋 ∖ 𝑥) ∈ 𝐽)) | |
| 11 | 9, 10 | mpancom 701 | . . . 4 ⊢ (𝑗 = 𝐽 → ((∪ 𝑗 ∖ 𝑥) ∈ 𝑗 ↔ (𝑋 ∖ 𝑥) ∈ 𝐽)) |
| 12 | 8, 11 | rabeqbidv 3436 | . . 3 ⊢ (𝑗 = 𝐽 → {𝑥 ∈ 𝒫 ∪ 𝑗 ∣ (∪ 𝑗 ∖ 𝑥) ∈ 𝑗} = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽}) |
| 13 | df-cld 23205 | . . 3 ⊢ Clsd = (𝑗 ∈ Top ↦ {𝑥 ∈ 𝒫 ∪ 𝑗 ∣ (∪ 𝑗 ∖ 𝑥) ∈ 𝑗}) | |
| 14 | 12, 13 | fvmptg 6991 | . 2 ⊢ ((𝐽 ∈ Top ∧ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽} ∈ V) → (Clsd‘𝐽) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽}) |
| 15 | 5, 14 | mpdan 700 | 1 ⊢ (𝐽 ∈ Top → (Clsd‘𝐽) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2146 {crab 3418 Vcvv 3457 ∖ cdif 3903 𝒫 cpw 4564 ∪ cuni 4874 ‘cfv 6540 Topctop 23079 Clsdccld 23202 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-pow 5338 ax-pr 5406 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-iota 6496 df-fun 6542 df-fv 6548 df-top 23080 df-cld 23205 |
| This theorem is used by: iscld 23213 mretopd 23278 |
| Copyright terms: Public domain | W3C validator |