Theorem clslp 23113

Description: The closure of a subset of a topological space is the subset together with its limit points. Theorem 6.6 of [Munkres] p. 97. (Contributed by NM, 26-Feb-2007.)

Hypothesis

Ref	Expression
lpfval.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
clslp	⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((cls‘𝐽)‘𝑆) = (𝑆 ∪ ((limPt‘𝐽)‘𝑆)))

Proof of Theorem clslp

Dummy variables 𝑛 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		lpfval.1	. . . . . . . . . . . . 13 ⊢ 𝑋 = ∪ 𝐽
2	1	neindisj 23082	. . . . . . . . . . . 12 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ (𝑥 ∈ ((cls‘𝐽)‘𝑆) ∧ 𝑛 ∈ ((nei‘𝐽)‘{𝑥}))) → (𝑛 ∩ 𝑆) ≠ ∅)
3	2	expr 456	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ ((cls‘𝐽)‘𝑆)) → (𝑛 ∈ ((nei‘𝐽)‘{𝑥}) → (𝑛 ∩ 𝑆) ≠ ∅))
4	3	adantr 480	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ ((cls‘𝐽)‘𝑆)) ∧ ¬ 𝑥 ∈ 𝑆) → (𝑛 ∈ ((nei‘𝐽)‘{𝑥}) → (𝑛 ∩ 𝑆) ≠ ∅))
5		difsn 4743	. . . . . . . . . . . . 13 ⊢ (¬ 𝑥 ∈ 𝑆 → (𝑆 ∖ {𝑥}) = 𝑆)
6	5	ineq2d 4160	. . . . . . . . . . . 12 ⊢ (¬ 𝑥 ∈ 𝑆 → (𝑛 ∩ (𝑆 ∖ {𝑥})) = (𝑛 ∩ 𝑆))
7	6	neeq1d 2991	. . . . . . . . . . 11 ⊢ (¬ 𝑥 ∈ 𝑆 → ((𝑛 ∩ (𝑆 ∖ {𝑥})) ≠ ∅ ↔ (𝑛 ∩ 𝑆) ≠ ∅))
8	7	adantl 481	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ ((cls‘𝐽)‘𝑆)) ∧ ¬ 𝑥 ∈ 𝑆) → ((𝑛 ∩ (𝑆 ∖ {𝑥})) ≠ ∅ ↔ (𝑛 ∩ 𝑆) ≠ ∅))
9	4, 8	sylibrd 259	. . . . . . . . 9 ⊢ ((((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ ((cls‘𝐽)‘𝑆)) ∧ ¬ 𝑥 ∈ 𝑆) → (𝑛 ∈ ((nei‘𝐽)‘{𝑥}) → (𝑛 ∩ (𝑆 ∖ {𝑥})) ≠ ∅))
10	9	ex 412	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ ((cls‘𝐽)‘𝑆)) → (¬ 𝑥 ∈ 𝑆 → (𝑛 ∈ ((nei‘𝐽)‘{𝑥}) → (𝑛 ∩ (𝑆 ∖ {𝑥})) ≠ ∅)))
11	10	ralrimdv 3135	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ ((cls‘𝐽)‘𝑆)) → (¬ 𝑥 ∈ 𝑆 → ∀𝑛 ∈ ((nei‘𝐽)‘{𝑥})(𝑛 ∩ (𝑆 ∖ {𝑥})) ≠ ∅))
12		simpll 767	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ ((cls‘𝐽)‘𝑆)) → 𝐽 ∈ Top)
13		simplr 769	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ ((cls‘𝐽)‘𝑆)) → 𝑆 ⊆ 𝑋)
14	1	clsss3 23024	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑋)
15	14	sselda 3921	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ ((cls‘𝐽)‘𝑆)) → 𝑥 ∈ 𝑋)
16	1	islp2 23110	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑥 ∈ 𝑋) → (𝑥 ∈ ((limPt‘𝐽)‘𝑆) ↔ ∀𝑛 ∈ ((nei‘𝐽)‘{𝑥})(𝑛 ∩ (𝑆 ∖ {𝑥})) ≠ ∅))
17	12, 13, 15, 16	syl3anc 1374	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ ((cls‘𝐽)‘𝑆)) → (𝑥 ∈ ((limPt‘𝐽)‘𝑆) ↔ ∀𝑛 ∈ ((nei‘𝐽)‘{𝑥})(𝑛 ∩ (𝑆 ∖ {𝑥})) ≠ ∅))
18	11, 17	sylibrd 259	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ ((cls‘𝐽)‘𝑆)) → (¬ 𝑥 ∈ 𝑆 → 𝑥 ∈ ((limPt‘𝐽)‘𝑆)))
19	18	orrd 864	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ ((cls‘𝐽)‘𝑆)) → (𝑥 ∈ 𝑆 ∨ 𝑥 ∈ ((limPt‘𝐽)‘𝑆)))
20		elun 4093	. . . . 5 ⊢ (𝑥 ∈ (𝑆 ∪ ((limPt‘𝐽)‘𝑆)) ↔ (𝑥 ∈ 𝑆 ∨ 𝑥 ∈ ((limPt‘𝐽)‘𝑆)))
21	19, 20	sylibr 234	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ ((cls‘𝐽)‘𝑆)) → 𝑥 ∈ (𝑆 ∪ ((limPt‘𝐽)‘𝑆)))
22	21	ex 412	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑥 ∈ ((cls‘𝐽)‘𝑆) → 𝑥 ∈ (𝑆 ∪ ((limPt‘𝐽)‘𝑆))))
23	22	ssrdv 3927	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((cls‘𝐽)‘𝑆) ⊆ (𝑆 ∪ ((limPt‘𝐽)‘𝑆)))
24	1	sscls 23021	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆))
25	1	lpsscls 23106	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((limPt‘𝐽)‘𝑆) ⊆ ((cls‘𝐽)‘𝑆))
26	24, 25	unssd 4132	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑆 ∪ ((limPt‘𝐽)‘𝑆)) ⊆ ((cls‘𝐽)‘𝑆))
27	23, 26	eqssd 3939	1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((cls‘𝐽)‘𝑆) = (𝑆 ∪ ((limPt‘𝐽)‘𝑆)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 848   = wceq 1542   ∈ wcel 2114   ≠ wne 2932  ∀wral 3051   ∖ cdif 3886   ∪ cun 3887   ∩ cin 3888   ⊆ wss 3889  ∅c0 4273  {csn 4567  ∪ cuni 4850  ‘cfv 6498  Topctop 22858  clsccl 22983  neicnei 23062  limPtclp 23099

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  df-nei 23063  df-lp 23101

This theorem is referenced by:  islpi  23114  cldlp  23115  perfcls  23330