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

Theorem tgdom 15096
Description: A space has no more open sets than subsets of a basis. (Contributed by Stefan O'Rear, 22-Feb-2015.) (Revised by Mario Carneiro, 9-Apr-2015.)
Assertion
Ref Expression
tgdom  |-  ( B  e.  V  ->  ( topGen `
 B )  ~<_  ~P B )

Proof of Theorem tgdom
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 pwexg 4312 . 2  |-  ( B  e.  V  ->  ~P B  e.  _V )
2 inss1 3451 . . . . 5  |-  ( B  i^i  ~P x ) 
C_  B
3 vpwex 4311 . . . . . . 7  |-  ~P x  e.  _V
43inex2 4263 . . . . . 6  |-  ( B  i^i  ~P x )  e.  _V
54elpw 3691 . . . . 5  |-  ( ( B  i^i  ~P x
)  e.  ~P B  <->  ( B  i^i  ~P x
)  C_  B )
62, 5mpbir 146 . . . 4  |-  ( B  i^i  ~P x )  e.  ~P B
76a1i 9 . . 3  |-  ( x  e.  ( topGen `  B
)  ->  ( B  i^i  ~P x )  e. 
~P B )
8 unieq 3939 . . . . . . 7  |-  ( ( B  i^i  ~P x
)  =  ( B  i^i  ~P y )  ->  U. ( B  i^i  ~P x )  =  U. ( B  i^i  ~P y
) )
98adantl 277 . . . . . 6  |-  ( ( ( x  e.  (
topGen `  B )  /\  y  e.  ( topGen `  B ) )  /\  ( B  i^i  ~P x
)  =  ( B  i^i  ~P y ) )  ->  U. ( B  i^i  ~P x )  =  U. ( B  i^i  ~P y ) )
10 eltg4i 15079 . . . . . . 7  |-  ( x  e.  ( topGen `  B
)  ->  x  =  U. ( B  i^i  ~P x ) )
1110ad2antrr 492 . . . . . 6  |-  ( ( ( x  e.  (
topGen `  B )  /\  y  e.  ( topGen `  B ) )  /\  ( B  i^i  ~P x
)  =  ( B  i^i  ~P y ) )  ->  x  =  U. ( B  i^i  ~P x ) )
12 eltg4i 15079 . . . . . . 7  |-  ( y  e.  ( topGen `  B
)  ->  y  =  U. ( B  i^i  ~P y ) )
1312ad2antlr 493 . . . . . 6  |-  ( ( ( x  e.  (
topGen `  B )  /\  y  e.  ( topGen `  B ) )  /\  ( B  i^i  ~P x
)  =  ( B  i^i  ~P y ) )  ->  y  =  U. ( B  i^i  ~P y ) )
149, 11, 133eqtr4d 2281 . . . . 5  |-  ( ( ( x  e.  (
topGen `  B )  /\  y  e.  ( topGen `  B ) )  /\  ( B  i^i  ~P x
)  =  ( B  i^i  ~P y ) )  ->  x  =  y )
1514ex 115 . . . 4  |-  ( ( x  e.  ( topGen `  B )  /\  y  e.  ( topGen `  B )
)  ->  ( ( B  i^i  ~P x )  =  ( B  i^i  ~P y )  ->  x  =  y ) )
16 pweq 3688 . . . . 5  |-  ( x  =  y  ->  ~P x  =  ~P y
)
1716ineq2d 3432 . . . 4  |-  ( x  =  y  ->  ( B  i^i  ~P x )  =  ( B  i^i  ~P y ) )
1815, 17impbid1 142 . . 3  |-  ( ( x  e.  ( topGen `  B )  /\  y  e.  ( topGen `  B )
)  ->  ( ( B  i^i  ~P x )  =  ( B  i^i  ~P y )  <->  x  =  y ) )
197, 18dom2 7051 . 2  |-  ( ~P B  e.  _V  ->  (
topGen `  B )  ~<_  ~P B )
201, 19syl 14 1  |-  ( B  e.  V  ->  ( topGen `
 B )  ~<_  ~P B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   _Vcvv 2821    i^i cin 3219    C_ wss 3220   ~Pcpw 3685   U.cuni 3930   class class class wbr 4125   ` cfv 5372    ~<_ cdom 7011   topGenctg 13585
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-dom 7014  df-topgen 13591
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator