Theorem topbnd 33676

Description: Two equivalent expressions for the boundary of a topology. (Contributed by Jeff Hankins, 23-Sep-2009.)

Hypothesis

Ref	Expression
topbnd.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
topbnd	⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (((cls‘𝐽)‘𝐴) ∩ ((cls‘𝐽)‘(𝑋 ∖ 𝐴))) = (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴)))

Proof of Theorem topbnd

Step	Hyp	Ref	Expression
1		topbnd.1	. . . . 5 ⊢ 𝑋 = ∪ 𝐽
2	1	clsdif 21664	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → ((cls‘𝐽)‘(𝑋 ∖ 𝐴)) = (𝑋 ∖ ((int‘𝐽)‘𝐴)))
3	2	ineq2d 4192	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (((cls‘𝐽)‘𝐴) ∩ ((cls‘𝐽)‘(𝑋 ∖ 𝐴))) = (((cls‘𝐽)‘𝐴) ∩ (𝑋 ∖ ((int‘𝐽)‘𝐴))))
4		indif2 4250	. . 3 ⊢ (((cls‘𝐽)‘𝐴) ∩ (𝑋 ∖ ((int‘𝐽)‘𝐴))) = ((((cls‘𝐽)‘𝐴) ∩ 𝑋) ∖ ((int‘𝐽)‘𝐴))
5	3, 4	syl6eq 2875	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (((cls‘𝐽)‘𝐴) ∩ ((cls‘𝐽)‘(𝑋 ∖ 𝐴))) = ((((cls‘𝐽)‘𝐴) ∩ 𝑋) ∖ ((int‘𝐽)‘𝐴)))
6	1	clsss3 21670	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → ((cls‘𝐽)‘𝐴) ⊆ 𝑋)
7		df-ss 3955	. . . 4 ⊢ (((cls‘𝐽)‘𝐴) ⊆ 𝑋 ↔ (((cls‘𝐽)‘𝐴) ∩ 𝑋) = ((cls‘𝐽)‘𝐴))
8	6, 7	sylib 220	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (((cls‘𝐽)‘𝐴) ∩ 𝑋) = ((cls‘𝐽)‘𝐴))
9	8	difeq1d 4101	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → ((((cls‘𝐽)‘𝐴) ∩ 𝑋) ∖ ((int‘𝐽)‘𝐴)) = (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴)))
10	5, 9	eqtrd 2859	1 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → (((cls‘𝐽)‘𝐴) ∩ ((cls‘𝐽)‘(𝑋 ∖ 𝐴))) = (((cls‘𝐽)‘𝐴) ∖ ((int‘𝐽)‘𝐴)))

Syntax hints:   → wi 4   ∧ wa 398   = wceq 1536   ∈ wcel 2113   ∖ cdif 3936   ∩ cin 3938   ⊆ wss 3939  ∪ cuni 4841  ‘cfv 6358  Topctop 21504  intcnt 21628  clsccl 21629

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-rep 5193  ax-sep 5206  ax-nul 5213  ax-pow 5269  ax-pr 5333  ax-un 7464

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-ral 3146  df-rex 3147  df-reu 3148  df-rab 3150  df-v 3499  df-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-pw 4544  df-sn 4571  df-pr 4573  df-op 4577  df-uni 4842  df-int 4880  df-iun 4924  df-iin 4925  df-br 5070  df-opab 5132  df-mpt 5150  df-id 5463  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-top 21505  df-cld 21630  df-ntr 21631  df-cls 21632

This theorem is referenced by:  opnbnd  33677