| 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 4095 | . . . . . . 7 ⊢ (𝑇 ⊆ 𝑆 → (𝑋 ∖ 𝑆) ⊆ (𝑋 ∖ 𝑇)) | |
| 2 | 1 | adantl 481 | . . . . . 6 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → (𝑋 ∖ 𝑆) ⊆ (𝑋 ∖ 𝑇)) |
| 3 | difss 4088 | . . . . . 6 ⊢ (𝑋 ∖ 𝑇) ⊆ 𝑋 | |
| 4 | 2, 3 | jctil 519 | . . . . 5 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((𝑋 ∖ 𝑇) ⊆ 𝑋 ∧ (𝑋 ∖ 𝑆) ⊆ (𝑋 ∖ 𝑇))) |
| 5 | clscld.1 | . . . . . . 7 ⊢ 𝑋 = ∪ 𝐽 | |
| 6 | 5 | clsss 22998 | . . . . . 6 ⊢ ((𝐽 ∈ Top ∧ (𝑋 ∖ 𝑇) ⊆ 𝑋 ∧ (𝑋 ∖ 𝑆) ⊆ (𝑋 ∖ 𝑇)) → ((cls‘𝐽)‘(𝑋 ∖ 𝑆)) ⊆ ((cls‘𝐽)‘(𝑋 ∖ 𝑇))) |
| 7 | 6 | 3expb 1120 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ ((𝑋 ∖ 𝑇) ⊆ 𝑋 ∧ (𝑋 ∖ 𝑆) ⊆ (𝑋 ∖ 𝑇))) → ((cls‘𝐽)‘(𝑋 ∖ 𝑆)) ⊆ ((cls‘𝐽)‘(𝑋 ∖ 𝑇))) |
| 8 | 4, 7 | sylan2 593 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆)) → ((cls‘𝐽)‘(𝑋 ∖ 𝑆)) ⊆ ((cls‘𝐽)‘(𝑋 ∖ 𝑇))) |
| 9 | 8 | sscond 4098 | . . 3 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆)) → (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑇))) ⊆ (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑆)))) |
| 10 | sstr2 3940 | . . . . 5 ⊢ (𝑇 ⊆ 𝑆 → (𝑆 ⊆ 𝑋 → 𝑇 ⊆ 𝑋)) | |
| 11 | 10 | impcom 407 | . . . 4 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → 𝑇 ⊆ 𝑋) |
| 12 | 5 | ntrval2 22995 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑇 ⊆ 𝑋) → ((int‘𝐽)‘𝑇) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑇)))) |
| 13 | 11, 12 | sylan2 593 | . . 3 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆)) → ((int‘𝐽)‘𝑇) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑇)))) |
| 14 | 5 | ntrval2 22995 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑆)))) |
| 15 | 14 | adantrr 717 | . . 3 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆)) → ((int‘𝐽)‘𝑆) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑆)))) |
| 16 | 9, 13, 15 | 3sstr4d 3989 | . 2 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆)) → ((int‘𝐽)‘𝑇) ⊆ ((int‘𝐽)‘𝑆)) |
| 17 | 16 | 3impb 1114 | 1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((int‘𝐽)‘𝑇) ⊆ ((int‘𝐽)‘𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ∖ cdif 3898 ⊆ wss 3901 ∪ cuni 4863 ‘cfv 6492 Topctop 22837 intcnt 22961 clsccl 22962 |
| 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 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-iin 4949 df-br 5099 df-opab 5161 df-mpt 5180 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 22838 df-cld 22963 df-ntr 22964 df-cls 22965 |
| This theorem is referenced by: ntrin 23005 ntrcls0 23020 dvreslem 25866 dvres2lem 25867 dvaddbr 25896 dvmulbr 25897 dvmulbrOLD 25898 dvcnvrelem2 25979 ntruni 36521 cldregopn 36525 limciccioolb 45863 limcicciooub 45877 cncfiooicclem1 46133 |
| Copyright terms: Public domain | W3C validator |