Users' Mathboxes Mathbox for Jeff Hankins < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  opnbnd Structured version   Visualization version   GIF version

Theorem opnbnd 37328
Description: A set is open iff it is disjoint from its boundary. (Contributed by Jeff Hankins, 23-Sep-2009.)
Hypothesis
Ref Expression
opnbnd.1 𝑋 = ∪ 𝐽
Assertion
Ref Expression
opnbnd ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (𝐴 ∈ 𝐽 ↔ (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∩ ((cls‘𝐽)‘(𝑋 ∖ 𝐴)))) = ∅))

Proof of Theorem opnbnd
StepHypRef Expression
1 disjdif 4429 . . . . 5 (((int‘𝐽)‘𝐴) ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅
21a1i 11 . . . 4 ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (((int‘𝐽)‘𝐴) ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅)
3 ineq1 4113 . . . . 5 (((int‘𝐽)‘𝐴) = 𝐴 → (((int‘𝐽)‘𝐴) ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))))
43eqeq1d 2765 . . . 4 (((int‘𝐽)‘𝐴) = 𝐴 → ((((int‘𝐽)‘𝐴) ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅ ↔ (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅))
52, 4syl5ibcom 248 . . 3 ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (((int‘𝐽)‘𝐴) = 𝐴 → (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅))
6 opnbnd.1 . . . . . . 7 𝑋 = ∪ 𝐽
76ntrss2 23430 . . . . . 6 ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → ((int‘𝐽)‘𝐴) ⊆ 𝐴)
87adantr 486 . . . . 5 (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅) → ((int‘𝐽)‘𝐴) ⊆ 𝐴)
9 inssdif0 4325 . . . . . 6 ((𝐴 ∩ ((cls‘𝐽)‘𝐴)) ⊆ ((int‘𝐽)‘𝐴) ↔ (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅)
106sscls 23429 . . . . . . . . . 10 ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → 𝐴 ⊆ ((cls‘𝐽)‘𝐴))
11 dfss2 4097 . . . . . . . . . 10 (𝐴 ⊆ ((cls‘𝐽)‘𝐴) ↔ (𝐴 ∩ ((cls‘𝐽)‘𝐴)) = 𝐴)
1210, 11sylib 221 . . . . . . . . 9 ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (𝐴 ∩ ((cls‘𝐽)‘𝐴)) = 𝐴)
1312eqcomd 2769 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → 𝐴 = (𝐴 ∩ ((cls‘𝐽)‘𝐴)))
14 eqimss 3971 . . . . . . . 8 (𝐴 = (𝐴 ∩ ((cls‘𝐽)‘𝐴)) → 𝐴 ⊆ (𝐴 ∩ ((cls‘𝐽)‘𝐴)))
1513, 14syl 18 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → 𝐴 ⊆ (𝐴 ∩ ((cls‘𝐽)‘𝐴)))
16 sstr 3921 . . . . . . 7 ((𝐴 ⊆ (𝐴 ∩ ((cls‘𝐽)‘𝐴)) ∧ (𝐴 ∩ ((cls‘𝐽)‘𝐴)) ⊆ ((int‘𝐽)‘𝐴)) → 𝐴 ⊆ ((int‘𝐽)‘𝐴))
1715, 16sylan 592 . . . . . 6 (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝐴 ∩ ((cls‘𝐽)‘𝐴)) ⊆ ((int‘𝐽)‘𝐴)) → 𝐴 ⊆ ((int‘𝐽)‘𝐴))
189, 17sylan2br 607 . . . . 5 (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅) → 𝐴 ⊆ ((int‘𝐽)‘𝐴))
198, 18eqssd 3930 . . . 4 (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅) → ((int‘𝐽)‘𝐴) = 𝐴)
2019ex 418 . . 3 ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → ((𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅ → ((int‘𝐽)‘𝐴) = 𝐴))
215, 20impbid 215 . 2 ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (((int‘𝐽)‘𝐴) = 𝐴 ↔ (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅))
226isopn3 23439 . 2 ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (𝐴 ∈ 𝐽 ↔ ((int‘𝐽)‘𝐴) = 𝐴))
236topbnd 37327 . . . 4 ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (((cls‘𝐽)‘𝐴) ∩ ((cls‘𝐽)‘(𝑋 ∖ 𝐴))) = (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴)))
2423ineq2d 4120 . . 3 ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∩ ((cls‘𝐽)‘(𝑋 ∖ 𝐴)))) = (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))))
2524eqeq1d 2765 . 2 ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → ((𝐴 ∩ (((cls‘𝐽)‘𝐴) ∩ ((cls‘𝐽)‘(𝑋 ∖ 𝐴)))) = ∅ ↔ (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅))
2621, 22, 253bitr4d 314 1 ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (𝐴 ∈ 𝐽 ↔ (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∩ ((cls‘𝐽)‘(𝑋 ∖ 𝐴)))) = ∅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900   ∖ cdif 4048   ∩ cin 4092  ∅c0 4281  ∪ cuni 4872  ‘cfv 6566  Topctop 23266  intcnt 23390  clsccl 23391
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-iin 4959  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-top 23267  df-cld 23392  df-ntr 23393  df-cls 23394
This theorem is used by:  cldbnd  37329
  Copyright terms: Public domain W3C validator