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

Theorem txopn 15366
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 2238 . . . . . 6  |-  ran  (
u  e.  R , 
v  e.  S  |->  ( u  X.  v ) )  =  ran  (
u  e.  R , 
v  e.  S  |->  ( u  X.  v ) )
21txbasex 15358 . . . . 5  |-  ( ( R  e.  V  /\  S  e.  W )  ->  ran  ( u  e.  R ,  v  e.  S  |->  ( u  X.  v ) )  e. 
_V )
3 bastg 15162 . . . . 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 2238 . . . . . 6  |-  ( A  X.  B )  =  ( A  X.  B
)
7 xpeq1 4788 . . . . . . . 8  |-  ( u  =  A  ->  (
u  X.  v )  =  ( A  X.  v ) )
87eqeq2d 2250 . . . . . . 7  |-  ( u  =  A  ->  (
( A  X.  B
)  =  ( u  X.  v )  <->  ( A  X.  B )  =  ( A  X.  v ) ) )
9 xpeq2 4789 . . . . . . . 8  |-  ( v  =  B  ->  ( A  X.  v )  =  ( A  X.  B
) )
109eqeq2d 2250 . . . . . . 7  |-  ( v  =  B  ->  (
( A  X.  B
)  =  ( A  X.  v )  <->  ( A  X.  B )  =  ( A  X.  B ) ) )
118, 10rspc2ev 2945 . . . . . 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 1367 . . . . 5  |-  ( ( A  e.  R  /\  B  e.  S )  ->  E. u  e.  R  E. v  e.  S  ( A  X.  B
)  =  ( u  X.  v ) )
13 xpexg 4889 . . . . . 6  |-  ( ( A  e.  R  /\  B  e.  S )  ->  ( A  X.  B
)  e.  _V )
14 eqid 2238 . . . . . . 7  |-  ( u  e.  R ,  v  e.  S  |->  ( u  X.  v ) )  =  ( u  e.  R ,  v  e.  S  |->  ( u  X.  v ) )
1514elrnmpog 6201 . . . . . 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 3249 . 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 15356 . . 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 2318 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
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   E.wrex 2529   _Vcvv 2821    C_ wss 3220    X. cxp 4772   ran crn 4775   ` cfv 5377  (class class class)co 6085    e. cmpo 6087   topGenctg 13608    tX ctx 15353
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-topgen 13614  df-tx 15354
This theorem is used by:  txbasval  15368  neitx  15369  tx1cn  15370  tx2cn  15371  txlm  15380
  Copyright terms: Public domain W3C validator