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

Theorem is2ndc 23757
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 23751 . . 3 2ndω = {𝑗 ∣ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝑗)}
21eleq2i 2853 . 2 (𝐽 ∈ 2ndω ↔ 𝐽 ∈ {𝑗 ∣ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝑗)})
3 simpr 490 . . . . 5 ((𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽) → (topGen‘𝑥) = 𝐽)
4 fvex 6896 . . . . 5 (topGen‘𝑥) ∈ V
53, 4eqeltrrdi 2870 . . . 4 ((𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽) → 𝐽 ∈ V)
65rexlimivw 3160 . . 3 (∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽) → 𝐽 ∈ V)
7 eqeq2 2773 . . . . 5 (𝑗 = 𝐽 → ((topGen‘𝑥) = 𝑗 ↔ (topGen‘𝑥) = 𝐽))
87anbi2d 642 . . . 4 (𝑗 = 𝐽 → ((𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝑗) ↔ (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽)))
98rexbidv 3187 . . 3 (𝑗 = 𝐽 → (∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝑗) ↔ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽)))
106, 9elab3 3640 . 2 (𝐽 ∈ {𝑗 ∣ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝑗)} ↔ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽))
112, 10bitri 278 1 (𝐽 ∈ 2ndω ↔ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2739  ∃wrex 3087  Vcvv 3451   class class class wbr 5103  ‘cfv 6537  ωcom 7875   ≼ cdom 8964  topGenctg 17601  TopBasesctb 23256  2ndωc2ndc 23749
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-nul 5260
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-rex 3088  df-v 3453  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-sn 4585  df-pr 4587  df-uni 4868  df-iota 6493  df-fv 6545  df-2ndc 23751
This theorem is used by:  2ndctop  23758  2ndci  23759  2ndcsb  23760  2ndcredom  23761  2ndc1stc  23762  2ndcrest  23765  2ndcctbss  23767  2ndcdisj  23768  2ndcomap  23770  2ndcsep  23771  dis2ndc  23772  tx2ndc  23963
  Copyright terms: Public domain W3C validator