| 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 22939 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) = ∪ (𝐽 ∩ 𝒫 𝑆)) |
| 3 | inss2 4191 | . . . . . . . 8 ⊢ (𝐽 ∩ 𝒫 𝑆) ⊆ 𝒫 𝑆 | |
| 4 | 3 | unissi 4870 | . . . . . . 7 ⊢ ∪ (𝐽 ∩ 𝒫 𝑆) ⊆ ∪ 𝒫 𝑆 |
| 5 | unipw 5397 | . . . . . . 7 ⊢ ∪ 𝒫 𝑆 = 𝑆 | |
| 6 | 4, 5 | sseqtri 3986 | . . . . . 6 ⊢ ∪ (𝐽 ∩ 𝒫 𝑆) ⊆ 𝑆 |
| 7 | 6 | a1i 11 | . . . . 5 ⊢ (𝑆 ∈ 𝐽 → ∪ (𝐽 ∩ 𝒫 𝑆) ⊆ 𝑆) |
| 8 | id 22 | . . . . . . 7 ⊢ (𝑆 ∈ 𝐽 → 𝑆 ∈ 𝐽) | |
| 9 | pwidg 4573 | . . . . . . 7 ⊢ (𝑆 ∈ 𝐽 → 𝑆 ∈ 𝒫 𝑆) | |
| 10 | 8, 9 | elind 4153 | . . . . . 6 ⊢ (𝑆 ∈ 𝐽 → 𝑆 ∈ (𝐽 ∩ 𝒫 𝑆)) |
| 11 | elssuni 4891 | . . . . . 6 ⊢ (𝑆 ∈ (𝐽 ∩ 𝒫 𝑆) → 𝑆 ⊆ ∪ (𝐽 ∩ 𝒫 𝑆)) | |
| 12 | 10, 11 | syl 17 | . . . . 5 ⊢ (𝑆 ∈ 𝐽 → 𝑆 ⊆ ∪ (𝐽 ∩ 𝒫 𝑆)) |
| 13 | 7, 12 | eqssd 3955 | . . . 4 ⊢ (𝑆 ∈ 𝐽 → ∪ (𝐽 ∩ 𝒫 𝑆) = 𝑆) |
| 14 | 2, 13 | sylan9eq 2784 | . . 3 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑆 ∈ 𝐽) → ((int‘𝐽)‘𝑆) = 𝑆) |
| 15 | 14 | ex 412 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑆 ∈ 𝐽 → ((int‘𝐽)‘𝑆) = 𝑆)) |
| 16 | 1 | ntropn 22952 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) ∈ 𝐽) |
| 17 | eleq1 2816 | . . 3 ⊢ (((int‘𝐽)‘𝑆) = 𝑆 → (((int‘𝐽)‘𝑆) ∈ 𝐽 ↔ 𝑆 ∈ 𝐽)) | |
| 18 | 16, 17 | syl5ibcom 245 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (((int‘𝐽)‘𝑆) = 𝑆 → 𝑆 ∈ 𝐽)) |
| 19 | 15, 18 | impbid 212 | 1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑆 ∈ 𝐽 ↔ ((int‘𝐽)‘𝑆) = 𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∩ cin 3904 ⊆ wss 3905 𝒫 cpw 4553 ∪ cuni 4861 ‘cfv 6486 Topctop 22796 intcnt 22920 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7675 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-iun 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5518 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-top 22797 df-ntr 22923 |
| This theorem is referenced by: ntridm 22971 ntrtop 22973 ntr0 22984 isopn3i 22985 opnnei 23023 cnntr 23178 llycmpkgen2 23453 dvnres 25849 dvcnvre 25940 taylthlem2 26298 taylthlem2OLD 26299 ulmdvlem3 26327 abelth 26367 opnbnd 36298 ioontr 45493 cncfuni 45868 fperdvper 45901 dirkercncflem3 46087 dirkercncflem4 46088 fourierdlem58 46146 fourierdlem73 46161 |
| Copyright terms: Public domain | W3C validator |