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

Theorem txopn 14433
Description: The product of two open sets is open in the product topology. (Contributed by Jeff Madsen, 2-Sep-2009.)
Assertion
Ref Expression
txopn  |-  ( ( ( R  e.  V  /\  S  e.  W
)  /\  ( A  e.  R  /\  B  e.  S ) )  -> 
( A  X.  B
)  e.  ( R 
tX  S ) )

Proof of Theorem txopn
Dummy variables  u  v are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2193 . . . . . 6  |-  ran  (
u  e.  R , 
v  e.  S  |->  ( u  X.  v ) )  =  ran  (
u  e.  R , 
v  e.  S  |->  ( u  X.  v ) )
21txbasex 14425 . . . . 5  |-  ( ( R  e.  V  /\  S  e.  W )  ->  ran  ( u  e.  R ,  v  e.  S  |->  ( u  X.  v ) )  e. 
_V )
3 bastg 14229 . . . . 5  |-  ( ran  ( u  e.  R ,  v  e.  S  |->  ( u  X.  v
) )  e.  _V  ->  ran  ( u  e.  R ,  v  e.  S  |->  ( u  X.  v ) )  C_  ( topGen `  ran  ( u  e.  R ,  v  e.  S  |->  ( u  X.  v ) ) ) )
42, 3syl 14 . . . 4  |-  ( ( R  e.  V  /\  S  e.  W )  ->  ran  ( u  e.  R ,  v  e.  S  |->  ( u  X.  v ) )  C_  ( topGen `  ran  ( u  e.  R ,  v  e.  S  |->  ( u  X.  v ) ) ) )
54adantr 276 . . 3  |-  ( ( ( R  e.  V  /\  S  e.  W
)  /\  ( A  e.  R  /\  B  e.  S ) )  ->  ran  ( u  e.  R ,  v  e.  S  |->  ( u  X.  v
) )  C_  ( topGen `
 ran  ( u  e.  R ,  v  e.  S  |->  ( u  X.  v ) ) ) )
6 eqid 2193 . . . . . 6  |-  ( A  X.  B )  =  ( A  X.  B
)
7 xpeq1 4673 . . . . . . . 8  |-  ( u  =  A  ->  (
u  X.  v )  =  ( A  X.  v ) )
87eqeq2d 2205 . . . . . . 7  |-  ( u  =  A  ->  (
( A  X.  B
)  =  ( u  X.  v )  <->  ( A  X.  B )  =  ( A  X.  v ) ) )
9 xpeq2 4674 . . . . . . . 8  |-  ( v  =  B  ->  ( A  X.  v )  =  ( A  X.  B
) )
109eqeq2d 2205 . . . . . . 7  |-  ( v  =  B  ->  (
( A  X.  B
)  =  ( A  X.  v )  <->  ( A  X.  B )  =  ( A  X.  B ) ) )
118, 10rspc2ev 2879 . . . . . 6  |-  ( ( A  e.  R  /\  B  e.  S  /\  ( A  X.  B
)  =  ( A  X.  B ) )  ->  E. u  e.  R  E. v  e.  S  ( A  X.  B
)  =  ( u  X.  v ) )
126, 11mp3an3 1337 . . . . 5  |-  ( ( A  e.  R  /\  B  e.  S )  ->  E. u  e.  R  E. v  e.  S  ( A  X.  B
)  =  ( u  X.  v ) )
13 xpexg 4773 . . . . . 6  |-  ( ( A  e.  R  /\  B  e.  S )  ->  ( A  X.  B
)  e.  _V )
14 eqid 2193 . . . . . . 7  |-  ( u  e.  R ,  v  e.  S  |->  ( u  X.  v ) )  =  ( u  e.  R ,  v  e.  S  |->  ( u  X.  v ) )
1514elrnmpog 6031 . . . . . 6  |-  ( ( A  X.  B )  e.  _V  ->  (
( A  X.  B
)  e.  ran  (
u  e.  R , 
v  e.  S  |->  ( u  X.  v ) )  <->  E. u  e.  R  E. v  e.  S  ( A  X.  B
)  =  ( u  X.  v ) ) )
1613, 15syl 14 . . . . 5  |-  ( ( A  e.  R  /\  B  e.  S )  ->  ( ( A  X.  B )  e.  ran  ( u  e.  R ,  v  e.  S  |->  ( u  X.  v
) )  <->  E. u  e.  R  E. v  e.  S  ( A  X.  B )  =  ( u  X.  v ) ) )
1712, 16mpbird 167 . . . 4  |-  ( ( A  e.  R  /\  B  e.  S )  ->  ( A  X.  B
)  e.  ran  (
u  e.  R , 
v  e.  S  |->  ( u  X.  v ) ) )
1817adantl 277 . . 3  |-  ( ( ( R  e.  V  /\  S  e.  W
)  /\  ( A  e.  R  /\  B  e.  S ) )  -> 
( A  X.  B
)  e.  ran  (
u  e.  R , 
v  e.  S  |->  ( u  X.  v ) ) )
195, 18sseldd 3180 . 2  |-  ( ( ( R  e.  V  /\  S  e.  W
)  /\  ( A  e.  R  /\  B  e.  S ) )  -> 
( A  X.  B
)  e.  ( topGen ` 
ran  ( u  e.  R ,  v  e.  S  |->  ( u  X.  v ) ) ) )
201txval 14423 . . 3  |-  ( ( R  e.  V  /\  S  e.  W )  ->  ( R  tX  S
)  =  ( topGen ` 
ran  ( u  e.  R ,  v  e.  S  |->  ( u  X.  v ) ) ) )
2120adantr 276 . 2  |-  ( ( ( R  e.  V  /\  S  e.  W
)  /\  ( A  e.  R  /\  B  e.  S ) )  -> 
( R  tX  S
)  =  ( topGen ` 
ran  ( u  e.  R ,  v  e.  S  |->  ( u  X.  v ) ) ) )
2219, 21eleqtrrd 2273 1  |-  ( ( ( R  e.  V  /\  S  e.  W
)  /\  ( A  e.  R  /\  B  e.  S ) )  -> 
( A  X.  B
)  e.  ( R 
tX  S ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1364    e. wcel 2164   E.wrex 2473   _Vcvv 2760    C_ wss 3153    X. cxp 4657   ran crn 4660   ` cfv 5254  (class class class)co 5918    e. cmpo 5920   topGenctg 12865    tX ctx 14420
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-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-topgen 12871  df-tx 14421
This theorem is referenced by:  txbasval  14435  neitx  14436  tx1cn  14437  tx2cn  14438  txlm  14447
  Copyright terms: Public domain W3C validator