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 38477
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 4573 . . 3 (𝑥 = 𝐽 → 𝒫 𝑥 = 𝒫 𝐽)
2 unieq 4880 . . . . . . 7 (𝑥 = 𝐽 → ∪ 𝑥 = ∪ 𝐽)
3 pibp19.x . . . . . . 7 𝑋 = ∪ 𝐽
42, 3eqtr4di 2816 . . . . . 6 (𝑥 = 𝐽 → ∪ 𝑥 = 𝑋)
54eqeq1d 2765 . . . . 5 (𝑥 = 𝐽 → (∪ 𝑥 = ∪ 𝑦 ↔ 𝑋 = ∪ 𝑦))
65anbi1d 643 . . . 4 (𝑥 = 𝐽 → ((∪ 𝑥 = ∪ 𝑦 ∧ 𝑦 ≼ ω) ↔ (𝑋 = ∪ 𝑦 ∧ 𝑦 ≼ ω)))
74eqeq1d 2765 . . . . 5 (𝑥 = 𝐽 → (∪ 𝑥 = ∪ 𝑧 ↔ 𝑋 = ∪ 𝑧))
87rexbidv 3189 . . . 4 (𝑥 = 𝐽 → (∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝑥 = ∪ 𝑧 ↔ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧))
96, 8imbi12d 347 . . 3 (𝑥 = 𝐽 → (((∪ 𝑥 = ∪ 𝑦 ∧ 𝑦 ≼ ω) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝑥 = ∪ 𝑧) ↔ ((𝑋 = ∪ 𝑦 ∧ 𝑦 ≼ ω) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧)))
101, 9raleqbidv 3337 . 2 (𝑥 = 𝐽 → (∀𝑦 ∈ 𝒫 𝑥((∪ 𝑥 = ∪ 𝑦 ∧ 𝑦 ≼ ω) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝑥 = ∪ 𝑧) ↔ ∀𝑦 ∈ 𝒫 𝐽((𝑋 = ∪ 𝑦 ∧ 𝑦 ≼ ω) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧)))
11 pibp19.19 . 2 𝐶 = {𝑥 ∈ Top ∣ ∀𝑦 ∈ 𝒫 𝑥((∪ 𝑥 = ∪ 𝑦 ∧ 𝑦 ≼ ω) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝑥 = ∪ 𝑧)}
1210, 11elrab2 3651 1 (𝐽 ∈ 𝐶 ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽((𝑋 = ∪ 𝑦 ∧ 𝑦 ≼ ω) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2146  ∀wral 3079  ∃wrex 3089  {crab 3415   ∩ cin 4091  𝒫 cpw 4559  ∪ cuni 4869   class class class wbr 5105  ωcom 7884   ≼ cdom 8982  Fincfn 8984  Topctop 23223
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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-ss 3900  df-pw 4561  df-uni 4870
This theorem is used by:  pibt1  38479  pibt2  38480
  Copyright terms: Public domain W3C validator