Theorem isperf 23345

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.

Step	Hyp	Ref	Expression
1		fveq2 6888	. . . 4 ⊢ (𝑗 = 𝐽 → (limPt‘𝑗) = (limPt‘𝐽))
2		unieq 4888	. . . . 5 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = ∪ 𝐽)
3		lpfval.1	. . . . 5 ⊢ 𝑋 = ∪ 𝐽
4	2, 3	eqtr4di 2819	. . . 4 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = 𝑋)
5	1, 4	fveq12d 6895	. . 3 ⊢ (𝑗 = 𝐽 → ((limPt‘𝑗)‘∪ 𝑗) = ((limPt‘𝐽)‘𝑋))
6	5, 4	eqeq12d 2782	. 2 ⊢ (𝑗 = 𝐽 → (((limPt‘𝑗)‘∪ 𝑗) = ∪ 𝑗 ↔ ((limPt‘𝐽)‘𝑋) = 𝑋))
7		df-perf 23331	. 2 ⊢ Perf = {𝑗 ∈ Top ∣ ((limPt‘𝑗)‘∪ 𝑗) = ∪ 𝑗}
8	6, 7	elrab2 3657	1 ⊢ (𝐽 ∈ Perf ↔ (𝐽 ∈ Top ∧ ((limPt‘𝐽)‘𝑋) = 𝑋))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∪ cuni 4877  ‘cfv 6543  Topctop 23087  limPtclp 23328  Perfcperf 23329

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-iota 6499  df-fv 6551  df-perf 23331

This theorem is used by:  isperf2  23346  perflp  23348  perftop  23350  restperf  23378