Theorem pibp19 34698

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

Step	Hyp	Ref	Expression
1		pweq 4555	. . 3 ⊢ (𝑥 = 𝐽 → 𝒫 𝑥 = 𝒫 𝐽)
2		unieq 4849	. . . . . . 7 ⊢ (𝑥 = 𝐽 → ∪ 𝑥 = ∪ 𝐽)
3		pibp19.x	. . . . . . 7 ⊢ 𝑋 = ∪ 𝐽
4	2, 3	syl6eqr 2874	. . . . . 6 ⊢ (𝑥 = 𝐽 → ∪ 𝑥 = 𝑋)
5	4	eqeq1d 2823	. . . . 5 ⊢ (𝑥 = 𝐽 → (∪ 𝑥 = ∪ 𝑦 ↔ 𝑋 = ∪ 𝑦))
6	5	anbi1d 631	. . . 4 ⊢ (𝑥 = 𝐽 → ((∪ 𝑥 = ∪ 𝑦 ∧ 𝑦 ≼ ω) ↔ (𝑋 = ∪ 𝑦 ∧ 𝑦 ≼ ω)))
7	4	eqeq1d 2823	. . . . 5 ⊢ (𝑥 = 𝐽 → (∪ 𝑥 = ∪ 𝑧 ↔ 𝑋 = ∪ 𝑧))
8	7	rexbidv 3297	. . . 4 ⊢ (𝑥 = 𝐽 → (∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝑥 = ∪ 𝑧 ↔ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧))
9	6, 8	imbi12d 347	. . 3 ⊢ (𝑥 = 𝐽 → (((∪ 𝑥 = ∪ 𝑦 ∧ 𝑦 ≼ ω) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝑥 = ∪ 𝑧) ↔ ((𝑋 = ∪ 𝑦 ∧ 𝑦 ≼ ω) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧)))
10	1, 9	raleqbidv 3401	. 2 ⊢ (𝑥 = 𝐽 → (∀𝑦 ∈ 𝒫 𝑥((∪ 𝑥 = ∪ 𝑦 ∧ 𝑦 ≼ ω) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝑥 = ∪ 𝑧) ↔ ∀𝑦 ∈ 𝒫 𝐽((𝑋 = ∪ 𝑦 ∧ 𝑦 ≼ ω) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧)))
11		pibp19.19	. 2 ⊢ 𝐶 = {𝑥 ∈ Top ∣ ∀𝑦 ∈ 𝒫 𝑥((∪ 𝑥 = ∪ 𝑦 ∧ 𝑦 ≼ ω) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝑥 = ∪ 𝑧)}
12	10, 11	elrab2 3683	1 ⊢ (𝐽 ∈ 𝐶 ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽((𝑋 = ∪ 𝑦 ∧ 𝑦 ≼ ω) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧)))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1537   ∈ wcel 2114  ∀wral 3138  ∃wrex 3139  {crab 3142   ∩ cin 3935  𝒫 cpw 4539  ∪ cuni 4838   class class class wbr 5066  ωcom 7580   ≼ cdom 8507  Fincfn 8509  Topctop 21501

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-in 3943  df-ss 3952  df-pw 4541  df-uni 4839

This theorem is referenced by:  pibt1  34700  pibt2  34701