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

Theorem lpcls 23339
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 23305 . . . . . . 7 (𝐽 ∈ Fre → 𝐽 ∈ Top)
2 lpcls.1 . . . . . . . . . 10 𝑋 = 𝐽
32clsss3 23034 . . . . . . . . 9 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑋)
43ssdifssd 4088 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (((cls‘𝐽)‘𝑆) ∖ {𝑥}) ⊆ 𝑋)
52clsss3 23034 . . . . . . . 8 ((𝐽 ∈ Top ∧ (((cls‘𝐽)‘𝑆) ∖ {𝑥}) ⊆ 𝑋) → ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) ⊆ 𝑋)
64, 5syldan 592 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) ⊆ 𝑋)
71, 6sylan 581 . . . . . 6 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) ⊆ 𝑋)
87sseld 3921 . . . . 5 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑥 ∈ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) → 𝑥𝑋))
9 ssdifss 4081 . . . . . . . . . . 11 (𝑆𝑋 → (𝑆 ∖ {𝑥}) ⊆ 𝑋)
102clscld 23022 . . . . . . . . . . 11 ((𝐽 ∈ Top ∧ (𝑆 ∖ {𝑥}) ⊆ 𝑋) → ((cls‘𝐽)‘(𝑆 ∖ {𝑥})) ∈ (Clsd‘𝐽))
111, 9, 10syl2an 597 . . . . . . . . . 10 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → ((cls‘𝐽)‘(𝑆 ∖ {𝑥})) ∈ (Clsd‘𝐽))
1211adantr 480 . . . . . . . . 9 (((𝐽 ∈ Fre ∧ 𝑆𝑋) ∧ 𝑥𝑋) → ((cls‘𝐽)‘(𝑆 ∖ {𝑥})) ∈ (Clsd‘𝐽))
132t1sncld 23301 . . . . . . . . . . . . 13 ((𝐽 ∈ Fre ∧ 𝑥𝑋) → {𝑥} ∈ (Clsd‘𝐽))
1413adantlr 716 . . . . . . . . . . . 12 (((𝐽 ∈ Fre ∧ 𝑆𝑋) ∧ 𝑥𝑋) → {𝑥} ∈ (Clsd‘𝐽))
15 uncld 23016 . . . . . . . . . . . 12 (({𝑥} ∈ (Clsd‘𝐽) ∧ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})) ∈ (Clsd‘𝐽)) → ({𝑥} ∪ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))) ∈ (Clsd‘𝐽))
1614, 12, 15syl2anc 585 . . . . . . . . . . 11 (((𝐽 ∈ Fre ∧ 𝑆𝑋) ∧ 𝑥𝑋) → ({𝑥} ∪ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))) ∈ (Clsd‘𝐽))
172sscls 23031 . . . . . . . . . . . . . 14 ((𝐽 ∈ Top ∧ (𝑆 ∖ {𝑥}) ⊆ 𝑋) → (𝑆 ∖ {𝑥}) ⊆ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))
181, 9, 17syl2an 597 . . . . . . . . . . . . 13 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑆 ∖ {𝑥}) ⊆ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))
19 ssundif 4428 . . . . . . . . . . . . 13 (𝑆 ⊆ ({𝑥} ∪ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))) ↔ (𝑆 ∖ {𝑥}) ⊆ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))
2018, 19sylibr 234 . . . . . . . . . . . 12 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → 𝑆 ⊆ ({𝑥} ∪ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))))
2120adantr 480 . . . . . . . . . . 11 (((𝐽 ∈ Fre ∧ 𝑆𝑋) ∧ 𝑥𝑋) → 𝑆 ⊆ ({𝑥} ∪ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))))
222clsss2 23047 . . . . . . . . . . 11 ((({𝑥} ∪ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))) ∈ (Clsd‘𝐽) ∧ 𝑆 ⊆ ({𝑥} ∪ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))) → ((cls‘𝐽)‘𝑆) ⊆ ({𝑥} ∪ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))))
2316, 21, 22syl2anc 585 . . . . . . . . . 10 (((𝐽 ∈ Fre ∧ 𝑆𝑋) ∧ 𝑥𝑋) → ((cls‘𝐽)‘𝑆) ⊆ ({𝑥} ∪ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))))
24 ssundif 4428 . . . . . . . . . 10 (((cls‘𝐽)‘𝑆) ⊆ ({𝑥} ∪ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))) ↔ (((cls‘𝐽)‘𝑆) ∖ {𝑥}) ⊆ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))
2523, 24sylib 218 . . . . . . . . 9 (((𝐽 ∈ Fre ∧ 𝑆𝑋) ∧ 𝑥𝑋) → (((cls‘𝐽)‘𝑆) ∖ {𝑥}) ⊆ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))
262clsss2 23047 . . . . . . . . 9 ((((cls‘𝐽)‘(𝑆 ∖ {𝑥})) ∈ (Clsd‘𝐽) ∧ (((cls‘𝐽)‘𝑆) ∖ {𝑥}) ⊆ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))) → ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) ⊆ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))
2712, 25, 26syl2anc 585 . . . . . . . 8 (((𝐽 ∈ Fre ∧ 𝑆𝑋) ∧ 𝑥𝑋) → ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) ⊆ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))
2827sseld 3921 . . . . . . 7 (((𝐽 ∈ Fre ∧ 𝑆𝑋) ∧ 𝑥𝑋) → (𝑥 ∈ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) → 𝑥 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))))
2928ex 412 . . . . . 6 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑥𝑋 → (𝑥 ∈ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) → 𝑥 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))))
3029com23 86 . . . . 5 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑥 ∈ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) → (𝑥𝑋𝑥 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))))
318, 30mpdd 43 . . . 4 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑥 ∈ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) → 𝑥 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))))
321adantr 480 . . . . . 6 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → 𝐽 ∈ Top)
331, 3sylan 581 . . . . . . 7 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑋)
3433ssdifssd 4088 . . . . . 6 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (((cls‘𝐽)‘𝑆) ∖ {𝑥}) ⊆ 𝑋)
352sscls 23031 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆))
361, 35sylan 581 . . . . . . 7 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆))
3736ssdifd 4086 . . . . . 6 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑆 ∖ {𝑥}) ⊆ (((cls‘𝐽)‘𝑆) ∖ {𝑥}))
382clsss 23029 . . . . . 6 ((𝐽 ∈ Top ∧ (((cls‘𝐽)‘𝑆) ∖ {𝑥}) ⊆ 𝑋 ∧ (𝑆 ∖ {𝑥}) ⊆ (((cls‘𝐽)‘𝑆) ∖ {𝑥})) → ((cls‘𝐽)‘(𝑆 ∖ {𝑥})) ⊆ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})))
3932, 34, 37, 38syl3anc 1374 . . . . 5 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → ((cls‘𝐽)‘(𝑆 ∖ {𝑥})) ⊆ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})))
4039sseld 3921 . . . 4 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑥 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})) → 𝑥 ∈ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥}))))
4131, 40impbid 212 . . 3 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑥 ∈ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥})) ↔ 𝑥 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))))
422islp 23115 . . . . 5 ((𝐽 ∈ Top ∧ ((cls‘𝐽)‘𝑆) ⊆ 𝑋) → (𝑥 ∈ ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆)) ↔ 𝑥 ∈ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥}))))
433, 42syldan 592 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑥 ∈ ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆)) ↔ 𝑥 ∈ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥}))))
441, 43sylan 581 . . 3 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑥 ∈ ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆)) ↔ 𝑥 ∈ ((cls‘𝐽)‘(((cls‘𝐽)‘𝑆) ∖ {𝑥}))))
452islp 23115 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑥 ∈ ((limPt‘𝐽)‘𝑆) ↔ 𝑥 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))))
461, 45sylan 581 . . 3 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑥 ∈ ((limPt‘𝐽)‘𝑆) ↔ 𝑥 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))))
4741, 44, 463bitr4d 311 . 2 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑥 ∈ ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆)) ↔ 𝑥 ∈ ((limPt‘𝐽)‘𝑆)))
4847eqrdv 2735 1 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆)) = ((limPt‘𝐽)‘𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  cdif 3887  cun 3888  wss 3890  {csn 4568   cuni 4851  cfv 6492  Topctop 22868  Clsdccld 22991  clsccl 22993  limPtclp 23109  Frect1 23282
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 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682
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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-iin 4937  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-top 22869  df-cld 22994  df-cls 22996  df-lp 23111  df-t1 23289
This theorem is referenced by:  perfcls  23340
  Copyright terms: Public domain W3C validator