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

Theorem pibp21 38478
Description: Property P000021 of pi-base. The class of weakly countably compact topologies, or limit point compact topologies. A space 𝑋 is weakly countably compact if every infinite subset of 𝑋 has a limit point. (Contributed by ML, 9-Dec-2020.)
Hypotheses
Ref Expression
pibp21.x 𝑋 = ∪ 𝐽
pibp21.21 𝑊 = {𝑥 ∈ Top ∣ ∀𝑦 ∈ (𝒫 ∪ 𝑥 ∖ Fin)∃𝑧 ∈ ∪ 𝑥𝑧 ∈ ((limPt‘𝑥)‘𝑦)}
Assertion
Ref Expression
pibp21 (𝐽 ∈ 𝑊 ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ (𝒫 𝑋 ∖ Fin)∃𝑧 ∈ 𝑋 𝑧 ∈ ((limPt‘𝐽)‘𝑦)))
Distinct variable groups:   𝑥,𝐽,𝑦   𝑧,𝐽,𝑥   𝑥,𝑋,𝑦   𝑧,𝑋
Allowed substitution hints:   𝑊(𝑥, 𝑦, 𝑧)

Proof of Theorem pibp21
StepHypRef Expression
1 unieq 4880 . . . . . 6 (𝑥 = 𝐽 → ∪ 𝑥 = ∪ 𝐽)
2 pibp21.x . . . . . 6 𝑋 = ∪ 𝐽
31, 2eqtr4di 2816 . . . . 5 (𝑥 = 𝐽 → ∪ 𝑥 = 𝑋)
43pweqd 4576 . . . 4 (𝑥 = 𝐽 → 𝒫 ∪ 𝑥 = 𝒫 𝑋)
54difeq1d 4064 . . 3 (𝑥 = 𝐽 → (𝒫 ∪ 𝑥 ∖ Fin) = (𝒫 𝑋 ∖ Fin))
6 fveq2 6893 . . . . . 6 (𝑥 = 𝐽 → (limPt‘𝑥) = (limPt‘𝐽))
76fveq1d 6895 . . . . 5 (𝑥 = 𝐽 → ((limPt‘𝑥)‘𝑦) = ((limPt‘𝐽)‘𝑦))
87eleq2d 2849 . . . 4 (𝑥 = 𝐽 → (𝑧 ∈ ((limPt‘𝑥)‘𝑦) ↔ 𝑧 ∈ ((limPt‘𝐽)‘𝑦)))
93, 8rexeqbidv 3338 . . 3 (𝑥 = 𝐽 → (∃𝑧 ∈ ∪ 𝑥𝑧 ∈ ((limPt‘𝑥)‘𝑦) ↔ ∃𝑧 ∈ 𝑋 𝑧 ∈ ((limPt‘𝐽)‘𝑦)))
105, 9raleqbidv 3337 . 2 (𝑥 = 𝐽 → (∀𝑦 ∈ (𝒫 ∪ 𝑥 ∖ Fin)∃𝑧 ∈ ∪ 𝑥𝑧 ∈ ((limPt‘𝑥)‘𝑦) ↔ ∀𝑦 ∈ (𝒫 𝑋 ∖ Fin)∃𝑧 ∈ 𝑋 𝑧 ∈ ((limPt‘𝐽)‘𝑦)))
11 pibp21.21 . 2 𝑊 = {𝑥 ∈ Top ∣ ∀𝑦 ∈ (𝒫 ∪ 𝑥 ∖ Fin)∃𝑧 ∈ ∪ 𝑥𝑧 ∈ ((limPt‘𝑥)‘𝑦)}
1210, 11elrab2 3651 1 (𝐽 ∈ 𝑊 ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ (𝒫 𝑋 ∖ Fin)∃𝑧 ∈ 𝑋 𝑧 ∈ ((limPt‘𝐽)‘𝑦)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2146  ∀wral 3079  ∃wrex 3089  {crab 3415   ∖ cdif 4047  𝒫 cpw 4559  ∪ cuni 4869  ‘cfv 6546  Fincfn 8984  Topctop 23223  limPtclp 23464
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-or 862  df-3an 1105  df-tru 1572  df-fal 1582  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-dif 4049  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-br 5106  df-iota 6500  df-fv 6554
This theorem is used by:  pibt2  38480
  Copyright terms: Public domain W3C validator