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 38606
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 4883 . . . . . 6 (𝑥 = 𝐽 → ∪ 𝑥 = ∪ 𝐽)
2 pibp21.x . . . . . 6 𝑋 = ∪ 𝐽
31, 2eqtr4di 2816 . . . . 5 (𝑥 = 𝐽 → ∪ 𝑥 = 𝑋)
43pweqd 4577 . . . 4 (𝑥 = 𝐽 → 𝒫 ∪ 𝑥 = 𝒫 𝑋)
54difeq1d 4065 . . 3 (𝑥 = 𝐽 → (𝒫 ∪ 𝑥 ∖ Fin) = (𝒫 𝑋 ∖ Fin))
6 fveq2 6916 . . . . . 6 (𝑥 = 𝐽 → (limPt‘𝑥) = (limPt‘𝐽))
76fveq1d 6918 . . . . 5 (𝑥 = 𝐽 → ((limPt‘𝑥)‘𝑦) = ((limPt‘𝐽)‘𝑦))
87eleq2d 2850 . . . 4 (𝑥 = 𝐽 → (𝑧 ∈ ((limPt‘𝑥)‘𝑦) ↔ 𝑧 ∈ ((limPt‘𝐽)‘𝑦)))
93, 8rexeqbidv 3339 . . 3 (𝑥 = 𝐽 → (∃𝑧 ∈ ∪ 𝑥𝑧 ∈ ((limPt‘𝑥)‘𝑦) ↔ ∃𝑧 ∈ 𝑋 𝑧 ∈ ((limPt‘𝐽)‘𝑦)))
105, 9raleqbidv 3338 . 2 (𝑥 = 𝐽 → (∀𝑦 ∈ (𝒫 ∪ 𝑥 ∖ Fin)∃𝑧 ∈ ∪ 𝑥𝑧 ∈ ((limPt‘𝑥)‘𝑦) ↔ ∀𝑦 ∈ (𝒫 𝑋 ∖ Fin)∃𝑧 ∈ 𝑋 𝑧 ∈ ((limPt‘𝐽)‘𝑦)))
11 pibp21.21 . 2 𝑊 = {𝑥 ∈ Top ∣ ∀𝑦 ∈ (𝒫 ∪ 𝑥 ∖ Fin)∃𝑧 ∈ ∪ 𝑥𝑧 ∈ ((limPt‘𝑥)‘𝑦)}
1210, 11elrab2 3652 1 (𝐽 ∈ 𝑊 ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ (𝒫 𝑋 ∖ Fin)∃𝑧 ∈ 𝑋 𝑧 ∈ ((limPt‘𝐽)‘𝑦)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  {crab 3416   ∖ cdif 4048  𝒫 cpw 4560  ∪ cuni 4872  ‘cfv 6566  Fincfn 9011  Topctop 23266  limPtclp 23507
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-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-iota 6520  df-fv 6574
This theorem is used by:  pibt2  38608
  Copyright terms: Public domain W3C validator