Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > iscld | GIF version |
Description: The predicate "the class 𝑆 is a closed set". (Contributed by NM, 2-Oct-2006.) (Revised by Mario Carneiro, 11-Nov-2013.) |
Ref | Expression |
---|---|
iscld.1 | ⊢ 𝑋 = ∪ 𝐽 |
Ref | Expression |
---|---|
iscld | ⊢ (𝐽 ∈ Top → (𝑆 ∈ (Clsd‘𝐽) ↔ (𝑆 ⊆ 𝑋 ∧ (𝑋 ∖ 𝑆) ∈ 𝐽))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iscld.1 | . . . . 5 ⊢ 𝑋 = ∪ 𝐽 | |
2 | 1 | cldval 12268 | . . . 4 ⊢ (𝐽 ∈ Top → (Clsd‘𝐽) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽}) |
3 | 2 | eleq2d 2209 | . . 3 ⊢ (𝐽 ∈ Top → (𝑆 ∈ (Clsd‘𝐽) ↔ 𝑆 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽})) |
4 | difeq2 3188 | . . . . 5 ⊢ (𝑥 = 𝑆 → (𝑋 ∖ 𝑥) = (𝑋 ∖ 𝑆)) | |
5 | 4 | eleq1d 2208 | . . . 4 ⊢ (𝑥 = 𝑆 → ((𝑋 ∖ 𝑥) ∈ 𝐽 ↔ (𝑋 ∖ 𝑆) ∈ 𝐽)) |
6 | 5 | elrab 2840 | . . 3 ⊢ (𝑆 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽} ↔ (𝑆 ∈ 𝒫 𝑋 ∧ (𝑋 ∖ 𝑆) ∈ 𝐽)) |
7 | 3, 6 | syl6bb 195 | . 2 ⊢ (𝐽 ∈ Top → (𝑆 ∈ (Clsd‘𝐽) ↔ (𝑆 ∈ 𝒫 𝑋 ∧ (𝑋 ∖ 𝑆) ∈ 𝐽))) |
8 | 1 | topopn 12175 | . . . 4 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽) |
9 | elpw2g 4081 | . . . 4 ⊢ (𝑋 ∈ 𝐽 → (𝑆 ∈ 𝒫 𝑋 ↔ 𝑆 ⊆ 𝑋)) | |
10 | 8, 9 | syl 14 | . . 3 ⊢ (𝐽 ∈ Top → (𝑆 ∈ 𝒫 𝑋 ↔ 𝑆 ⊆ 𝑋)) |
11 | 10 | anbi1d 460 | . 2 ⊢ (𝐽 ∈ Top → ((𝑆 ∈ 𝒫 𝑋 ∧ (𝑋 ∖ 𝑆) ∈ 𝐽) ↔ (𝑆 ⊆ 𝑋 ∧ (𝑋 ∖ 𝑆) ∈ 𝐽))) |
12 | 7, 11 | bitrd 187 | 1 ⊢ (𝐽 ∈ Top → (𝑆 ∈ (Clsd‘𝐽) ↔ (𝑆 ⊆ 𝑋 ∧ (𝑋 ∖ 𝑆) ∈ 𝐽))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1331 ∈ wcel 1480 {crab 2420 ∖ cdif 3068 ⊆ wss 3071 𝒫 cpw 3510 ∪ cuni 3736 ‘cfv 5123 Topctop 12164 Clsdccld 12261 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ral 2421 df-rex 2422 df-rab 2425 df-v 2688 df-sbc 2910 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-br 3930 df-opab 3990 df-mpt 3991 df-id 4215 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-iota 5088 df-fun 5125 df-fv 5131 df-top 12165 df-cld 12264 |
This theorem is referenced by: iscld2 12273 cldss 12274 cldopn 12276 topcld 12278 discld 12305 |
Copyright terms: Public domain | W3C validator |