| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isopn3 | Structured version Visualization version GIF version | ||
| Description: A subset is open iff it equals its own interior. (Contributed by NM, 9-Oct-2006.) (Revised by Mario Carneiro, 11-Nov-2013.) |
| Ref | Expression |
|---|---|
| clscld.1 | ⊢ 𝑋 = ∪ 𝐽 |
| Ref | Expression |
|---|---|
| isopn3 | ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑆 ∈ 𝐽 ↔ ((int‘𝐽)‘𝑆) = 𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | clscld.1 | . . . . 5 ⊢ 𝑋 = ∪ 𝐽 | |
| 2 | 1 | ntrval 23076 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) = ∪ (𝐽 ∩ 𝒫 𝑆)) |
| 3 | inss2 4189 | . . . . . . . 8 ⊢ (𝐽 ∩ 𝒫 𝑆) ⊆ 𝒫 𝑆 | |
| 4 | 3 | unissi 4873 | . . . . . . 7 ⊢ ∪ (𝐽 ∩ 𝒫 𝑆) ⊆ ∪ 𝒫 𝑆 |
| 5 | unipw 5416 | . . . . . . 7 ⊢ ∪ 𝒫 𝑆 = 𝑆 | |
| 6 | 4, 5 | sseqtri 3984 | . . . . . 6 ⊢ ∪ (𝐽 ∩ 𝒫 𝑆) ⊆ 𝑆 |
| 7 | 6 | a1i 11 | . . . . 5 ⊢ (𝑆 ∈ 𝐽 → ∪ (𝐽 ∩ 𝒫 𝑆) ⊆ 𝑆) |
| 8 | id 22 | . . . . . . 7 ⊢ (𝑆 ∈ 𝐽 → 𝑆 ∈ 𝐽) | |
| 9 | pwidg 4574 | . . . . . . 7 ⊢ (𝑆 ∈ 𝐽 → 𝑆 ∈ 𝒫 𝑆) | |
| 10 | 8, 9 | elind 4152 | . . . . . 6 ⊢ (𝑆 ∈ 𝐽 → 𝑆 ∈ (𝐽 ∩ 𝒫 𝑆)) |
| 11 | elssuni 4896 | . . . . . 6 ⊢ (𝑆 ∈ (𝐽 ∩ 𝒫 𝑆) → 𝑆 ⊆ ∪ (𝐽 ∩ 𝒫 𝑆)) | |
| 12 | 10, 11 | syl 17 | . . . . 5 ⊢ (𝑆 ∈ 𝐽 → 𝑆 ⊆ ∪ (𝐽 ∩ 𝒫 𝑆)) |
| 13 | 7, 12 | eqssd 3953 | . . . 4 ⊢ (𝑆 ∈ 𝐽 → ∪ (𝐽 ∩ 𝒫 𝑆) = 𝑆) |
| 14 | 2, 13 | sylan9eq 2816 | . . 3 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑆 ∈ 𝐽) → ((int‘𝐽)‘𝑆) = 𝑆) |
| 15 | 14 | ex 416 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑆 ∈ 𝐽 → ((int‘𝐽)‘𝑆) = 𝑆)) |
| 16 | 1 | ntropn 23089 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) ∈ 𝐽) |
| 17 | eleq1 2849 | . . 3 ⊢ (((int‘𝐽)‘𝑆) = 𝑆 → (((int‘𝐽)‘𝑆) ∈ 𝐽 ↔ 𝑆 ∈ 𝐽)) | |
| 18 | 16, 17 | syl5ibcom 247 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (((int‘𝐽)‘𝑆) = 𝑆 → 𝑆 ∈ 𝐽)) |
| 19 | 15, 18 | impbid 214 | 1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑆 ∈ 𝐽 ↔ ((int‘𝐽)‘𝑆) = 𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ∩ cin 3903 ⊆ wss 3904 𝒫 cpw 4554 ∪ cuni 4864 ‘cfv 6517 Topctop 22933 intcnt 23057 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5540 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-top 22934 df-ntr 23060 |
| This theorem is referenced by: ntridm 23108 ntrtop 23110 ntr0 23121 isopn3i 23122 opnnei 23160 cnntr 23315 llycmpkgen2 23590 dvnres 25973 dvcnvre 26061 taylthlem2 26414 ulmdvlem3 26442 abelth 26481 opnbnd 36649 ioontr 46051 cncfuni 46424 fperdvper 46457 dirkercncflem3 46643 dirkercncflem4 46644 fourierdlem58 46702 fourierdlem73 46717 |
| Copyright terms: Public domain | W3C validator |