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 12893 | . . . 4 ⊢ (𝐽 ∈ Top → (Clsd‘𝐽) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽}) |
3 | 2 | eleq2d 2240 | . . 3 ⊢ (𝐽 ∈ Top → (𝑆 ∈ (Clsd‘𝐽) ↔ 𝑆 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽})) |
4 | difeq2 3239 | . . . . 5 ⊢ (𝑥 = 𝑆 → (𝑋 ∖ 𝑥) = (𝑋 ∖ 𝑆)) | |
5 | 4 | eleq1d 2239 | . . . 4 ⊢ (𝑥 = 𝑆 → ((𝑋 ∖ 𝑥) ∈ 𝐽 ↔ (𝑋 ∖ 𝑆) ∈ 𝐽)) |
6 | 5 | elrab 2886 | . . 3 ⊢ (𝑆 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽} ↔ (𝑆 ∈ 𝒫 𝑋 ∧ (𝑋 ∖ 𝑆) ∈ 𝐽)) |
7 | 3, 6 | bitrdi 195 | . 2 ⊢ (𝐽 ∈ Top → (𝑆 ∈ (Clsd‘𝐽) ↔ (𝑆 ∈ 𝒫 𝑋 ∧ (𝑋 ∖ 𝑆) ∈ 𝐽))) |
8 | 1 | topopn 12800 | . . . 4 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽) |
9 | elpw2g 4142 | . . . 4 ⊢ (𝑋 ∈ 𝐽 → (𝑆 ∈ 𝒫 𝑋 ↔ 𝑆 ⊆ 𝑋)) | |
10 | 8, 9 | syl 14 | . . 3 ⊢ (𝐽 ∈ Top → (𝑆 ∈ 𝒫 𝑋 ↔ 𝑆 ⊆ 𝑋)) |
11 | 10 | anbi1d 462 | . 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 1348 ∈ wcel 2141 {crab 2452 ∖ cdif 3118 ⊆ wss 3121 𝒫 cpw 3566 ∪ cuni 3796 ‘cfv 5198 Topctop 12789 Clsdccld 12886 |
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 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-14 2144 ax-ext 2152 ax-sep 4107 ax-pow 4160 ax-pr 4194 |
This theorem depends on definitions: df-bi 116 df-3an 975 df-tru 1351 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ral 2453 df-rex 2454 df-rab 2457 df-v 2732 df-sbc 2956 df-dif 3123 df-un 3125 df-in 3127 df-ss 3134 df-pw 3568 df-sn 3589 df-pr 3590 df-op 3592 df-uni 3797 df-br 3990 df-opab 4051 df-mpt 4052 df-id 4278 df-xp 4617 df-rel 4618 df-cnv 4619 df-co 4620 df-dm 4621 df-iota 5160 df-fun 5200 df-fv 5206 df-top 12790 df-cld 12889 |
This theorem is referenced by: iscld2 12898 cldss 12899 cldopn 12901 topcld 12903 discld 12930 |
Copyright terms: Public domain | W3C validator |