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

Theorem txvalex 15278
Description: Existence of the binary topological product. If  R and  S are known to be topologies, see txtop 15284. (Contributed by Jim Kingdon, 3-Aug-2023.)
Assertion
Ref Expression
txvalex  |-  ( ( R  e.  V  /\  S  e.  W )  ->  ( R  tX  S
)  e.  _V )

Proof of Theorem txvalex
Dummy variables  w  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 2833 . . . 4  |-  ( R  e.  V  ->  R  e.  _V )
21adantr 276 . . 3  |-  ( ( R  e.  V  /\  S  e.  W )  ->  R  e.  _V )
3 elex 2833 . . . 4  |-  ( S  e.  W  ->  S  e.  _V )
43adantl 277 . . 3  |-  ( ( R  e.  V  /\  S  e.  W )  ->  S  e.  _V )
5 mpoexga 6438 . . . 4  |-  ( ( R  e.  V  /\  S  e.  W )  ->  ( x  e.  R ,  y  e.  S  |->  ( x  X.  y
) )  e.  _V )
6 rnexg 5042 . . . 4  |-  ( ( x  e.  R , 
y  e.  S  |->  ( x  X.  y ) )  e.  _V  ->  ran  ( x  e.  R ,  y  e.  S  |->  ( x  X.  y
) )  e.  _V )
7 tgvalex 13594 . . . 4  |-  ( ran  ( x  e.  R ,  y  e.  S  |->  ( x  X.  y
) )  e.  _V  ->  ( topGen `  ran  ( x  e.  R ,  y  e.  S  |->  ( x  X.  y ) ) )  e.  _V )
85, 6, 73syl 17 . . 3  |-  ( ( R  e.  V  /\  S  e.  W )  ->  ( topGen `  ran  ( x  e.  R ,  y  e.  S  |->  ( x  X.  y ) ) )  e.  _V )
9 mpoeq12 6138 . . . . . 6  |-  ( ( w  =  R  /\  z  =  S )  ->  ( x  e.  w ,  y  e.  z  |->  ( x  X.  y
) )  =  ( x  e.  R , 
y  e.  S  |->  ( x  X.  y ) ) )
109rneqd 5006 . . . . 5  |-  ( ( w  =  R  /\  z  =  S )  ->  ran  ( x  e.  w ,  y  e.  z  |->  ( x  X.  y ) )  =  ran  ( x  e.  R ,  y  e.  S  |->  ( x  X.  y ) ) )
1110fveq2d 5694 . . . 4  |-  ( ( w  =  R  /\  z  =  S )  ->  ( topGen `  ran  ( x  e.  w ,  y  e.  z  |->  ( x  X.  y ) ) )  =  ( topGen ` 
ran  ( x  e.  R ,  y  e.  S  |->  ( x  X.  y ) ) ) )
12 df-tx 15277 . . . 4  |-  tX  =  ( w  e.  _V ,  z  e.  _V  |->  ( topGen `  ran  ( x  e.  w ,  y  e.  z  |->  ( x  X.  y ) ) ) )
1311, 12ovmpoga 6208 . . 3  |-  ( ( R  e.  _V  /\  S  e.  _V  /\  ( topGen `
 ran  ( x  e.  R ,  y  e.  S  |->  ( x  X.  y ) ) )  e.  _V )  -> 
( R  tX  S
)  =  ( topGen ` 
ran  ( x  e.  R ,  y  e.  S  |->  ( x  X.  y ) ) ) )
142, 4, 8, 13syl3anc 1278 . 2  |-  ( ( R  e.  V  /\  S  e.  W )  ->  ( R  tX  S
)  =  ( topGen ` 
ran  ( x  e.  R ,  y  e.  S  |->  ( x  X.  y ) ) ) )
1514, 8eqeltrd 2315 1  |-  ( ( R  e.  V  /\  S  e.  W )  ->  ( R  tX  S
)  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   _Vcvv 2821    X. cxp 4767   ran crn 4770   ` cfv 5372  (class class class)co 6075    e. cmpo 6077   topGenctg 13585    tX ctx 15276
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 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 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679
This theorem 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 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-topgen 13591  df-tx 15277
This theorem is referenced by:  txbasval  15291
  Copyright terms: Public domain W3C validator