| 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 23334 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) = ∪ (𝐽 ∩ 𝒫 𝑆)) |
| 3 | inss2 4183 | . . . . . . . 8 ⊢ (𝐽 ∩ 𝒫 𝑆) ⊆ 𝒫 𝑆 | |
| 4 | 3 | unissi 4876 | . . . . . . 7 ⊢ ∪ (𝐽 ∩ 𝒫 𝑆) ⊆ ∪ 𝒫 𝑆 |
| 5 | unipw 5418 | . . . . . . 7 ⊢ ∪ 𝒫 𝑆 = 𝑆 | |
| 6 | 4, 5 | sseqtri 3979 | . . . . . 6 ⊢ ∪ (𝐽 ∩ 𝒫 𝑆) ⊆ 𝑆 |
| 7 | 6 | a1i 11 | . . . . 5 ⊢ (𝑆 ∈ 𝐽 → ∪ (𝐽 ∩ 𝒫 𝑆) ⊆ 𝑆) |
| 8 | id 23 | . . . . . . 7 ⊢ (𝑆 ∈ 𝐽 → 𝑆 ∈ 𝐽) | |
| 9 | pwidg 4577 | . . . . . . 7 ⊢ (𝑆 ∈ 𝐽 → 𝑆 ∈ 𝒫 𝑆) | |
| 10 | 8, 9 | elind 4146 | . . . . . 6 ⊢ (𝑆 ∈ 𝐽 → 𝑆 ∈ (𝐽 ∩ 𝒫 𝑆)) |
| 11 | elssuni 4899 | . . . . . 6 ⊢ (𝑆 ∈ (𝐽 ∩ 𝒫 𝑆) → 𝑆 ⊆ ∪ (𝐽 ∩ 𝒫 𝑆)) | |
| 12 | 10, 11 | syl 18 | . . . . 5 ⊢ (𝑆 ∈ 𝐽 → 𝑆 ⊆ ∪ (𝐽 ∩ 𝒫 𝑆)) |
| 13 | 7, 12 | eqssd 3948 | . . . 4 ⊢ (𝑆 ∈ 𝐽 → ∪ (𝐽 ∩ 𝒫 𝑆) = 𝑆) |
| 14 | 2, 13 | sylan9eq 2816 | . . 3 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑆 ∈ 𝐽) → ((int‘𝐽)‘𝑆) = 𝑆) |
| 15 | 14 | ex 418 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑆 ∈ 𝐽 → ((int‘𝐽)‘𝑆) = 𝑆)) |
| 16 | 1 | ntropn 23347 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) ∈ 𝐽) |
| 17 | eleq1 2849 | . . 3 ⊢ (((int‘𝐽)‘𝑆) = 𝑆 → (((int‘𝐽)‘𝑆) ∈ 𝐽 ↔ 𝑆 ∈ 𝐽)) | |
| 18 | 16, 17 | syl5ibcom 248 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (((int‘𝐽)‘𝑆) = 𝑆 → 𝑆 ∈ 𝐽)) |
| 19 | 15, 18 | impbid 215 | 1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑆 ∈ 𝐽 ↔ ((int‘𝐽)‘𝑆) = 𝑆)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∩ cin 3898 ⊆ wss 3899 𝒫 cpw 4557 ∪ cuni 4867 ‘cfv 6531 Topctop 23191 intcnt 23315 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-top 23192 df-ntr 23318 |
| This theorem is used by: ntridm 23366 ntrtop 23368 ntr0 23379 isopn3i 23380 opnnei 23418 cnntr 23573 llycmpkgen2 23849 dvnres 26231 dvcnvre 26319 taylthlem2 26683 ulmdvlem3 26711 abelth 26750 opnbnd 37083 ioontr 46467 cncfuni 46840 fperdvper 46873 dirkercncflem3 47059 dirkercncflem4 47060 fourierdlem58 47118 fourierdlem73 47133 |
| Copyright terms: Public domain | W3C validator |