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

Theorem is2ndc 23571
Description: The property of being second-countable. (Contributed by Jeff Hankins, 17-Jan-2010.) (Revised by Mario Carneiro, 21-Mar-2015.)
Assertion
Ref Expression
is2ndc (𝐽 ∈ 2ndω ↔ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽))
Distinct variable group:   𝑥,𝐽

Proof of Theorem is2ndc
Dummy variable 𝑗 is distinct from all other variables.
StepHypRef Expression
1 df-2ndc 23565 . . 3 2ndω = {𝑗 ∣ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝑗)}
21eleq2i 2861 . 2 (𝐽 ∈ 2ndω ↔ 𝐽 ∈ {𝑗 ∣ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝑗)})
3 simpr 489 . . . . 5 ((𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽) → (topGen‘𝑥) = 𝐽)
4 fvex 6895 . . . . 5 (topGen‘𝑥) ∈ V
53, 4eqeltrrdi 2878 . . . 4 ((𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽) → 𝐽 ∈ V)
65rexlimivw 3168 . . 3 (∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽) → 𝐽 ∈ V)
7 eqeq2 2781 . . . . 5 (𝑗 = 𝐽 → ((topGen‘𝑥) = 𝑗 ↔ (topGen‘𝑥) = 𝐽))
87anbi2d 641 . . . 4 (𝑗 = 𝐽 → ((𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝑗) ↔ (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽)))
98rexbidv 3195 . . 3 (𝑗 = 𝐽 → (∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝑗) ↔ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽)))
106, 9elab3 3654 . 2 (𝐽 ∈ {𝑗 ∣ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝑗)} ↔ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽))
112, 10bitri 278 1 (𝐽 ∈ 2ndω ↔ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 400   = wceq 1567  wcel 2149  {cab 2747  wrex 3095  Vcvv 3463   class class class wbr 5113  cfv 6537  ωcom 7861  cdom 8940  topGenctg 17489  TopBasesctb 23070  2ndωc2ndc 23563
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-nul 5271
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ne 2965  df-rex 3096  df-v 3465  df-dif 3916  df-un 3918  df-ss 3930  df-nul 4295  df-sn 4595  df-pr 4597  df-uni 4877  df-iota 6493  df-fv 6545  df-2ndc 23565
This theorem is referenced by:  2ndctop  23572  2ndci  23573  2ndcsb  23574  2ndcredom  23575  2ndc1stc  23576  2ndcrest  23579  2ndcctbss  23580  2ndcdisj  23581  2ndcomap  23583  2ndcsep  23584  dis2ndc  23585  tx2ndc  23776
  Copyright terms: Public domain W3C validator