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

Theorem isperf 23269
Description: Definition of a perfect space. (Contributed by Mario Carneiro, 24-Dec-2016.)
Hypothesis
Ref Expression
lpfval.1 𝑋 = 𝐽
Assertion
Ref Expression
isperf (𝐽 ∈ Perf ↔ (𝐽 ∈ Top ∧ ((limPt‘𝐽)‘𝑋) = 𝑋))

Proof of Theorem isperf
Dummy variable 𝑗 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6871 . . . 4 (𝑗 = 𝐽 → (limPt‘𝑗) = (limPt‘𝐽))
2 unieq 4879 . . . . 5 (𝑗 = 𝐽 𝑗 = 𝐽)
3 lpfval.1 . . . . 5 𝑋 = 𝐽
42, 3eqtr4di 2818 . . . 4 (𝑗 = 𝐽 𝑗 = 𝑋)
51, 4fveq12d 6878 . . 3 (𝑗 = 𝐽 → ((limPt‘𝑗)‘ 𝑗) = ((limPt‘𝐽)‘𝑋))
65, 4eqeq12d 2781 . 2 (𝑗 = 𝐽 → (((limPt‘𝑗)‘ 𝑗) = 𝑗 ↔ ((limPt‘𝐽)‘𝑋) = 𝑋))
7 df-perf 23255 . 2 Perf = {𝑗 ∈ Top ∣ ((limPt‘𝑗)‘ 𝑗) = 𝑗}
86, 7elrab2 3657 1 (𝐽 ∈ Perf ↔ (𝐽 ∈ Top ∧ ((limPt‘𝐽)‘𝑋) = 𝑋))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 400   = wceq 1563  wcel 2145   cuni 4868  cfv 6525  Topctop 23011  limPtclp 23252  Perfcperf 23253
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-iota 6481  df-fv 6533  df-perf 23255
This theorem is referenced by:  isperf2  23270  perflp  23272  perftop  23274  restperf  23302
  Copyright terms: Public domain W3C validator