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 34572
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 3475 . 2 (𝐽 ∈ Paracomp → 𝐽 ∈ V)
2 elex 3475 . 2 (𝐽 ∈ CovHasRef(LocFin‘𝐽) → 𝐽 ∈ V)
3 id 23 . . . 4 (𝑗 = 𝐽 → 𝑗 = 𝐽)
4 fveq2 6911 . . . . 5 (𝑗 = 𝐽 → (LocFin‘𝑗) = (LocFin‘𝐽))
5 crefeq 34560 . . . . 5 ((LocFin‘𝑗) = (LocFin‘𝐽) → CovHasRef(LocFin‘𝑗) = CovHasRef(LocFin‘𝐽))
64, 5syl 18 . . . 4 (𝑗 = 𝐽 → CovHasRef(LocFin‘𝑗) = CovHasRef(LocFin‘𝐽))
73, 6eleq12d 2858 . . 3 (𝑗 = 𝐽 → (𝑗 ∈ CovHasRef(LocFin‘𝑗) ↔ 𝐽 ∈ CovHasRef(LocFin‘𝐽)))
8 df-pcmp 34571 . . 3 Paracomp = {𝑗 ∣ 𝑗 ∈ CovHasRef(LocFin‘𝑗)}
97, 8elab2g 3637 . 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 2147  Vcvv 3454  ‘cfv 6561  LocFinclocfin 23856  CovHasRefccref 34557  Paracompcpcmp 34570
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-iota 6515  df-fv 6569  df-cref 34558  df-pcmp 34571
This theorem is used by:  cmppcmp  34573  dispcmp  34574  pcmplfin  34575
  Copyright terms: Public domain W3C validator