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

Theorem eltg 12811
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 12808 . . 3  |-  ( B  e.  V  ->  ( topGen `
 B )  =  { x  |  x 
C_  U. ( B  i^i  ~P x ) } )
21eleq2d 2240 . 2  |-  ( B  e.  V  ->  ( A  e.  ( topGen `  B )  <->  A  e.  { x  |  x  C_  U. ( B  i^i  ~P x ) } ) )
3 elex 2741 . . . 4  |-  ( A  e.  { x  |  x  C_  U. ( B  i^i  ~P x ) }  ->  A  e.  _V )
43adantl 275 . . 3  |-  ( ( B  e.  V  /\  A  e.  { x  |  x  C_  U. ( B  i^i  ~P x ) } )  ->  A  e.  _V )
5 inex1g 4123 . . . . . 6  |-  ( B  e.  V  ->  ( B  i^i  ~P A )  e.  _V )
6 uniexg 4422 . . . . . 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 4126 . . . . 5  |-  ( ( A  C_  U. ( B  i^i  ~P A )  /\  U. ( B  i^i  ~P A )  e.  _V )  ->  A  e.  _V )
97, 8sylan2 284 . . . 4  |-  ( ( A  C_  U. ( B  i^i  ~P A )  /\  B  e.  V
)  ->  A  e.  _V )
109ancoms 266 . . 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 3567 . . . . . . 7  |-  ( x  =  A  ->  ~P x  =  ~P A
)
1312ineq2d 3328 . . . . . 6  |-  ( x  =  A  ->  ( B  i^i  ~P x )  =  ( B  i^i  ~P A ) )
1413unieqd 3805 . . . . 5  |-  ( x  =  A  ->  U. ( B  i^i  ~P x )  =  U. ( B  i^i  ~P A ) )
1511, 14sseq12d 3178 . . . 4  |-  ( x  =  A  ->  (
x  C_  U. ( B  i^i  ~P x )  <-> 
A  C_  U. ( B  i^i  ~P A ) ) )
1615elabg 2876 . . 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 911 . 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 187 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 104    = wceq 1348    e. wcel 2141   {cab 2156   _Vcvv 2730    i^i cin 3120    C_ wss 3121   ~Pcpw 3564   U.cuni 3794   ` cfv 5196   topGenctg 12587
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4105  ax-pow 4158  ax-pr 4192  ax-un 4416
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-sbc 2956  df-un 3125  df-in 3127  df-ss 3134  df-pw 3566  df-sn 3587  df-pr 3588  df-op 3590  df-uni 3795  df-br 3988  df-opab 4049  df-mpt 4050  df-id 4276  df-xp 4615  df-rel 4616  df-cnv 4617  df-co 4618  df-dm 4619  df-iota 5158  df-fun 5198  df-fv 5204  df-topgen 12593
This theorem is referenced by:  eltg4i  12814  eltg3i  12815  bastg  12820  tgss  12822  eltop  12828
  Copyright terms: Public domain W3C validator