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

Theorem perfcls 23394
Description: A subset of a perfect space is perfect iff its closure is perfect (and the closure is an actual perfect set, since it is both closed and perfect in the subspace topology). (Contributed by Mario Carneiro, 26-Dec-2016.)
Hypothesis
Ref Expression
lpcls.1 𝑋 = 𝐽
Assertion
Ref Expression
perfcls ((𝐽 ∈ Fre ∧ 𝑆𝑋) → ((𝐽t 𝑆) ∈ Perf ↔ (𝐽t ((cls‘𝐽)‘𝑆)) ∈ Perf))

Proof of Theorem perfcls
StepHypRef Expression
1 lpcls.1 . . . . 5 𝑋 = 𝐽
21lpcls 23393 . . . 4 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆)) = ((limPt‘𝐽)‘𝑆))
32sseq2d 4041 . . 3 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (((cls‘𝐽)‘𝑆) ⊆ ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆)) ↔ ((cls‘𝐽)‘𝑆) ⊆ ((limPt‘𝐽)‘𝑆)))
4 t1top 23359 . . . . . 6 (𝐽 ∈ Fre → 𝐽 ∈ Top)
51clslp 23177 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) = (𝑆 ∪ ((limPt‘𝐽)‘𝑆)))
64, 5sylan 579 . . . . 5 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) = (𝑆 ∪ ((limPt‘𝐽)‘𝑆)))
76sseq1d 4040 . . . 4 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (((cls‘𝐽)‘𝑆) ⊆ ((limPt‘𝐽)‘𝑆) ↔ (𝑆 ∪ ((limPt‘𝐽)‘𝑆)) ⊆ ((limPt‘𝐽)‘𝑆)))
8 ssequn1 4209 . . . . 5 (𝑆 ⊆ ((limPt‘𝐽)‘𝑆) ↔ (𝑆 ∪ ((limPt‘𝐽)‘𝑆)) = ((limPt‘𝐽)‘𝑆))
9 ssun2 4202 . . . . . 6 ((limPt‘𝐽)‘𝑆) ⊆ (𝑆 ∪ ((limPt‘𝐽)‘𝑆))
10 eqss 4024 . . . . . 6 ((𝑆 ∪ ((limPt‘𝐽)‘𝑆)) = ((limPt‘𝐽)‘𝑆) ↔ ((𝑆 ∪ ((limPt‘𝐽)‘𝑆)) ⊆ ((limPt‘𝐽)‘𝑆) ∧ ((limPt‘𝐽)‘𝑆) ⊆ (𝑆 ∪ ((limPt‘𝐽)‘𝑆))))
119, 10mpbiran2 709 . . . . 5 ((𝑆 ∪ ((limPt‘𝐽)‘𝑆)) = ((limPt‘𝐽)‘𝑆) ↔ (𝑆 ∪ ((limPt‘𝐽)‘𝑆)) ⊆ ((limPt‘𝐽)‘𝑆))
128, 11bitri 275 . . . 4 (𝑆 ⊆ ((limPt‘𝐽)‘𝑆) ↔ (𝑆 ∪ ((limPt‘𝐽)‘𝑆)) ⊆ ((limPt‘𝐽)‘𝑆))
137, 12bitr4di 289 . . 3 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (((cls‘𝐽)‘𝑆) ⊆ ((limPt‘𝐽)‘𝑆) ↔ 𝑆 ⊆ ((limPt‘𝐽)‘𝑆)))
143, 13bitr2d 280 . 2 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑆 ⊆ ((limPt‘𝐽)‘𝑆) ↔ ((cls‘𝐽)‘𝑆) ⊆ ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆))))
15 eqid 2740 . . . 4 (𝐽t 𝑆) = (𝐽t 𝑆)
161, 15restperf 23213 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((𝐽t 𝑆) ∈ Perf ↔ 𝑆 ⊆ ((limPt‘𝐽)‘𝑆)))
174, 16sylan 579 . 2 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → ((𝐽t 𝑆) ∈ Perf ↔ 𝑆 ⊆ ((limPt‘𝐽)‘𝑆)))
181clsss3 23088 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑋)
19 eqid 2740 . . . . 5 (𝐽t ((cls‘𝐽)‘𝑆)) = (𝐽t ((cls‘𝐽)‘𝑆))
201, 19restperf 23213 . . . 4 ((𝐽 ∈ Top ∧ ((cls‘𝐽)‘𝑆) ⊆ 𝑋) → ((𝐽t ((cls‘𝐽)‘𝑆)) ∈ Perf ↔ ((cls‘𝐽)‘𝑆) ⊆ ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆))))
2118, 20syldan 590 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((𝐽t ((cls‘𝐽)‘𝑆)) ∈ Perf ↔ ((cls‘𝐽)‘𝑆) ⊆ ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆))))
224, 21sylan 579 . 2 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → ((𝐽t ((cls‘𝐽)‘𝑆)) ∈ Perf ↔ ((cls‘𝐽)‘𝑆) ⊆ ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆))))
2314, 17, 223bitr4d 311 1 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → ((𝐽t 𝑆) ∈ Perf ↔ (𝐽t ((cls‘𝐽)‘𝑆)) ∈ Perf))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wcel 2108  cun 3974  wss 3976   cuni 4931  cfv 6573  (class class class)co 7448  t crest 17480  Topctop 22920  clsccl 23047  limPtclp 23163  Perfcperf 23164  Frect1 23336
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-int 4971  df-iun 5017  df-iin 5018  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-ov 7451  df-oprab 7452  df-mpo 7453  df-om 7904  df-1st 8030  df-2nd 8031  df-en 9004  df-fin 9007  df-fi 9480  df-rest 17482  df-topgen 17503  df-top 22921  df-topon 22938  df-bases 22974  df-cld 23048  df-ntr 23049  df-cls 23050  df-nei 23127  df-lp 23165  df-perf 23166  df-t1 23343
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator