| 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 23007 | . . . 4 ⊢ (𝐽 ∈ Top → (int‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑥))) |
| 3 | 2 | fveq1d 6829 | . . 3 ⊢ (𝐽 ∈ Top → ((int‘𝐽)‘𝑆) = ((𝑥 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑥))‘𝑆)) |
| 4 | 3 | adantr 481 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) = ((𝑥 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑥))‘𝑆)) |
| 5 | eqid 2739 | . . 3 ⊢ (𝑥 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑥)) = (𝑥 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑥)) | |
| 6 | pweq 4543 | . . . . 5 ⊢ (𝑥 = 𝑆 → 𝒫 𝑥 = 𝒫 𝑆) | |
| 7 | 6 | ineq2d 4149 | . . . 4 ⊢ (𝑥 = 𝑆 → (𝐽 ∩ 𝒫 𝑥) = (𝐽 ∩ 𝒫 𝑆)) |
| 8 | 7 | unieqd 4851 | . . 3 ⊢ (𝑥 = 𝑆 → ∪ (𝐽 ∩ 𝒫 𝑥) = ∪ (𝐽 ∩ 𝒫 𝑆)) |
| 9 | 1 | topopn 22889 | . . . . 5 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽) |
| 10 | elpw2g 5261 | . . . . 5 ⊢ (𝑋 ∈ 𝐽 → (𝑆 ∈ 𝒫 𝑋 ↔ 𝑆 ⊆ 𝑋)) | |
| 11 | 9, 10 | syl 17 | . . . 4 ⊢ (𝐽 ∈ Top → (𝑆 ∈ 𝒫 𝑋 ↔ 𝑆 ⊆ 𝑋)) |
| 12 | 11 | biimpar 478 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → 𝑆 ∈ 𝒫 𝑋) |
| 13 | inex1g 5247 | . . . . 5 ⊢ (𝐽 ∈ Top → (𝐽 ∩ 𝒫 𝑆) ∈ V) | |
| 14 | 13 | adantr 481 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝐽 ∩ 𝒫 𝑆) ∈ V) |
| 15 | 14 | uniexd 7685 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ∪ (𝐽 ∩ 𝒫 𝑆) ∈ V) |
| 16 | 5, 8, 12, 15 | fvmptd3 6959 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((𝑥 ∈ 𝒫 𝑋 ↦ ∪ (𝐽 ∩ 𝒫 𝑥))‘𝑆) = ∪ (𝐽 ∩ 𝒫 𝑆)) |
| 17 | 4, 16 | eqtrd 2774 | 1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) = ∪ (𝐽 ∩ 𝒫 𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 Vcvv 3431 ∩ cin 3882 ⊆ wss 3883 𝒫 cpw 4529 ∪ cuni 4838 ↦ cmpt 5153 ‘cfv 6485 Topctop 22876 intcnt 23000 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-id 5513 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-top 22877 df-ntr 23003 |
| This theorem is referenced by: ntropn 23032 clsval2 23033 ntrss2 23040 ssntr 23041 isopn3 23049 ntreq0 23060 toplatglb 49491 |
| Copyright terms: Public domain | W3C validator |