Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ispcmp Structured version   Visualization version   GIF version

Theorem ispcmp 34471
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.
StepHypRef Expression
1 elex 3472 . 2 (𝐽 ∈ Paracomp → 𝐽 ∈ V)
2 elex 3472 . 2 (𝐽 ∈ CovHasRef(LocFin‘𝐽) → 𝐽 ∈ V)
3 id 23 . . . 4 (𝑗 = 𝐽 → 𝑗 = 𝐽)
4 fveq2 6877 . . . . 5 (𝑗 = 𝐽 → (LocFin‘𝑗) = (LocFin‘𝐽))
5 crefeq 34459 . . . . 5 ((LocFin‘𝑗) = (LocFin‘𝐽) → CovHasRef(LocFin‘𝑗) = CovHasRef(LocFin‘𝐽))
64, 5syl 18 . . . 4 (𝑗 = 𝐽 → CovHasRef(LocFin‘𝑗) = CovHasRef(LocFin‘𝐽))
73, 6eleq12d 2855 . . 3 (𝑗 = 𝐽 → (𝑗 ∈ CovHasRef(LocFin‘𝑗) ↔ 𝐽 ∈ CovHasRef(LocFin‘𝐽)))
8 df-pcmp 34470 . . 3 Paracomp = {𝑗 ∣ 𝑗 ∈ CovHasRef(LocFin‘𝑗)}
97, 8elab2g 3634 . 2 (𝐽 ∈ V → (𝐽 ∈ Paracomp ↔ 𝐽 ∈ CovHasRef(LocFin‘𝐽)))
101, 2, 9pm5.21nii 381 1 (𝐽 ∈ Paracomp ↔ 𝐽 ∈ CovHasRef(LocFin‘𝐽))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570   ∈ wcel 2145  Vcvv 3451  ‘cfv 6531  LocFinclocfin 23803  CovHasRefccref 34456  Paracompcpcmp 34469
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 2147  ax-9 2155  ax-ext 2733
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 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-iota 6487  df-fv 6539  df-cref 34457  df-pcmp 34470
This theorem is used by:  cmppcmp  34472  dispcmp  34473  pcmplfin  34474
  Copyright terms: Public domain W3C validator