Theorem opnbnd 35258

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

Step	Hyp	Ref	Expression
1		disjdif 4472	. . . . 5 ⊢ (((int‘𝐽)‘𝐴) ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅
2	1	a1i 11	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (((int‘𝐽)‘𝐴) ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅)
3		ineq1 4206	. . . . 5 ⊢ (((int‘𝐽)‘𝐴) = 𝐴 → (((int‘𝐽)‘𝐴) ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))))
4	3	eqeq1d 2735	. . . 4 ⊢ (((int‘𝐽)‘𝐴) = 𝐴 → ((((int‘𝐽)‘𝐴) ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅ ↔ (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅))
5	2, 4	syl5ibcom 244	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (((int‘𝐽)‘𝐴) = 𝐴 → (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅))
6		opnbnd.1	. . . . . . 7 ⊢ 𝑋 = ∪ 𝐽
7	6	ntrss2 22561	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → ((int‘𝐽)‘𝐴) ⊆ 𝐴)
8	7	adantr 482	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅) → ((int‘𝐽)‘𝐴) ⊆ 𝐴)
9		inssdif0 4370	. . . . . 6 ⊢ ((𝐴 ∩ ((cls‘𝐽)‘𝐴)) ⊆ ((int‘𝐽)‘𝐴) ↔ (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅)
10	6	sscls 22560	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → 𝐴 ⊆ ((cls‘𝐽)‘𝐴))
11		df-ss 3966	. . . . . . . . . 10 ⊢ (𝐴 ⊆ ((cls‘𝐽)‘𝐴) ↔ (𝐴 ∩ ((cls‘𝐽)‘𝐴)) = 𝐴)
12	10, 11	sylib 217	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (𝐴 ∩ ((cls‘𝐽)‘𝐴)) = 𝐴)
13	12	eqcomd 2739	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → 𝐴 = (𝐴 ∩ ((cls‘𝐽)‘𝐴)))
14		eqimss 4041	. . . . . . . 8 ⊢ (𝐴 = (𝐴 ∩ ((cls‘𝐽)‘𝐴)) → 𝐴 ⊆ (𝐴 ∩ ((cls‘𝐽)‘𝐴)))
15	13, 14	syl 17	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → 𝐴 ⊆ (𝐴 ∩ ((cls‘𝐽)‘𝐴)))
16		sstr 3991	. . . . . . 7 ⊢ ((𝐴 ⊆ (𝐴 ∩ ((cls‘𝐽)‘𝐴)) ∧ (𝐴 ∩ ((cls‘𝐽)‘𝐴)) ⊆ ((int‘𝐽)‘𝐴)) → 𝐴 ⊆ ((int‘𝐽)‘𝐴))
17	15, 16	sylan 581	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝐴 ∩ ((cls‘𝐽)‘𝐴)) ⊆ ((int‘𝐽)‘𝐴)) → 𝐴 ⊆ ((int‘𝐽)‘𝐴))
18	9, 17	sylan2br 596	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅) → 𝐴 ⊆ ((int‘𝐽)‘𝐴))
19	8, 18	eqssd 4000	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅) → ((int‘𝐽)‘𝐴) = 𝐴)
20	19	ex 414	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → ((𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅ → ((int‘𝐽)‘𝐴) = 𝐴))
21	5, 20	impbid 211	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (((int‘𝐽)‘𝐴) = 𝐴 ↔ (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅))
22	6	isopn3 22570	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (𝐴 ∈ 𝐽 ↔ ((int‘𝐽)‘𝐴) = 𝐴))
23	6	topbnd 35257	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (((cls‘𝐽)‘𝐴) ∩ ((cls‘𝐽)‘(𝑋 ∖ 𝐴))) = (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴)))
24	23	ineq2d 4213	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∩ ((cls‘𝐽)‘(𝑋 ∖ 𝐴)))) = (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))))
25	24	eqeq1d 2735	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → ((𝐴 ∩ (((cls‘𝐽)‘𝐴) ∩ ((cls‘𝐽)‘(𝑋 ∖ 𝐴)))) = ∅ ↔ (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴))) = ∅))
26	21, 22, 25	3bitr4d 311	1 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (𝐴 ∈ 𝐽 ↔ (𝐴 ∩ (((cls‘𝐽)‘𝐴) ∩ ((cls‘𝐽)‘(𝑋 ∖ 𝐴)))) = ∅))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 397   = wceq 1542   ∈ wcel 2107   ∖ cdif 3946   ∩ cin 3948   ⊆ wss 3949  ∅c0 4323  ∪ cuni 4909  ‘cfv 6544  Topctop 22395  intcnt 22521  clsccl 22522

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7725

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-int 4952  df-iun 5000  df-iin 5001  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-top 22396  df-cld 22523  df-ntr 22524  df-cls 22525

This theorem is referenced by:  cldbnd  35259