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

Theorem bastop1 13668
Description: A subset of a topology is a basis for the topology iff every member of the topology is a union of members of the basis. We use the idiom " ( topGen `  B
)  =  J " to express " B is a basis for topology  J " since we do not have a separate notation for this. Definition 15.35 of [Schechter] p. 428. (Contributed by NM, 2-Feb-2008.) (Proof shortened by Mario Carneiro, 2-Sep-2015.)
Assertion
Ref Expression
bastop1  |-  ( ( J  e.  Top  /\  B  C_  J )  -> 
( ( topGen `  B
)  =  J  <->  A. x  e.  J  E. y
( y  C_  B  /\  x  =  U. y ) ) )
Distinct variable groups:    x, y, B   
x, J, y

Proof of Theorem bastop1
StepHypRef Expression
1 tgss 13648 . . . . 5  |-  ( ( J  e.  Top  /\  B  C_  J )  -> 
( topGen `  B )  C_  ( topGen `  J )
)
2 tgtop 13653 . . . . . 6  |-  ( J  e.  Top  ->  ( topGen `
 J )  =  J )
32adantr 276 . . . . 5  |-  ( ( J  e.  Top  /\  B  C_  J )  -> 
( topGen `  J )  =  J )
41, 3sseqtrd 3195 . . . 4  |-  ( ( J  e.  Top  /\  B  C_  J )  -> 
( topGen `  B )  C_  J )
5 eqss 3172 . . . . 5  |-  ( (
topGen `  B )  =  J  <->  ( ( topGen `  B )  C_  J  /\  J  C_  ( topGen `  B ) ) )
65baib 919 . . . 4  |-  ( (
topGen `  B )  C_  J  ->  ( ( topGen `  B )  =  J  <-> 
J  C_  ( topGen `  B ) ) )
74, 6syl 14 . . 3  |-  ( ( J  e.  Top  /\  B  C_  J )  -> 
( ( topGen `  B
)  =  J  <->  J  C_  ( topGen `
 B ) ) )
8 dfss3 3147 . . 3  |-  ( J 
C_  ( topGen `  B
)  <->  A. x  e.  J  x  e.  ( topGen `  B ) )
97, 8bitrdi 196 . 2  |-  ( ( J  e.  Top  /\  B  C_  J )  -> 
( ( topGen `  B
)  =  J  <->  A. x  e.  J  x  e.  ( topGen `  B )
) )
10 ssexg 4144 . . . . 5  |-  ( ( B  C_  J  /\  J  e.  Top )  ->  B  e.  _V )
1110ancoms 268 . . . 4  |-  ( ( J  e.  Top  /\  B  C_  J )  ->  B  e.  _V )
12 eltg3 13642 . . . 4  |-  ( B  e.  _V  ->  (
x  e.  ( topGen `  B )  <->  E. y
( y  C_  B  /\  x  =  U. y ) ) )
1311, 12syl 14 . . 3  |-  ( ( J  e.  Top  /\  B  C_  J )  -> 
( x  e.  (
topGen `  B )  <->  E. y
( y  C_  B  /\  x  =  U. y ) ) )
1413ralbidv 2477 . 2  |-  ( ( J  e.  Top  /\  B  C_  J )  -> 
( A. x  e.  J  x  e.  (
topGen `  B )  <->  A. x  e.  J  E. y
( y  C_  B  /\  x  =  U. y ) ) )
159, 14bitrd 188 1  |-  ( ( J  e.  Top  /\  B  C_  J )  -> 
( ( topGen `  B
)  =  J  <->  A. x  e.  J  E. y
( y  C_  B  /\  x  =  U. y ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1353   E.wex 1492    e. wcel 2148   A.wral 2455   _Vcvv 2739    C_ wss 3131   U.cuni 3811   ` cfv 5218   topGenctg 12708   Topctop 13582
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-sbc 2965  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-iota 5180  df-fun 5220  df-fv 5226  df-topgen 12714  df-top 13583
This theorem is referenced by:  bastop2  13669
  Copyright terms: Public domain W3C validator