| 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 23064 | . . . 4 ⊢ (𝐽 ∈ Top → (int‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑥))) |
| 3 | 2 | fveq1d 6865 | . . 3 ⊢ (𝐽 ∈ Top → ((int‘𝐽)‘𝑆) = ((𝑥 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑥))‘𝑆)) |
| 4 | 3 | adantr 484 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) = ((𝑥 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑥))‘𝑆)) |
| 5 | eqid 2761 | . . 3 ⊢ (𝑥 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑥)) = (𝑥 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑥)) | |
| 6 | pweq 4568 | . . . . 5 ⊢ (𝑥 = 𝑆 → 𝒫 𝑥 = 𝒫 𝑆) | |
| 7 | 6 | ineq2d 4172 | . . . 4 ⊢ (𝑥 = 𝑆 → (𝐽 ∩ 𝒫 𝑥) = (𝐽 ∩ 𝒫 𝑆)) |
| 8 | 7 | unieqd 4877 | . . 3 ⊢ (𝑥 = 𝑆 → ∪ (𝐽 ∩ 𝒫 𝑥) = ∪ (𝐽 ∩ 𝒫 𝑆)) |
| 9 | 1 | topopn 22946 | . . . . 5 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽) |
| 10 | elpw2g 5288 | . . . . 5 ⊢ (𝑋 ∈ 𝐽 → (𝑆 ∈ 𝒫 𝑋 ↔ 𝑆 ⊆ 𝑋)) | |
| 11 | 9, 10 | syl 17 | . . . 4 ⊢ (𝐽 ∈ Top → (𝑆 ∈ 𝒫 𝑋 ↔ 𝑆 ⊆ 𝑋)) |
| 12 | 11 | biimpar 481 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → 𝑆 ∈ 𝒫 𝑋) |
| 13 | inex1g 5274 | . . . . 5 ⊢ (𝐽 ∈ Top → (𝐽 ∩ 𝒫 𝑆) ∈ V) | |
| 14 | 13 | adantr 484 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝐽 ∩ 𝒫 𝑆) ∈ V) |
| 15 | 14 | uniexd 7721 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ∪ (𝐽 ∩ 𝒫 𝑆) ∈ V) |
| 16 | 5, 8, 12, 15 | fvmptd3 6995 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((𝑥 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑥))‘𝑆) = ∪ (𝐽 ∩ 𝒫 𝑆)) |
| 17 | 4, 16 | eqtrd 2796 | 1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) = ∪ (𝐽 ∩ 𝒫 𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1559 ∈ wcel 2141 Vcvv 3453 ∩ cin 3903 ⊆ wss 3904 𝒫 cpw 4554 ∪ cuni 4864 ↦ cmpt 5180 ‘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: ntropn 23089 clsval2 23090 ntrss2 23097 ssntr 23098 isopn3 23106 ntreq0 23117 toplatglb 49586 |
| Copyright terms: Public domain | W3C validator |