| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ntrval | Structured version Visualization version GIF version | ||
| Description: The interior of a subset of a topology's base set is the union of all the open sets it includes. Definition of interior of [Munkres] p. 94. (Contributed by NM, 10-Sep-2006.) (Revised by Mario Carneiro, 11-Nov-2013.) |
| Ref | Expression |
|---|---|
| iscld.1 | ⊢ 𝑋 = ∪ 𝐽 |
| Ref | Expression |
|---|---|
| ntrval | ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) = ∪ (𝐽 ∩ 𝒫 𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | iscld.1 | . . . . 5 ⊢ 𝑋 = ∪ 𝐽 | |
| 2 | 1 | ntrfval 23322 | . . . 4 ⊢ (𝐽 ∈ Top → (int‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑥))) |
| 3 | 2 | fveq1d 6879 | . . 3 ⊢ (𝐽 ∈ Top → ((int‘𝐽)‘𝑆) = ((𝑥 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑥))‘𝑆)) |
| 4 | 3 | adantr 486 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) = ((𝑥 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑥))‘𝑆)) |
| 5 | eqid 2761 | . . 3 ⊢ (𝑥 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑥)) = (𝑥 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑥)) | |
| 6 | pweq 4571 | . . . . 5 ⊢ (𝑥 = 𝑆 → 𝒫 𝑥 = 𝒫 𝑆) | |
| 7 | 6 | ineq2d 4166 | . . . 4 ⊢ (𝑥 = 𝑆 → (𝐽 ∩ 𝒫 𝑥) = (𝐽 ∩ 𝒫 𝑆)) |
| 8 | 7 | unieqd 4880 | . . 3 ⊢ (𝑥 = 𝑆 → ∪ (𝐽 ∩ 𝒫 𝑥) = ∪ (𝐽 ∩ 𝒫 𝑆)) |
| 9 | 1 | topopn 23204 | . . . . 5 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽) |
| 10 | elpw2g 5295 | . . . . 5 ⊢ (𝑋 ∈ 𝐽 → (𝑆 ∈ 𝒫 𝑋 ↔ 𝑆 ⊆ 𝑋)) | |
| 11 | 9, 10 | syl 18 | . . . 4 ⊢ (𝐽 ∈ Top → (𝑆 ∈ 𝒫 𝑋 ↔ 𝑆 ⊆ 𝑋)) |
| 12 | 11 | biimpar 483 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → 𝑆 ∈ 𝒫 𝑋) |
| 13 | inex1g 5279 | . . . . 5 ⊢ (𝐽 ∈ Top → (𝐽 ∩ 𝒫 𝑆) ∈ V) | |
| 14 | 13 | adantr 486 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝐽 ∩ 𝒫 𝑆) ∈ V) |
| 15 | 14 | uniexd 7748 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ∪ (𝐽 ∩ 𝒫 𝑆) ∈ V) |
| 16 | 5, 8, 12, 15 | fvmptd3 7009 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((𝑥 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑥))‘𝑆) = ∪ (𝐽 ∩ 𝒫 𝑆)) |
| 17 | 4, 16 | eqtrd 2796 | 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 Vcvv 3451 ∩ cin 3898 ⊆ wss 3899 𝒫 cpw 4557 ∪ cuni 4867 ↦ cmpt 5186 ‘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: ntropn 23347 clsval2 23348 ntrss2 23355 ssntr 23356 isopn3 23364 ntreq0 23375 toplatglb 50053 |
| Copyright terms: Public domain | W3C validator |