| 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 4084 | . . . . . . 7 ⊢ (𝑇 ⊆ 𝑆 → (𝑋 ∖ 𝑆) ⊆ (𝑋 ∖ 𝑇)) | |
| 2 | 1 | adantl 481 | . . . . . 6 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → (𝑋 ∖ 𝑆) ⊆ (𝑋 ∖ 𝑇)) |
| 3 | difss 4077 | . . . . . 6 ⊢ (𝑋 ∖ 𝑇) ⊆ 𝑋 | |
| 4 | 2, 3 | jctil 519 | . . . . 5 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((𝑋 ∖ 𝑇) ⊆ 𝑋 ∧ (𝑋 ∖ 𝑆) ⊆ (𝑋 ∖ 𝑇))) |
| 5 | clscld.1 | . . . . . . 7 ⊢ 𝑋 = ∪ 𝐽 | |
| 6 | 5 | clsss 23029 | . . . . . 6 ⊢ ((𝐽 ∈ Top ∧ (𝑋 ∖ 𝑇) ⊆ 𝑋 ∧ (𝑋 ∖ 𝑆) ⊆ (𝑋 ∖ 𝑇)) → ((cls‘𝐽)‘(𝑋 ∖ 𝑆)) ⊆ ((cls‘𝐽)‘(𝑋 ∖ 𝑇))) |
| 7 | 6 | 3expb 1121 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ ((𝑋 ∖ 𝑇) ⊆ 𝑋 ∧ (𝑋 ∖ 𝑆) ⊆ (𝑋 ∖ 𝑇))) → ((cls‘𝐽)‘(𝑋 ∖ 𝑆)) ⊆ ((cls‘𝐽)‘(𝑋 ∖ 𝑇))) |
| 8 | 4, 7 | sylan2 594 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆)) → ((cls‘𝐽)‘(𝑋 ∖ 𝑆)) ⊆ ((cls‘𝐽)‘(𝑋 ∖ 𝑇))) |
| 9 | 8 | sscond 4087 | . . 3 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆)) → (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑇))) ⊆ (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑆)))) |
| 10 | sstr2 3929 | . . . . 5 ⊢ (𝑇 ⊆ 𝑆 → (𝑆 ⊆ 𝑋 → 𝑇 ⊆ 𝑋)) | |
| 11 | 10 | impcom 407 | . . . 4 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → 𝑇 ⊆ 𝑋) |
| 12 | 5 | ntrval2 23026 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑇 ⊆ 𝑋) → ((int‘𝐽)‘𝑇) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑇)))) |
| 13 | 11, 12 | sylan2 594 | . . 3 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆)) → ((int‘𝐽)‘𝑇) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑇)))) |
| 14 | 5 | ntrval2 23026 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑆)))) |
| 15 | 14 | adantrr 718 | . . 3 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆)) → ((int‘𝐽)‘𝑆) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑆)))) |
| 16 | 9, 13, 15 | 3sstr4d 3978 | . 2 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆)) → ((int‘𝐽)‘𝑇) ⊆ ((int‘𝐽)‘𝑆)) |
| 17 | 16 | 3impb 1115 | 1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((int‘𝐽)‘𝑇) ⊆ ((int‘𝐽)‘𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∖ cdif 3887 ⊆ wss 3890 ∪ cuni 4851 ‘cfv 6492 Topctop 22868 intcnt 22992 clsccl 22993 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-top 22869 df-cld 22994 df-ntr 22995 df-cls 22996 |
| This theorem is referenced by: ntrin 23036 ntrcls0 23051 dvreslem 25886 dvres2lem 25887 dvaddbr 25915 dvmulbr 25916 dvcnvrelem2 25995 ntruni 36525 cldregopn 36529 limciccioolb 46069 limcicciooub 46083 cncfiooicclem1 46339 |
| Copyright terms: Public domain | W3C validator |