![]() |
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 4033 | . . . . . 6 ⊢ (𝑋 ∖ 𝑆) ⊆ 𝑋 | |
2 | clscld.1 | . . . . . . 7 ⊢ 𝑋 = ∪ 𝐽 | |
3 | 2 | clsval2 21735 | . . . . . 6 ⊢ ((𝐽 ∈ Top ∧ (𝑋 ∖ 𝑆) ⊆ 𝑋) → ((cls‘𝐽)‘(𝑋 ∖ 𝑆)) = (𝑋 ∖ ((int‘𝐽)‘(𝑋 ∖ (𝑋 ∖ 𝑆))))) |
4 | 1, 3 | mpan2 691 | . . . . 5 ⊢ (𝐽 ∈ Top → ((cls‘𝐽)‘(𝑋 ∖ 𝑆)) = (𝑋 ∖ ((int‘𝐽)‘(𝑋 ∖ (𝑋 ∖ 𝑆))))) |
5 | 4 | adantr 485 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((cls‘𝐽)‘(𝑋 ∖ 𝑆)) = (𝑋 ∖ ((int‘𝐽)‘(𝑋 ∖ (𝑋 ∖ 𝑆))))) |
6 | dfss4 4159 | . . . . . . . 8 ⊢ (𝑆 ⊆ 𝑋 ↔ (𝑋 ∖ (𝑋 ∖ 𝑆)) = 𝑆) | |
7 | 6 | biimpi 219 | . . . . . . 7 ⊢ (𝑆 ⊆ 𝑋 → (𝑋 ∖ (𝑋 ∖ 𝑆)) = 𝑆) |
8 | 7 | fveq2d 6655 | . . . . . 6 ⊢ (𝑆 ⊆ 𝑋 → ((int‘𝐽)‘(𝑋 ∖ (𝑋 ∖ 𝑆))) = ((int‘𝐽)‘𝑆)) |
9 | 8 | adantl 486 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘(𝑋 ∖ (𝑋 ∖ 𝑆))) = ((int‘𝐽)‘𝑆)) |
10 | 9 | difeq2d 4024 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑋 ∖ ((int‘𝐽)‘(𝑋 ∖ (𝑋 ∖ 𝑆)))) = (𝑋 ∖ ((int‘𝐽)‘𝑆))) |
11 | 5, 10 | eqtrd 2794 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((cls‘𝐽)‘(𝑋 ∖ 𝑆)) = (𝑋 ∖ ((int‘𝐽)‘𝑆))) |
12 | 11 | difeq2d 4024 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑆))) = (𝑋 ∖ (𝑋 ∖ ((int‘𝐽)‘𝑆)))) |
13 | 2 | ntropn 21734 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) ∈ 𝐽) |
14 | 2 | eltopss 21592 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ ((int‘𝐽)‘𝑆) ∈ 𝐽) → ((int‘𝐽)‘𝑆) ⊆ 𝑋) |
15 | 13, 14 | syldan 595 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) ⊆ 𝑋) |
16 | dfss4 4159 | . . 3 ⊢ (((int‘𝐽)‘𝑆) ⊆ 𝑋 ↔ (𝑋 ∖ (𝑋 ∖ ((int‘𝐽)‘𝑆))) = ((int‘𝐽)‘𝑆)) | |
17 | 15, 16 | sylib 221 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑋 ∖ (𝑋 ∖ ((int‘𝐽)‘𝑆))) = ((int‘𝐽)‘𝑆)) |
18 | 12, 17 | eqtr2d 2795 | 1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑆)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 400 = wceq 1539 ∈ wcel 2112 ∖ cdif 3851 ⊆ wss 3854 ∪ cuni 4791 ‘cfv 6328 Topctop 21578 intcnt 21702 clsccl 21703 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1912 ax-6 1971 ax-7 2016 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2159 ax-12 2176 ax-ext 2730 ax-rep 5149 ax-sep 5162 ax-nul 5169 ax-pow 5227 ax-pr 5291 ax-un 7452 |
This theorem depends on definitions: df-bi 210 df-an 401 df-or 846 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2071 df-mo 2558 df-eu 2589 df-clab 2737 df-cleq 2751 df-clel 2831 df-nfc 2899 df-ne 2950 df-ral 3073 df-rex 3074 df-reu 3075 df-rab 3077 df-v 3409 df-sbc 3694 df-csb 3802 df-dif 3857 df-un 3859 df-in 3861 df-ss 3871 df-nul 4222 df-if 4414 df-pw 4489 df-sn 4516 df-pr 4518 df-op 4522 df-uni 4792 df-int 4832 df-iun 4878 df-iin 4879 df-br 5026 df-opab 5088 df-mpt 5106 df-id 5423 df-xp 5523 df-rel 5524 df-cnv 5525 df-co 5526 df-dm 5527 df-rn 5528 df-res 5529 df-ima 5530 df-iota 6287 df-fun 6330 df-fn 6331 df-f 6332 df-f1 6333 df-fo 6334 df-f1o 6335 df-fv 6336 df-top 21579 df-cld 21704 df-ntr 21705 df-cls 21706 |
This theorem is referenced by: ntrdif 21737 ntrss 21740 kur14lem2 32670 dssmapntrcls 41189 |
Copyright terms: Public domain | W3C validator |