Theorem isperf 23475

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 6886	. . . 4 ⊢ (𝑗 = 𝐽 → (limPt‘𝑗) = (limPt‘𝐽))
2		unieq 4877	. . . . 5 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = ∪ 𝐽)
3		lpfval.1	. . . . 5 ⊢ 𝑋 = ∪ 𝐽
4	2, 3	eqtr4di 2813	. . . 4 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = 𝑋)
5	1, 4	fveq12d 6893	. . 3 ⊢ (𝑗 = 𝐽 → ((limPt‘𝑗)‘∪ 𝑗) = ((limPt‘𝐽)‘𝑋))
6	5, 4	eqeq12d 2776	. 2 ⊢ (𝑗 = 𝐽 → (((limPt‘𝑗)‘∪ 𝑗) = ∪ 𝑗 ↔ ((limPt‘𝐽)‘𝑋) = 𝑋))
7		df-perf 23461	. 2 ⊢ Perf = {𝑗 ∈ Top ∣ ((limPt‘𝑗)‘∪ 𝑗) = ∪ 𝑗}
8	6, 7	elrab2 3648	1 ⊢ (𝐽 ∈ Perf ↔ (𝐽 ∈ Top ∧ ((limPt‘𝐽)‘𝑋) = 𝑋))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∪ cuni 4866  ‘cfv 6539  Topctop 23217  limPtclp 23458  Perfcperf 23459

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-iota 6494  df-fv 6547  df-perf 23461

This theorem is used by:  isperf2  23476  perflp  23478  perftop  23480  restperf  23508