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

Theorem bastop1 14894
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 14874 . . . . 5  |-  ( ( J  e.  Top  /\  B  C_  J )  -> 
( topGen `  B )  C_  ( topGen `  J )
)
2 tgtop 14879 . . . . . 6  |-  ( J  e.  Top  ->  ( topGen `
 J )  =  J )
32adantr 276 . . . . 5  |-  ( ( J  e.  Top  /\  B  C_  J )  -> 
( topGen `  J )  =  J )
41, 3sseqtrd 3266 . . . 4  |-  ( ( J  e.  Top  /\  B  C_  J )  -> 
( topGen `  B )  C_  J )
5 eqss 3243 . . . . 5  |-  ( (
topGen `  B )  =  J  <->  ( ( topGen `  B )  C_  J  /\  J  C_  ( topGen `  B ) ) )
65baib 927 . . . 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 3217 . . 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 4233 . . . . 5  |-  ( ( B  C_  J  /\  J  e.  Top )  ->  B  e.  _V )
1110ancoms 268 . . . 4  |-  ( ( J  e.  Top  /\  B  C_  J )  ->  B  e.  _V )
12 eltg3 14868 . . . 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 2533 . 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 1398   E.wex 1541    e. wcel 2202   A.wral 2511   _Vcvv 2803    C_ wss 3201   U.cuni 3898   ` cfv 5333   topGenctg 13417   Topctop 14808
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 13423  df-top 14809
This theorem is referenced by:  bastop2  14895
  Copyright terms: Public domain W3C validator