Theorem ispcmp 34536

Description: The predicate "is a paracompact topology". (Contributed by Thierry Arnoux, 7-Jan-2020.)

Assertion

Ref	Expression
ispcmp	⊢ (𝐽 ∈ Paracomp ↔ 𝐽 ∈ CovHasRef(LocFin‘𝐽))

Proof of Theorem ispcmp

Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3471	. 2 ⊢ (𝐽 ∈ Paracomp → 𝐽 ∈ V)
2		elex 3471	. 2 ⊢ (𝐽 ∈ CovHasRef(LocFin‘𝐽) → 𝐽 ∈ V)
3		id 23	. . . 4 ⊢ (𝑗 = 𝐽 → 𝑗 = 𝐽)
4		fveq2 6886	. . . . 5 ⊢ (𝑗 = 𝐽 → (LocFin‘𝑗) = (LocFin‘𝐽))
5		crefeq 34524	. . . . 5 ⊢ ((LocFin‘𝑗) = (LocFin‘𝐽) → CovHasRef(LocFin‘𝑗) = CovHasRef(LocFin‘𝐽))
6	4, 5	syl 18	. . . 4 ⊢ (𝑗 = 𝐽 → CovHasRef(LocFin‘𝑗) = CovHasRef(LocFin‘𝐽))
7	3, 6	eleq12d 2854	. . 3 ⊢ (𝑗 = 𝐽 → (𝑗 ∈ CovHasRef(LocFin‘𝑗) ↔ 𝐽 ∈ CovHasRef(LocFin‘𝐽)))
8		df-pcmp 34535	. . 3 ⊢ Paracomp = {𝑗 ∣ 𝑗 ∈ CovHasRef(LocFin‘𝑗)}
9	7, 8	elab2g 3633	. 2 ⊢ (𝐽 ∈ V → (𝐽 ∈ Paracomp ↔ 𝐽 ∈ CovHasRef(LocFin‘𝐽)))
10	1, 2, 9	pm5.21nii 381	1 ⊢ (𝐽 ∈ Paracomp ↔ 𝐽 ∈ CovHasRef(LocFin‘𝐽))

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1569   ∈ wcel 2144  Vcvv 3450  ‘cfv 6539  LocFinclocfin 23829  CovHasRefccref 34521  Paracompcpcmp 34534

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-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  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-cref 34522  df-pcmp 34535

This theorem is used by:  cmppcmp  34537  dispcmp  34538  pcmplfin  34539