| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ntrss | Structured version Visualization version GIF version | ||
| Description: Subset relationship for interior. (Contributed by NM, 3-Oct-2007.) |
| Ref | Expression |
|---|---|
| clscld.1 | ⊢ 𝑋 = ∪ 𝐽 |
| Ref | Expression |
|---|---|
| ntrss | ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((int‘𝐽)‘𝑇) ⊆ ((int‘𝐽)‘𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sscon 4098 | . . . . . . 7 ⊢ (𝑇 ⊆ 𝑆 → (𝑋 ∖ 𝑆) ⊆ (𝑋 ∖ 𝑇)) | |
| 2 | 1 | adantl 486 | . . . . . 6 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → (𝑋 ∖ 𝑆) ⊆ (𝑋 ∖ 𝑇)) |
| 3 | difss 4091 | . . . . . 6 ⊢ (𝑋 ∖ 𝑇) ⊆ 𝑋 | |
| 4 | 2, 3 | jctil 528 | . . . . 5 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((𝑋 ∖ 𝑇) ⊆ 𝑋 ∧ (𝑋 ∖ 𝑆) ⊆ (𝑋 ∖ 𝑇))) |
| 5 | clscld.1 | . . . . . . 7 ⊢ 𝑋 = ∪ 𝐽 | |
| 6 | 5 | clsss 23192 | . . . . . 6 ⊢ ((𝐽 ∈ Top ∧ (𝑋 ∖ 𝑇) ⊆ 𝑋 ∧ (𝑋 ∖ 𝑆) ⊆ (𝑋 ∖ 𝑇)) → ((cls‘𝐽)‘(𝑋 ∖ 𝑆)) ⊆ ((cls‘𝐽)‘(𝑋 ∖ 𝑇))) |
| 7 | 6 | 3expb 1138 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ ((𝑋 ∖ 𝑇) ⊆ 𝑋 ∧ (𝑋 ∖ 𝑆) ⊆ (𝑋 ∖ 𝑇))) → ((cls‘𝐽)‘(𝑋 ∖ 𝑆)) ⊆ ((cls‘𝐽)‘(𝑋 ∖ 𝑇))) |
| 8 | 4, 7 | sylan2 604 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆)) → ((cls‘𝐽)‘(𝑋 ∖ 𝑆)) ⊆ ((cls‘𝐽)‘(𝑋 ∖ 𝑇))) |
| 9 | 8 | sscond 4101 | . . 3 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆)) → (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑇))) ⊆ (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑆)))) |
| 10 | sstr2 3945 | . . . . 5 ⊢ (𝑇 ⊆ 𝑆 → (𝑆 ⊆ 𝑋 → 𝑇 ⊆ 𝑋)) | |
| 11 | 10 | impcom 412 | . . . 4 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → 𝑇 ⊆ 𝑋) |
| 12 | 5 | ntrval2 23189 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑇 ⊆ 𝑋) → ((int‘𝐽)‘𝑇) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑇)))) |
| 13 | 11, 12 | sylan2 604 | . . 3 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆)) → ((int‘𝐽)‘𝑇) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑇)))) |
| 14 | 5 | ntrval2 23189 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑆)))) |
| 15 | 14 | adantrr 729 | . . 3 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆)) → ((int‘𝐽)‘𝑆) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑆)))) |
| 16 | 9, 13, 15 | 3sstr4d 3993 | . 2 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆)) → ((int‘𝐽)‘𝑇) ⊆ ((int‘𝐽)‘𝑆)) |
| 17 | 16 | 3impb 1132 | 1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((int‘𝐽)‘𝑇) ⊆ ((int‘𝐽)‘𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 ∖ cdif 3903 ⊆ wss 3906 ∪ cuni 4873 ‘cfv 6538 Topctop 23031 intcnt 23155 clsccl 23156 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-int 4914 df-iun 4959 df-iin 4960 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-top 23032 df-cld 23157 df-ntr 23158 df-cls 23159 |
| This theorem is referenced by: ntrin 23199 ntrcls0 23214 dvreslem 26049 dvres2lem 26050 dvaddbr 26078 dvmulbr 26079 dvcnvrelem2 26158 ntruni 36816 cldregopn 36820 limciccioolb 46317 limcicciooub 46331 cncfiooicclem1 46587 |
| Copyright terms: Public domain | W3C validator |