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

Theorem eltg 14846
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 13408 . . 3  |-  ( B  e.  V  ->  ( topGen `
 B )  =  { x  |  x 
C_  U. ( B  i^i  ~P x ) } )
21eleq2d 2301 . 2  |-  ( B  e.  V  ->  ( A  e.  ( topGen `  B )  <->  A  e.  { x  |  x  C_  U. ( B  i^i  ~P x ) } ) )
3 elex 2815 . . . 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 4230 . . . . . 6  |-  ( B  e.  V  ->  ( B  i^i  ~P A )  e.  _V )
6 uniexg 4542 . . . . . 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 4233 . . . . 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 3659 . . . . . . 7  |-  ( x  =  A  ->  ~P x  =  ~P A
)
1312ineq2d 3410 . . . . . 6  |-  ( x  =  A  ->  ( B  i^i  ~P x )  =  ( B  i^i  ~P A ) )
1413unieqd 3909 . . . . 5  |-  ( x  =  A  ->  U. ( B  i^i  ~P x )  =  U. ( B  i^i  ~P A ) )
1511, 14sseq12d 3259 . . . 4  |-  ( x  =  A  ->  (
x  C_  U. ( B  i^i  ~P x )  <-> 
A  C_  U. ( B  i^i  ~P A ) ) )
1615elabg 2953 . . 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 924 . 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 1398    e. wcel 2202   {cab 2217   _Vcvv 2803    i^i cin 3200    C_ wss 3201   ~Pcpw 3656   U.cuni 3898   ` cfv 5333   topGenctg 13400
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-sbc 3033  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-iota 5293  df-fun 5335  df-fv 5341  df-topgen 13406
This theorem is referenced by:  eltg4i  14849  eltg3i  14850  bastg  14855  tgss  14857  eltop  14863
  Copyright terms: Public domain W3C validator