Theorem ispcmp 34278

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 3479	. 2 ⊢ (𝐽 ∈ Paracomp → 𝐽 ∈ V)
2		elex 3479	. 2 ⊢ (𝐽 ∈ CovHasRef(LocFin‘𝐽) → 𝐽 ∈ V)
3		id 23	. . . 4 ⊢ (𝑗 = 𝐽 → 𝑗 = 𝐽)
4		fveq2 6888	. . . . 5 ⊢ (𝑗 = 𝐽 → (LocFin‘𝑗) = (LocFin‘𝐽))
5		crefeq 34266	. . . . 5 ⊢ ((LocFin‘𝑗) = (LocFin‘𝐽) → CovHasRef(LocFin‘𝑗) = CovHasRef(LocFin‘𝐽))
6	4, 5	syl 18	. . . 4 ⊢ (𝑗 = 𝐽 → CovHasRef(LocFin‘𝑗) = CovHasRef(LocFin‘𝐽))
7	3, 6	eleq12d 2860	. . 3 ⊢ (𝑗 = 𝐽 → (𝑗 ∈ CovHasRef(LocFin‘𝑗) ↔ 𝐽 ∈ CovHasRef(LocFin‘𝐽)))
8		df-pcmp 34277	. . 3 ⊢ Paracomp = {𝑗 ∣ 𝑗 ∈ CovHasRef(LocFin‘𝑗)}
9	7, 8	elab2g 3642	. 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 1570   ∈ wcel 2146  Vcvv 3458  ‘cfv 6543  LocFinclocfin 23698  CovHasRefccref 34263  Paracompcpcmp 34276

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-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  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-cref 34264  df-pcmp 34277

This theorem is used by:  cmppcmp  34279  dispcmp  34280  pcmplfin  34281