![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > clscld | Structured version Visualization version GIF version |
Description: The closure of a subset of a topology's underlying set is closed. (Contributed by NM, 4-Oct-2006.) |
Ref | Expression |
---|---|
clscld.1 | ⊢ 𝑋 = ∪ 𝐽 |
Ref | Expression |
---|---|
clscld | ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((cls‘𝐽)‘𝑆) ∈ (Clsd‘𝐽)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | clscld.1 | . . 3 ⊢ 𝑋 = ∪ 𝐽 | |
2 | 1 | clsval 21642 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((cls‘𝐽)‘𝑆) = ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥}) |
3 | 1 | topcld 21640 | . . . . . 6 ⊢ (𝐽 ∈ Top → 𝑋 ∈ (Clsd‘𝐽)) |
4 | 3 | anim1i 617 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑋 ∈ (Clsd‘𝐽) ∧ 𝑆 ⊆ 𝑋)) |
5 | sseq2 3941 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑆 ⊆ 𝑥 ↔ 𝑆 ⊆ 𝑋)) | |
6 | 5 | elrab 3628 | . . . . 5 ⊢ (𝑋 ∈ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥} ↔ (𝑋 ∈ (Clsd‘𝐽) ∧ 𝑆 ⊆ 𝑋)) |
7 | 4, 6 | sylibr 237 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → 𝑋 ∈ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥}) |
8 | 7 | ne0d 4251 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥} ≠ ∅) |
9 | ssrab2 4007 | . . 3 ⊢ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥} ⊆ (Clsd‘𝐽) | |
10 | intcld 21645 | . . 3 ⊢ (({𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥} ≠ ∅ ∧ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥} ⊆ (Clsd‘𝐽)) → ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥} ∈ (Clsd‘𝐽)) | |
11 | 8, 9, 10 | sylancl 589 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥} ∈ (Clsd‘𝐽)) |
12 | 2, 11 | eqeltrd 2890 | 1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((cls‘𝐽)‘𝑆) ∈ (Clsd‘𝐽)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 {crab 3110 ⊆ wss 3881 ∅c0 4243 ∪ cuni 4800 ∩ cint 4838 ‘cfv 6324 Topctop 21498 Clsdccld 21621 clsccl 21623 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-iin 4884 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-top 21499 df-cld 21624 df-cls 21626 |
This theorem is referenced by: clsf 21653 clsss3 21664 iscld3 21669 clsidm 21672 restcls 21786 cncls2i 21875 nrmsep 21962 lpcls 21969 regsep2 21981 hauscmplem 22011 hausllycmp 22099 txcls 22209 ptclsg 22220 regr1lem 22344 kqreglem1 22346 kqreglem2 22347 kqnrmlem1 22348 kqnrmlem2 22349 fclscmpi 22634 tgptsmscld 22756 cnllycmp 23561 clsocv 23854 cmpcmet 23923 cncmet 23926 limcnlp 24481 clsun 33789 cldregopn 33792 heibor1lem 35247 |
Copyright terms: Public domain | W3C validator |