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

Theorem is1stc 23598
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 4883 . . . 4 (𝑗 = 𝐽 𝑗 = 𝐽)
2 is1stc.1 . . . 4 𝑋 = 𝐽
31, 2eqtr4di 2816 . . 3 (𝑗 = 𝐽 𝑗 = 𝑋)
4 pweq 4576 . . . 4 (𝑗 = 𝐽 → 𝒫 𝑗 = 𝒫 𝐽)
5 raleq 3320 . . . . 5 (𝑗 = 𝐽 → (∀𝑧𝑗 (𝑥𝑧𝑥 (𝑦 ∩ 𝒫 𝑧)) ↔ ∀𝑧𝐽 (𝑥𝑧𝑥 (𝑦 ∩ 𝒫 𝑧))))
65anbi2d 641 . . . 4 (𝑗 = 𝐽 → ((𝑦 ≼ ω ∧ ∀𝑧𝑗 (𝑥𝑧𝑥 (𝑦 ∩ 𝒫 𝑧))) ↔ (𝑦 ≼ ω ∧ ∀𝑧𝐽 (𝑥𝑧𝑥 (𝑦 ∩ 𝒫 𝑧)))))
74, 6rexeqbidv 3339 . . 3 (𝑗 = 𝐽 → (∃𝑦 ∈ 𝒫 𝑗(𝑦 ≼ ω ∧ ∀𝑧𝑗 (𝑥𝑧𝑥 (𝑦 ∩ 𝒫 𝑧))) ↔ ∃𝑦 ∈ 𝒫 𝐽(𝑦 ≼ ω ∧ ∀𝑧𝐽 (𝑥𝑧𝑥 (𝑦 ∩ 𝒫 𝑧)))))
83, 7raleqbidv 3338 . 2 (𝑗 = 𝐽 → (∀𝑥 𝑗𝑦 ∈ 𝒫 𝑗(𝑦 ≼ ω ∧ ∀𝑧𝑗 (𝑥𝑧𝑥 (𝑦 ∩ 𝒫 𝑧))) ↔ ∀𝑥𝑋𝑦 ∈ 𝒫 𝐽(𝑦 ≼ ω ∧ ∀𝑧𝐽 (𝑥𝑧𝑥 (𝑦 ∩ 𝒫 𝑧)))))
9 df-1stc 23596 . 2 1stω = {𝑗 ∈ Top ∣ ∀𝑥 𝑗𝑦 ∈ 𝒫 𝑗(𝑦 ≼ ω ∧ ∀𝑧𝑗 (𝑥𝑧𝑥 (𝑦 ∩ 𝒫 𝑧)))}
108, 9elrab2 3654 1 (𝐽 ∈ 1stω ↔ (𝐽 ∈ Top ∧ ∀𝑥𝑋𝑦 ∈ 𝒫 𝐽(𝑦 ≼ ω ∧ ∀𝑧𝐽 (𝑥𝑧𝑥 (𝑦 ∩ 𝒫 𝑧)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1570  wcel 2143  wral 3079  wrex 3089  cin 3904  𝒫 cpw 4562   cuni 4872   class class class wbr 5109  ωcom 7858  cdom 8937  Topctop 23050  1stωc1stc 23594
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735
This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1573  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-ss 3922  df-pw 4564  df-uni 4873  df-1stc 23596
This theorem is referenced by:  is1stc2  23599  1stctop  23600
  Copyright terms: Public domain W3C validator