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

Theorem bastop1 14403
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 14383 . . . . 5  |-  ( ( J  e.  Top  /\  B  C_  J )  -> 
( topGen `  B )  C_  ( topGen `  J )
)
2 tgtop 14388 . . . . . 6  |-  ( J  e.  Top  ->  ( topGen `
 J )  =  J )
32adantr 276 . . . . 5  |-  ( ( J  e.  Top  /\  B  C_  J )  -> 
( topGen `  J )  =  J )
41, 3sseqtrd 3222 . . . 4  |-  ( ( J  e.  Top  /\  B  C_  J )  -> 
( topGen `  B )  C_  J )
5 eqss 3199 . . . . 5  |-  ( (
topGen `  B )  =  J  <->  ( ( topGen `  B )  C_  J  /\  J  C_  ( topGen `  B ) ) )
65baib 920 . . . 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 3173 . . 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 4173 . . . . 5  |-  ( ( B  C_  J  /\  J  e.  Top )  ->  B  e.  _V )
1110ancoms 268 . . . 4  |-  ( ( J  e.  Top  /\  B  C_  J )  ->  B  e.  _V )
12 eltg3 14377 . . . 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 2497 . 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 1364   E.wex 1506    e. wcel 2167   A.wral 2475   _Vcvv 2763    C_ wss 3157   U.cuni 3840   ` cfv 5259   topGenctg 12956   Topctop 14317
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-sbc 2990  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-iota 5220  df-fun 5261  df-fv 5267  df-topgen 12962  df-top 14318
This theorem is referenced by:  bastop2  14404
  Copyright terms: Public domain W3C validator