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

Theorem lpcls 21656
Description: The limit points of the closure of a subset are the same as the limit points of the set in a T1 space. (Contributed by Mario Carneiro, 26-Dec-2016.)
Hypothesis
Ref Expression
lpcls.1 𝑋 = 𝐽
Assertion
Ref Expression
lpcls ((𝐽 ∈ Fre ∧ 𝑆𝑋) → ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆)) = ((limPt‘𝐽)‘𝑆))

Proof of Theorem lpcls
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 t1top 21622 . . . . . . 7 (𝐽 ∈ Fre → 𝐽 ∈ Top)
2 lpcls.1 . . . . . . . . . 10 𝑋 = 𝐽
32clsss3 21351 . . . . . . . . 9 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑋)
43ssdifssd 4040 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (((cls‘𝐽)‘𝑆) ∖ {𝑥}) ⊆ 𝑋)
52clsss3 21351 . . . . . . . 8 ((𝐽 ∈ Top ∧ (((cls‘𝐽)‘𝑆) ∖ {𝑥}) ⊆ 𝑋) → ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) ⊆ 𝑋)
64, 5syldan 591 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) ⊆ 𝑋)
71, 6sylan 580 . . . . . 6 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) ⊆ 𝑋)
87sseld 3888 . . . . 5 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑥 ∈ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) → 𝑥𝑋))
9 ssdifss 4033 . . . . . . . . . . 11 (𝑆𝑋 → (𝑆 ∖ {𝑥}) ⊆ 𝑋)
102clscld 21339 . . . . . . . . . . 11 ((𝐽 ∈ Top ∧ (𝑆 ∖ {𝑥}) ⊆ 𝑋) → ((cls‘𝐽)‘(𝑆 ∖ {𝑥})) ∈ (Clsd‘𝐽))
111, 9, 10syl2an 595 . . . . . . . . . 10 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → ((cls‘𝐽)‘(𝑆 ∖ {𝑥})) ∈ (Clsd‘𝐽))
1211adantr 481 . . . . . . . . 9 (((𝐽 ∈ Fre ∧ 𝑆𝑋) ∧ 𝑥𝑋) → ((cls‘𝐽)‘(𝑆 ∖ {𝑥})) ∈ (Clsd‘𝐽))
132t1sncld 21618 . . . . . . . . . . . . 13 ((𝐽 ∈ Fre ∧ 𝑥𝑋) → {𝑥} ∈ (Clsd‘𝐽))
1413adantlr 711 . . . . . . . . . . . 12 (((𝐽 ∈ Fre ∧ 𝑆𝑋) ∧ 𝑥𝑋) → {𝑥} ∈ (Clsd‘𝐽))
15 uncld 21333 . . . . . . . . . . . 12 (({𝑥} ∈ (Clsd‘𝐽) ∧ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})) ∈ (Clsd‘𝐽)) → ({𝑥} ∪ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))) ∈ (Clsd‘𝐽))
1614, 12, 15syl2anc 584 . . . . . . . . . . 11 (((𝐽 ∈ Fre ∧ 𝑆𝑋) ∧ 𝑥𝑋) → ({𝑥} ∪ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))) ∈ (Clsd‘𝐽))
172sscls 21348 . . . . . . . . . . . . . 14 ((𝐽 ∈ Top ∧ (𝑆 ∖ {𝑥}) ⊆ 𝑋) → (𝑆 ∖ {𝑥}) ⊆ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))
181, 9, 17syl2an 595 . . . . . . . . . . . . 13 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑆 ∖ {𝑥}) ⊆ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))
19 ssundif 4347 . . . . . . . . . . . . 13 (𝑆 ⊆ ({𝑥} ∪ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))) ↔ (𝑆 ∖ {𝑥}) ⊆ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))
2018, 19sylibr 235 . . . . . . . . . . . 12 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → 𝑆 ⊆ ({𝑥} ∪ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))))
2120adantr 481 . . . . . . . . . . 11 (((𝐽 ∈ Fre ∧ 𝑆𝑋) ∧ 𝑥𝑋) → 𝑆 ⊆ ({𝑥} ∪ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))))
222clsss2 21364 . . . . . . . . . . 11 ((({𝑥} ∪ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))) ∈ (Clsd‘𝐽) ∧ 𝑆 ⊆ ({𝑥} ∪ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))) → ((cls‘𝐽)‘𝑆) ⊆ ({𝑥} ∪ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))))
2316, 21, 22syl2anc 584 . . . . . . . . . 10 (((𝐽 ∈ Fre ∧ 𝑆𝑋) ∧ 𝑥𝑋) → ((cls‘𝐽)‘𝑆) ⊆ ({𝑥} ∪ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))))
24 ssundif 4347 . . . . . . . . . 10 (((cls‘𝐽)‘𝑆) ⊆ ({𝑥} ∪ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))) ↔ (((cls‘𝐽)‘𝑆) ∖ {𝑥}) ⊆ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))
2523, 24sylib 219 . . . . . . . . 9 (((𝐽 ∈ Fre ∧ 𝑆𝑋) ∧ 𝑥𝑋) → (((cls‘𝐽)‘𝑆) ∖ {𝑥}) ⊆ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))
262clsss2 21364 . . . . . . . . 9 ((((cls‘𝐽)‘(𝑆 ∖ {𝑥})) ∈ (Clsd‘𝐽) ∧ (((cls‘𝐽)‘𝑆) ∖ {𝑥}) ⊆ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))) → ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) ⊆ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))
2712, 25, 26syl2anc 584 . . . . . . . 8 (((𝐽 ∈ Fre ∧ 𝑆𝑋) ∧ 𝑥𝑋) → ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) ⊆ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))
2827sseld 3888 . . . . . . 7 (((𝐽 ∈ Fre ∧ 𝑆𝑋) ∧ 𝑥𝑋) → (𝑥 ∈ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) → 𝑥 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))))
2928ex 413 . . . . . 6 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑥𝑋 → (𝑥 ∈ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) → 𝑥 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))))
3029com23 86 . . . . 5 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑥 ∈ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) → (𝑥𝑋𝑥 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))))
318, 30mpdd 43 . . . 4 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑥 ∈ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) → 𝑥 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))))
321adantr 481 . . . . . 6 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → 𝐽 ∈ Top)
331, 3sylan 580 . . . . . . 7 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑋)
3433ssdifssd 4040 . . . . . 6 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (((cls‘𝐽)‘𝑆) ∖ {𝑥}) ⊆ 𝑋)
352sscls 21348 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆))
361, 35sylan 580 . . . . . . 7 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆))
3736ssdifd 4038 . . . . . 6 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑆 ∖ {𝑥}) ⊆ (((cls‘𝐽)‘𝑆) ∖ {𝑥}))
382clsss 21346 . . . . . 6 ((𝐽 ∈ Top ∧ (((cls‘𝐽)‘𝑆) ∖ {𝑥}) ⊆ 𝑋 ∧ (𝑆 ∖ {𝑥}) ⊆ (((cls‘𝐽)‘𝑆) ∖ {𝑥})) → ((cls‘𝐽)‘(𝑆 ∖ {𝑥})) ⊆ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})))
3932, 34, 37, 38syl3anc 1364 . . . . 5 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → ((cls‘𝐽)‘(𝑆 ∖ {𝑥})) ⊆ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})))
4039sseld 3888 . . . 4 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑥 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})) → 𝑥 ∈ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥}))))
4131, 40impbid 213 . . 3 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑥 ∈ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) ↔ 𝑥 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))))
422islp 21432 . . . . 5 ((𝐽 ∈ Top ∧ ((cls‘𝐽)‘𝑆) ⊆ 𝑋) → (𝑥 ∈ ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆)) ↔ 𝑥 ∈ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥}))))
433, 42syldan 591 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑥 ∈ ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆)) ↔ 𝑥 ∈ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥}))))
441, 43sylan 580 . . 3 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑥 ∈ ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆)) ↔ 𝑥 ∈ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥}))))
452islp 21432 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑥 ∈ ((limPt‘𝐽)‘𝑆) ↔ 𝑥 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))))
461, 45sylan 580 . . 3 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑥 ∈ ((limPt‘𝐽)‘𝑆) ↔ 𝑥 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))))
4741, 44, 463bitr4d 312 . 2 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑥 ∈ ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆)) ↔ 𝑥 ∈ ((limPt‘𝐽)‘𝑆)))
4847eqrdv 2793 1 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆)) = ((limPt‘𝐽)‘𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1522  wcel 2081  cdif 3856  cun 3857  wss 3859  {csn 4472   cuni 4745  cfv 6225  Topctop 21185  Clsdccld 21308  clsccl 21310  limPtclp 21426  Frect1 21599
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1777  ax-4 1791  ax-5 1888  ax-6 1947  ax-7 1992  ax-8 2083  ax-9 2091  ax-10 2112  ax-11 2126  ax-12 2141  ax-13 2344  ax-ext 2769  ax-rep 5081  ax-sep 5094  ax-nul 5101  ax-pow 5157  ax-pr 5221  ax-un 7319
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-3an 1082  df-tru 1525  df-ex 1762  df-nf 1766  df-sb 2043  df-mo 2576  df-eu 2612  df-clab 2776  df-cleq 2788  df-clel 2863  df-nfc 2935  df-ne 2985  df-ral 3110  df-rex 3111  df-reu 3112  df-rab 3114  df-v 3439  df-sbc 3707  df-csb 3812  df-dif 3862  df-un 3864  df-in 3866  df-ss 3874  df-nul 4212  df-if 4382  df-pw 4455  df-sn 4473  df-pr 4475  df-op 4479  df-uni 4746  df-int 4783  df-iun 4827  df-iin 4828  df-br 4963  df-opab 5025  df-mpt 5042  df-id 5348  df-xp 5449  df-rel 5450  df-cnv 5451  df-co 5452  df-dm 5453  df-rn 5454  df-res 5455  df-ima 5456  df-iota 6189  df-fun 6227  df-fn 6228  df-f 6229  df-f1 6230  df-fo 6231  df-f1o 6232  df-fv 6233  df-top 21186  df-cld 21311  df-cls 21313  df-lp 21428  df-t1 21606
This theorem is referenced by:  perfcls  21657
  Copyright terms: Public domain W3C validator