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

Theorem pibp19 37380
Description: Property P000019 of pi-base. The class of countably compact topologies. A space 𝑋 is countably compact if every countable open cover of 𝑋 has a finite subcover. (Contributed by ML, 8-Dec-2020.)
Hypotheses
Ref Expression
pibp19.x 𝑋 = 𝐽
pibp19.19 𝐶 = {𝑥 ∈ Top ∣ ∀𝑦 ∈ 𝒫 𝑥(( 𝑥 = 𝑦𝑦 ≼ ω) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin) 𝑥 = 𝑧)}
Assertion
Ref Expression
pibp19 (𝐽𝐶 ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽((𝑋 = 𝑦𝑦 ≼ ω) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = 𝑧)))
Distinct variable groups:   𝑥,𝐽,𝑦   𝑧,𝐽,𝑥   𝑥,𝑋
Allowed substitution hints:   𝐶(𝑥,𝑦,𝑧)   𝑋(𝑦,𝑧)

Proof of Theorem pibp19
StepHypRef Expression
1 pweq 4636 . . 3 (𝑥 = 𝐽 → 𝒫 𝑥 = 𝒫 𝐽)
2 unieq 4942 . . . . . . 7 (𝑥 = 𝐽 𝑥 = 𝐽)
3 pibp19.x . . . . . . 7 𝑋 = 𝐽
42, 3eqtr4di 2798 . . . . . 6 (𝑥 = 𝐽 𝑥 = 𝑋)
54eqeq1d 2742 . . . . 5 (𝑥 = 𝐽 → ( 𝑥 = 𝑦𝑋 = 𝑦))
65anbi1d 630 . . . 4 (𝑥 = 𝐽 → (( 𝑥 = 𝑦𝑦 ≼ ω) ↔ (𝑋 = 𝑦𝑦 ≼ ω)))
74eqeq1d 2742 . . . . 5 (𝑥 = 𝐽 → ( 𝑥 = 𝑧𝑋 = 𝑧))
87rexbidv 3185 . . . 4 (𝑥 = 𝐽 → (∃𝑧 ∈ (𝒫 𝑦 ∩ Fin) 𝑥 = 𝑧 ↔ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = 𝑧))
96, 8imbi12d 344 . . 3 (𝑥 = 𝐽 → ((( 𝑥 = 𝑦𝑦 ≼ ω) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin) 𝑥 = 𝑧) ↔ ((𝑋 = 𝑦𝑦 ≼ ω) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = 𝑧)))
101, 9raleqbidv 3354 . 2 (𝑥 = 𝐽 → (∀𝑦 ∈ 𝒫 𝑥(( 𝑥 = 𝑦𝑦 ≼ ω) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin) 𝑥 = 𝑧) ↔ ∀𝑦 ∈ 𝒫 𝐽((𝑋 = 𝑦𝑦 ≼ ω) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = 𝑧)))
11 pibp19.19 . 2 𝐶 = {𝑥 ∈ Top ∣ ∀𝑦 ∈ 𝒫 𝑥(( 𝑥 = 𝑦𝑦 ≼ ω) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin) 𝑥 = 𝑧)}
1210, 11elrab2 3711 1 (𝐽𝐶 ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽((𝑋 = 𝑦𝑦 ≼ ω) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = 𝑧)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wcel 2108  wral 3067  wrex 3076  {crab 3443  cin 3975  𝒫 cpw 4622   cuni 4931   class class class wbr 5166  ωcom 7903  cdom 9001  Fincfn 9003  Topctop 22920
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1540  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-ss 3993  df-pw 4624  df-uni 4932
This theorem is referenced by:  pibt1  37382  pibt2  37383
  Copyright terms: Public domain W3C validator