MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ntrval2 Structured version   Visualization version   GIF version

Theorem ntrval2 23279
Description: Interior expressed in terms of closure. (Contributed by NM, 1-Oct-2007.)
Hypothesis
Ref Expression
clscld.1 𝑋 = 𝐽
Assertion
Ref Expression
ntrval2 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((int‘𝐽)‘𝑆) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋𝑆))))

Proof of Theorem ntrval2
StepHypRef Expression
1 difss 4083 . . . . . 6 (𝑋𝑆) ⊆ 𝑋
2 clscld.1 . . . . . . 7 𝑋 = 𝐽
32clsval2 23278 . . . . . 6 ((𝐽 ∈ Top ∧ (𝑋𝑆) ⊆ 𝑋) → ((cls‘𝐽)‘(𝑋𝑆)) = (𝑋 ∖ ((int‘𝐽)‘(𝑋 ∖ (𝑋𝑆)))))
41, 3mpan2 704 . . . . 5 (𝐽 ∈ Top → ((cls‘𝐽)‘(𝑋𝑆)) = (𝑋 ∖ ((int‘𝐽)‘(𝑋 ∖ (𝑋𝑆)))))
54adantr 486 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘(𝑋𝑆)) = (𝑋 ∖ ((int‘𝐽)‘(𝑋 ∖ (𝑋𝑆)))))
6 dfss4 4215 . . . . . . . 8 (𝑆𝑋 ↔ (𝑋 ∖ (𝑋𝑆)) = 𝑆)
76biimpi 219 . . . . . . 7 (𝑆𝑋 → (𝑋 ∖ (𝑋𝑆)) = 𝑆)
87fveq2d 6883 . . . . . 6 (𝑆𝑋 → ((int‘𝐽)‘(𝑋 ∖ (𝑋𝑆))) = ((int‘𝐽)‘𝑆))
98adantl 487 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((int‘𝐽)‘(𝑋 ∖ (𝑋𝑆))) = ((int‘𝐽)‘𝑆))
109difeq2d 4074 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑋 ∖ ((int‘𝐽)‘(𝑋 ∖ (𝑋𝑆)))) = (𝑋 ∖ ((int‘𝐽)‘𝑆)))
115, 10eqtrd 2795 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘(𝑋𝑆)) = (𝑋 ∖ ((int‘𝐽)‘𝑆)))
1211difeq2d 4074 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑋 ∖ ((cls‘𝐽)‘(𝑋𝑆))) = (𝑋 ∖ (𝑋 ∖ ((int‘𝐽)‘𝑆))))
132ntropn 23277 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((int‘𝐽)‘𝑆) ∈ 𝐽)
142eltopss 23135 . . . 4 ((𝐽 ∈ Top ∧ ((int‘𝐽)‘𝑆) ∈ 𝐽) → ((int‘𝐽)‘𝑆) ⊆ 𝑋)
1513, 14syldan 603 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((int‘𝐽)‘𝑆) ⊆ 𝑋)
16 dfss4 4215 . . 3 (((int‘𝐽)‘𝑆) ⊆ 𝑋 ↔ (𝑋 ∖ (𝑋 ∖ ((int‘𝐽)‘𝑆))) = ((int‘𝐽)‘𝑆))
1715, 16sylib 221 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑋 ∖ (𝑋 ∖ ((int‘𝐽)‘𝑆))) = ((int‘𝐽)‘𝑆))
1812, 17eqtr2d 2796 1 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((int‘𝐽)‘𝑆) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋𝑆))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  cdif 3896  wss 3899   cuni 4867  cfv 6533  Topctop 23121  intcnt 23245  clsccl 23246
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-iin 4954  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-top 23122  df-cld 23247  df-ntr 23248  df-cls 23249
This theorem is used by:  ntrdif  23280  ntrss  23283  kur14lem2  35789  dssmapntrcls  44971
  Copyright terms: Public domain W3C validator