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

Theorem clsdif 23018
Description: A closure of a complement is the complement of the interior. (Contributed by Jeff Hankins, 31-Aug-2009.)
Hypothesis
Ref Expression
clscld.1 𝑋 = 𝐽
Assertion
Ref Expression
clsdif ((𝐽 ∈ Top ∧ 𝐴𝑋) → ((cls‘𝐽)‘(𝑋𝐴)) = (𝑋 ∖ ((int‘𝐽)‘𝐴)))

Proof of Theorem clsdif
StepHypRef Expression
1 difss 4076 . . . 4 (𝑋𝐴) ⊆ 𝑋
2 clscld.1 . . . . 5 𝑋 = 𝐽
32clsval2 23015 . . . 4 ((𝐽 ∈ Top ∧ (𝑋𝐴) ⊆ 𝑋) → ((cls‘𝐽)‘(𝑋𝐴)) = (𝑋 ∖ ((int‘𝐽)‘(𝑋 ∖ (𝑋𝐴)))))
41, 3mpan2 692 . . 3 (𝐽 ∈ Top → ((cls‘𝐽)‘(𝑋𝐴)) = (𝑋 ∖ ((int‘𝐽)‘(𝑋 ∖ (𝑋𝐴)))))
54adantr 480 . 2 ((𝐽 ∈ Top ∧ 𝐴𝑋) → ((cls‘𝐽)‘(𝑋𝐴)) = (𝑋 ∖ ((int‘𝐽)‘(𝑋 ∖ (𝑋𝐴)))))
6 simpr 484 . . . . 5 ((𝐽 ∈ Top ∧ 𝐴𝑋) → 𝐴𝑋)
7 dfss4 4209 . . . . 5 (𝐴𝑋 ↔ (𝑋 ∖ (𝑋𝐴)) = 𝐴)
86, 7sylib 218 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋) → (𝑋 ∖ (𝑋𝐴)) = 𝐴)
98fveq2d 6844 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋) → ((int‘𝐽)‘(𝑋 ∖ (𝑋𝐴))) = ((int‘𝐽)‘𝐴))
109difeq2d 4066 . 2 ((𝐽 ∈ Top ∧ 𝐴𝑋) → (𝑋 ∖ ((int‘𝐽)‘(𝑋 ∖ (𝑋𝐴)))) = (𝑋 ∖ ((int‘𝐽)‘𝐴)))
115, 10eqtrd 2771 1 ((𝐽 ∈ Top ∧ 𝐴𝑋) → ((cls‘𝐽)‘(𝑋𝐴)) = (𝑋 ∖ ((int‘𝐽)‘𝐴)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  cdif 3886  wss 3889   cuni 4850  cfv 6498  Topctop 22858  intcnt 22982  clsccl 22983
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 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-iin 4936  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-top 22859  df-cld 22984  df-ntr 22985  df-cls 22986
This theorem is referenced by:  maxlp  23112  topbnd  36506
  Copyright terms: Public domain W3C validator