HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem ntrval2 8962
Description: Interior expressed in terms of closure.
Hypothesis
Ref Expression
clscld.1 |- X = U.J
Assertion
Ref Expression
ntrval2 |- ((J e. Top /\ S C_ X) -> ((int` J)` S) = (X \ ((cls` J)` (X \ S))))

Proof of Theorem ntrval2
StepHypRef Expression
1 difss 2735 . . . . . 6 |- (X \ S) C_ X
2 clscld.1 . . . . . . 7 |- X = U.J
32clsval2 8961 . . . . . 6 |- ((J e. Top /\ (X \ S) C_ X) -> ((cls` J)` (X \ S)) = (X \ ((int` J)` (X \ (X \ S)))))
41, 3mpan2 760 . . . . 5 |- (J e. Top -> ((cls` J)` (X \ S)) = (X \ ((int` J)` (X \ (X \ S)))))
54adantr 425 . . . 4 |- ((J e. Top /\ S C_ X) -> ((cls` J)` (X \ S)) = (X \ ((int` J)` (X \ (X \ S)))))
6 dfss4 2827 . . . . . . . 8 |- (S C_ X <-> (X \ (X \ S)) = S)
76biimpi 168 . . . . . . 7 |- (S C_ X -> (X \ (X \ S)) = S)
87fveq2d 4685 . . . . . 6 |- (S C_ X -> ((int` J)` (X \ (X \ S))) = ((int` J)` S))
98adantl 424 . . . . 5 |- ((J e. Top /\ S C_ X) -> ((int` J)` (X \ (X \ S))) = ((int` J)` S))
109difeq2d 2726 . . . 4 |- ((J e. Top /\ S C_ X) -> (X \ ((int` J)` (X \ (X \ S)))) = (X \ ((int` J)` S)))
115, 10eqtrd 1925 . . 3 |- ((J e. Top /\ S C_ X) -> ((cls` J)` (X \ S)) = (X \ ((int` J)` S)))
1211difeq2d 2726 . 2 |- ((J e. Top /\ S C_ X) -> (X \ ((cls` J)` (X \ S))) = (X \ (X \ ((int` J)` S))))
132ntropn 8960 . . . 4 |- ((J e. Top /\ S C_ X) -> ((int` J)` S) e. J)
142eltopss 8872 . . . 4 |- ((J e. Top /\ ((int` J)` S) e. J) -> ((int` J)` S) C_ X)
1513, 14syldan 516 . . 3 |- ((J e. Top /\ S C_ X) -> ((int` J)` S) C_ X)
16 dfss4 2827 . . 3 |- (((int` J)` S) C_ X <-> (X \ (X \ ((int`
J)` S))) = ((int` J)` S))
1715, 16sylib 215 . 2 |- ((J e. Top /\ S C_ X) -> (X \ (X \ ((int`
J)` S))) = ((int` J)` S))
1812, 17eqtr2d 1926 1 |- ((J e. Top /\ S C_ X) -> ((int` J)` S) = (X \ ((cls` J)` (X \ S))))
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 240   = wceq 1298   e. wcel 1300   \ cdif 2590   C_ wss 2593  U.cuni 3177  ` cfv 3998  Topctop 8857  intcnt 8937  clsccl 8938
This theorem is referenced by:  ntrss 8964  cmntrcld 8970  ntrcmp 15406
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-13 1311  ax-14 1312  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865  ax-rep 3428  ax-sep 3438  ax-nul 3445  ax-pow 3481  ax-pr 3524  ax-un 3790
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-ex 1327  df-sb 1536  df-eu 1775  df-mo 1776  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-ral 2109  df-rex 2110  df-rab 2112  df-v 2294  df-dif 2597  df-un 2600  df-in 2603  df-ss 2605  df-nul 2876  df-pw 3035  df-sn 3049  df-pr 3050  df-op 3053  df-uni 3178  df-int 3215  df-br 3339  df-opab 3396  df-id 3586  df-xp 4000  df-rel 4001  df-cnv 4002  df-co 4003  df-dm 4004  df-rn 4005  df-res 4006  df-ima 4007  df-fun 4008  df-fn 4009  df-fv 4014  df-top 8861  df-cld 8939  df-ntr 8940  df-cls 8941
Copyright terms: Public domain