MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  2ndci Structured version   Visualization version   Unicode version

Theorem 2ndci 21251
Description: A countable basis generates a second-countable topology. (Contributed by Mario Carneiro, 21-Mar-2015.)
Assertion
Ref Expression
2ndci  |-  ( ( B  e.  TopBases  /\  B  ~<_  om )  ->  ( topGen `  B )  e.  2ndc )

Proof of Theorem 2ndci
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 simpl 473 . . 3  |-  ( ( B  e.  TopBases  /\  B  ~<_  om )  ->  B  e.  TopBases )
2 simpr 477 . . 3  |-  ( ( B  e.  TopBases  /\  B  ~<_  om )  ->  B  ~<_  om )
3 eqidd 2623 . . 3  |-  ( ( B  e.  TopBases  /\  B  ~<_  om )  ->  ( topGen `  B )  =  (
topGen `  B ) )
4 breq1 4656 . . . . 5  |-  ( x  =  B  ->  (
x  ~<_  om  <->  B  ~<_  om )
)
5 fveq2 6191 . . . . . 6  |-  ( x  =  B  ->  ( topGen `
 x )  =  ( topGen `  B )
)
65eqeq1d 2624 . . . . 5  |-  ( x  =  B  ->  (
( topGen `  x )  =  ( topGen `  B
)  <->  ( topGen `  B
)  =  ( topGen `  B ) ) )
74, 6anbi12d 747 . . . 4  |-  ( x  =  B  ->  (
( x  ~<_  om  /\  ( topGen `  x )  =  ( topGen `  B
) )  <->  ( B  ~<_  om  /\  ( topGen `  B
)  =  ( topGen `  B ) ) ) )
87rspcev 3309 . . 3  |-  ( ( B  e.  TopBases  /\  ( B  ~<_  om  /\  ( topGen `
 B )  =  ( topGen `  B )
) )  ->  E. x  e. 
TopBases  ( x  ~<_  om  /\  ( topGen `  x )  =  ( topGen `  B
) ) )
91, 2, 3, 8syl12anc 1324 . 2  |-  ( ( B  e.  TopBases  /\  B  ~<_  om )  ->  E. x  e. 
TopBases  ( x  ~<_  om  /\  ( topGen `  x )  =  ( topGen `  B
) ) )
10 is2ndc 21249 . 2  |-  ( (
topGen `  B )  e. 
2ndc 
<->  E. x  e.  TopBases  ( x  ~<_  om  /\  ( topGen `
 x )  =  ( topGen `  B )
) )
119, 10sylibr 224 1  |-  ( ( B  e.  TopBases  /\  B  ~<_  om )  ->  ( topGen `  B )  e.  2ndc )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 384    = wceq 1483    e. wcel 1990   E.wrex 2913   class class class wbr 4653   ` cfv 5888   omcom 7065    ~<_ cdom 7953   topGenctg 16098   TopBasesctb 20749   2ndcc2ndc 21241
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-nul 4789
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-iota 5851  df-fv 5896  df-2ndc 21243
This theorem is referenced by:  2ndcrest  21257  2ndcomap  21261  dis2ndc  21263  dis1stc  21302  tx2ndc  21454  met2ndci  22327  re2ndc  22604
  Copyright terms: Public domain W3C validator