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

Theorem perfcls 22516
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 22515 . . . 4 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆)) = ((limPt‘𝐽)‘𝑆))
32sseq2d 3953 . . 3 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (((cls‘𝐽)‘𝑆) ⊆ ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆)) ↔ ((cls‘𝐽)‘𝑆) ⊆ ((limPt‘𝐽)‘𝑆)))
4 t1top 22481 . . . . . 6 (𝐽 ∈ Fre → 𝐽 ∈ Top)
51clslp 22299 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) = (𝑆 ∪ ((limPt‘𝐽)‘𝑆)))
64, 5sylan 580 . . . . 5 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) = (𝑆 ∪ ((limPt‘𝐽)‘𝑆)))
76sseq1d 3952 . . . 4 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (((cls‘𝐽)‘𝑆) ⊆ ((limPt‘𝐽)‘𝑆) ↔ (𝑆 ∪ ((limPt‘𝐽)‘𝑆)) ⊆ ((limPt‘𝐽)‘𝑆)))
8 ssequn1 4114 . . . . 5 (𝑆 ⊆ ((limPt‘𝐽)‘𝑆) ↔ (𝑆 ∪ ((limPt‘𝐽)‘𝑆)) = ((limPt‘𝐽)‘𝑆))
9 ssun2 4107 . . . . . 6 ((limPt‘𝐽)‘𝑆) ⊆ (𝑆 ∪ ((limPt‘𝐽)‘𝑆))
10 eqss 3936 . . . . . 6 ((𝑆 ∪ ((limPt‘𝐽)‘𝑆)) = ((limPt‘𝐽)‘𝑆) ↔ ((𝑆 ∪ ((limPt‘𝐽)‘𝑆)) ⊆ ((limPt‘𝐽)‘𝑆) ∧ ((limPt‘𝐽)‘𝑆) ⊆ (𝑆 ∪ ((limPt‘𝐽)‘𝑆))))
119, 10mpbiran2 707 . . . . 5 ((𝑆 ∪ ((limPt‘𝐽)‘𝑆)) = ((limPt‘𝐽)‘𝑆) ↔ (𝑆 ∪ ((limPt‘𝐽)‘𝑆)) ⊆ ((limPt‘𝐽)‘𝑆))
128, 11bitri 274 . . . 4 (𝑆 ⊆ ((limPt‘𝐽)‘𝑆) ↔ (𝑆 ∪ ((limPt‘𝐽)‘𝑆)) ⊆ ((limPt‘𝐽)‘𝑆))
137, 12bitr4di 289 . . 3 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (((cls‘𝐽)‘𝑆) ⊆ ((limPt‘𝐽)‘𝑆) ↔ 𝑆 ⊆ ((limPt‘𝐽)‘𝑆)))
143, 13bitr2d 279 . 2 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → (𝑆 ⊆ ((limPt‘𝐽)‘𝑆) ↔ ((cls‘𝐽)‘𝑆) ⊆ ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆))))
15 eqid 2738 . . . 4 (𝐽t 𝑆) = (𝐽t 𝑆)
161, 15restperf 22335 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((𝐽t 𝑆) ∈ Perf ↔ 𝑆 ⊆ ((limPt‘𝐽)‘𝑆)))
174, 16sylan 580 . 2 ((𝐽 ∈ Fre ∧ 𝑆𝑋) → ((𝐽t 𝑆) ∈ Perf ↔ 𝑆 ⊆ ((limPt‘𝐽)‘𝑆)))
181clsss3 22210 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑋)
19 eqid 2738 . . . . 5 (𝐽t ((cls‘𝐽)‘𝑆)) = (𝐽t ((cls‘𝐽)‘𝑆))
201, 19restperf 22335 . . . 4 ((𝐽 ∈ Top ∧ ((cls‘𝐽)‘𝑆) ⊆ 𝑋) → ((𝐽t ((cls‘𝐽)‘𝑆)) ∈ Perf ↔ ((cls‘𝐽)‘𝑆) ⊆ ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆))))
2118, 20syldan 591 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((𝐽t ((cls‘𝐽)‘𝑆)) ∈ Perf ↔ ((cls‘𝐽)‘𝑆) ⊆ ((limPt‘𝐽)‘((cls‘𝐽)‘𝑆))))
224, 21sylan 580 . 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 205  wa 396   = wceq 1539  wcel 2106  cun 3885  wss 3887   cuni 4839  cfv 6433  (class class class)co 7275  t crest 17131  Topctop 22042  clsccl 22169  limPtclp 22285  Perfcperf 22286  Frect1 22458
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-iun 4926  df-iin 4927  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-1st 7831  df-2nd 7832  df-en 8734  df-fin 8737  df-fi 9170  df-rest 17133  df-topgen 17154  df-top 22043  df-topon 22060  df-bases 22096  df-cld 22170  df-ntr 22171  df-cls 22172  df-nei 22249  df-lp 22287  df-perf 22288  df-t1 22465
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator