| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ntrval2 | Structured version Visualization version GIF version | ||
| Description: Interior expressed in terms of closure. (Contributed by NM, 1-Oct-2007.) |
| Ref | Expression |
|---|---|
| clscld.1 | ⊢ 𝑋 = ∪ 𝐽 |
| Ref | Expression |
|---|---|
| ntrval2 | ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑆)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | difss 4083 | . . . . . 6 ⊢ (𝑋 ∖ 𝑆) ⊆ 𝑋 | |
| 2 | clscld.1 | . . . . . . 7 ⊢ 𝑋 = ∪ 𝐽 | |
| 3 | 2 | clsval2 22965 | . . . . . 6 ⊢ ((𝐽 ∈ Top ∧ (𝑋 ∖ 𝑆) ⊆ 𝑋) → ((cls‘𝐽)‘(𝑋 ∖ 𝑆)) = (𝑋 ∖ ((int‘𝐽)‘(𝑋 ∖ (𝑋 ∖ 𝑆))))) |
| 4 | 1, 3 | mpan2 691 | . . . . 5 ⊢ (𝐽 ∈ Top → ((cls‘𝐽)‘(𝑋 ∖ 𝑆)) = (𝑋 ∖ ((int‘𝐽)‘(𝑋 ∖ (𝑋 ∖ 𝑆))))) |
| 5 | 4 | adantr 480 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((cls‘𝐽)‘(𝑋 ∖ 𝑆)) = (𝑋 ∖ ((int‘𝐽)‘(𝑋 ∖ (𝑋 ∖ 𝑆))))) |
| 6 | dfss4 4216 | . . . . . . . 8 ⊢ (𝑆 ⊆ 𝑋 ↔ (𝑋 ∖ (𝑋 ∖ 𝑆)) = 𝑆) | |
| 7 | 6 | biimpi 216 | . . . . . . 7 ⊢ (𝑆 ⊆ 𝑋 → (𝑋 ∖ (𝑋 ∖ 𝑆)) = 𝑆) |
| 8 | 7 | fveq2d 6826 | . . . . . 6 ⊢ (𝑆 ⊆ 𝑋 → ((int‘𝐽)‘(𝑋 ∖ (𝑋 ∖ 𝑆))) = ((int‘𝐽)‘𝑆)) |
| 9 | 8 | adantl 481 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘(𝑋 ∖ (𝑋 ∖ 𝑆))) = ((int‘𝐽)‘𝑆)) |
| 10 | 9 | difeq2d 4073 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑋 ∖ ((int‘𝐽)‘(𝑋 ∖ (𝑋 ∖ 𝑆)))) = (𝑋 ∖ ((int‘𝐽)‘𝑆))) |
| 11 | 5, 10 | eqtrd 2766 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((cls‘𝐽)‘(𝑋 ∖ 𝑆)) = (𝑋 ∖ ((int‘𝐽)‘𝑆))) |
| 12 | 11 | difeq2d 4073 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑆))) = (𝑋 ∖ (𝑋 ∖ ((int‘𝐽)‘𝑆)))) |
| 13 | 2 | ntropn 22964 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) ∈ 𝐽) |
| 14 | 2 | eltopss 22822 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ ((int‘𝐽)‘𝑆) ∈ 𝐽) → ((int‘𝐽)‘𝑆) ⊆ 𝑋) |
| 15 | 13, 14 | syldan 591 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) ⊆ 𝑋) |
| 16 | dfss4 4216 | . . 3 ⊢ (((int‘𝐽)‘𝑆) ⊆ 𝑋 ↔ (𝑋 ∖ (𝑋 ∖ ((int‘𝐽)‘𝑆))) = ((int‘𝐽)‘𝑆)) | |
| 17 | 15, 16 | sylib 218 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑋 ∖ (𝑋 ∖ ((int‘𝐽)‘𝑆))) = ((int‘𝐽)‘𝑆)) |
| 18 | 12, 17 | eqtr2d 2767 | 1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑆)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ∖ cdif 3894 ⊆ wss 3897 ∪ cuni 4856 ‘cfv 6481 Topctop 22808 intcnt 22932 clsccl 22933 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-int 4896 df-iun 4941 df-iin 4942 df-br 5090 df-opab 5152 df-mpt 5171 df-id 5509 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-top 22809 df-cld 22934 df-ntr 22935 df-cls 22936 |
| This theorem is referenced by: ntrdif 22967 ntrss 22970 kur14lem2 35251 dssmapntrcls 44231 |
| Copyright terms: Public domain | W3C validator |