MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  is1stc Structured version   Visualization version   GIF version

Theorem is1stc 22500
Description: The predicate "is a first-countable topology." This can be described as "every point has a countable local basis" - that is, every point has a countable collection of open sets containing it such that every open set containing the point has an open set from this collection as a subset. (Contributed by Jeff Hankins, 22-Aug-2009.)
Hypothesis
Ref Expression
is1stc.1 𝑋 = 𝐽
Assertion
Ref Expression
is1stc (𝐽 ∈ 1stω ↔ (𝐽 ∈ Top ∧ ∀𝑥𝑋𝑦 ∈ 𝒫 𝐽(𝑦 ≼ ω ∧ ∀𝑧𝐽 (𝑥𝑧𝑥 (𝑦 ∩ 𝒫 𝑧)))))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐽   𝑥,𝑋
Allowed substitution hints:   𝑋(𝑦,𝑧)

Proof of Theorem is1stc
Dummy variable 𝑗 is distinct from all other variables.
StepHypRef Expression
1 unieq 4847 . . . 4 (𝑗 = 𝐽 𝑗 = 𝐽)
2 is1stc.1 . . . 4 𝑋 = 𝐽
31, 2eqtr4di 2797 . . 3 (𝑗 = 𝐽 𝑗 = 𝑋)
4 pweq 4546 . . . 4 (𝑗 = 𝐽 → 𝒫 𝑗 = 𝒫 𝐽)
5 raleq 3333 . . . . 5 (𝑗 = 𝐽 → (∀𝑧𝑗 (𝑥𝑧𝑥 (𝑦 ∩ 𝒫 𝑧)) ↔ ∀𝑧𝐽 (𝑥𝑧𝑥 (𝑦 ∩ 𝒫 𝑧))))
65anbi2d 628 . . . 4 (𝑗 = 𝐽 → ((𝑦 ≼ ω ∧ ∀𝑧𝑗 (𝑥𝑧𝑥 (𝑦 ∩ 𝒫 𝑧))) ↔ (𝑦 ≼ ω ∧ ∀𝑧𝐽 (𝑥𝑧𝑥 (𝑦 ∩ 𝒫 𝑧)))))
74, 6rexeqbidv 3328 . . 3 (𝑗 = 𝐽 → (∃𝑦 ∈ 𝒫 𝑗(𝑦 ≼ ω ∧ ∀𝑧𝑗 (𝑥𝑧𝑥 (𝑦 ∩ 𝒫 𝑧))) ↔ ∃𝑦 ∈ 𝒫 𝐽(𝑦 ≼ ω ∧ ∀𝑧𝐽 (𝑥𝑧𝑥 (𝑦 ∩ 𝒫 𝑧)))))
83, 7raleqbidv 3327 . 2 (𝑗 = 𝐽 → (∀𝑥 𝑗𝑦 ∈ 𝒫 𝑗(𝑦 ≼ ω ∧ ∀𝑧𝑗 (𝑥𝑧𝑥 (𝑦 ∩ 𝒫 𝑧))) ↔ ∀𝑥𝑋𝑦 ∈ 𝒫 𝐽(𝑦 ≼ ω ∧ ∀𝑧𝐽 (𝑥𝑧𝑥 (𝑦 ∩ 𝒫 𝑧)))))
9 df-1stc 22498 . 2 1stω = {𝑗 ∈ Top ∣ ∀𝑥 𝑗𝑦 ∈ 𝒫 𝑗(𝑦 ≼ ω ∧ ∀𝑧𝑗 (𝑥𝑧𝑥 (𝑦 ∩ 𝒫 𝑧)))}
108, 9elrab2 3620 1 (𝐽 ∈ 1stω ↔ (𝐽 ∈ Top ∧ ∀𝑥𝑋𝑦 ∈ 𝒫 𝐽(𝑦 ≼ ω ∧ ∀𝑧𝐽 (𝑥𝑧𝑥 (𝑦 ∩ 𝒫 𝑧)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1539  wcel 2108  wral 3063  wrex 3064  cin 3882  𝒫 cpw 4530   cuni 4836   class class class wbr 5070  ωcom 7687  cdom 8689  Topctop 21950  1stωc1stc 22496
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709
This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1542  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-in 3890  df-ss 3900  df-pw 4532  df-uni 4837  df-1stc 22498
This theorem is referenced by:  is1stc2  22501  1stctop  22502
  Copyright terms: Public domain W3C validator