ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  eltg Unicode version

Theorem eltg 14288
Description: Membership in a topology generated by a basis. (Contributed by NM, 16-Jul-2006.) (Revised by Mario Carneiro, 10-Jan-2015.)
Assertion
Ref Expression
eltg  |-  ( B  e.  V  ->  ( A  e.  ( topGen `  B )  <->  A  C_  U. ( B  i^i  ~P A ) ) )

Proof of Theorem eltg
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 tgval 12933 . . 3  |-  ( B  e.  V  ->  ( topGen `
 B )  =  { x  |  x 
C_  U. ( B  i^i  ~P x ) } )
21eleq2d 2266 . 2  |-  ( B  e.  V  ->  ( A  e.  ( topGen `  B )  <->  A  e.  { x  |  x  C_  U. ( B  i^i  ~P x ) } ) )
3 elex 2774 . . . 4  |-  ( A  e.  { x  |  x  C_  U. ( B  i^i  ~P x ) }  ->  A  e.  _V )
43adantl 277 . . 3  |-  ( ( B  e.  V  /\  A  e.  { x  |  x  C_  U. ( B  i^i  ~P x ) } )  ->  A  e.  _V )
5 inex1g 4169 . . . . . 6  |-  ( B  e.  V  ->  ( B  i^i  ~P A )  e.  _V )
6 uniexg 4474 . . . . . 6  |-  ( ( B  i^i  ~P A
)  e.  _V  ->  U. ( B  i^i  ~P A )  e.  _V )
75, 6syl 14 . . . . 5  |-  ( B  e.  V  ->  U. ( B  i^i  ~P A )  e.  _V )
8 ssexg 4172 . . . . 5  |-  ( ( A  C_  U. ( B  i^i  ~P A )  /\  U. ( B  i^i  ~P A )  e.  _V )  ->  A  e.  _V )
97, 8sylan2 286 . . . 4  |-  ( ( A  C_  U. ( B  i^i  ~P A )  /\  B  e.  V
)  ->  A  e.  _V )
109ancoms 268 . . 3  |-  ( ( B  e.  V  /\  A  C_  U. ( B  i^i  ~P A ) )  ->  A  e.  _V )
11 id 19 . . . . 5  |-  ( x  =  A  ->  x  =  A )
12 pweq 3608 . . . . . . 7  |-  ( x  =  A  ->  ~P x  =  ~P A
)
1312ineq2d 3364 . . . . . 6  |-  ( x  =  A  ->  ( B  i^i  ~P x )  =  ( B  i^i  ~P A ) )
1413unieqd 3850 . . . . 5  |-  ( x  =  A  ->  U. ( B  i^i  ~P x )  =  U. ( B  i^i  ~P A ) )
1511, 14sseq12d 3214 . . . 4  |-  ( x  =  A  ->  (
x  C_  U. ( B  i^i  ~P x )  <-> 
A  C_  U. ( B  i^i  ~P A ) ) )
1615elabg 2910 . . 3  |-  ( A  e.  _V  ->  ( A  e.  { x  |  x  C_  U. ( B  i^i  ~P x ) }  <->  A  C_  U. ( B  i^i  ~P A ) ) )
174, 10, 16pm5.21nd 917 . 2  |-  ( B  e.  V  ->  ( A  e.  { x  |  x  C_  U. ( B  i^i  ~P x ) }  <->  A  C_  U. ( B  i^i  ~P A ) ) )
182, 17bitrd 188 1  |-  ( B  e.  V  ->  ( A  e.  ( topGen `  B )  <->  A  C_  U. ( B  i^i  ~P A ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1364    e. wcel 2167   {cab 2182   _Vcvv 2763    i^i cin 3156    C_ wss 3157   ~Pcpw 3605   U.cuni 3839   ` cfv 5258   topGenctg 12925
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-sbc 2990  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-iota 5219  df-fun 5260  df-fv 5266  df-topgen 12931
This theorem is referenced by:  eltg4i  14291  eltg3i  14292  bastg  14297  tgss  14299  eltop  14305
  Copyright terms: Public domain W3C validator