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

Theorem txss12 15367
Description: Subset property of the topological product. (Contributed by Mario Carneiro, 2-Sep-2015.)
Assertion
Ref Expression
txss12  |-  ( ( ( B  e.  V  /\  D  e.  W
)  /\  ( A  C_  B  /\  C  C_  D ) )  -> 
( A  tX  C
)  C_  ( B  tX  D ) )

Proof of Theorem txss12
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2238 . . . 4  |-  ran  (
x  e.  B , 
y  e.  D  |->  ( x  X.  y ) )  =  ran  (
x  e.  B , 
y  e.  D  |->  ( x  X.  y ) )
21txbasex 15358 . . 3  |-  ( ( B  e.  V  /\  D  e.  W )  ->  ran  ( x  e.  B ,  y  e.  D  |->  ( x  X.  y ) )  e. 
_V )
3 resmpo 6186 . . . . . 6  |-  ( ( A  C_  B  /\  C  C_  D )  -> 
( ( x  e.  B ,  y  e.  D  |->  ( x  X.  y ) )  |`  ( A  X.  C
) )  =  ( x  e.  A , 
y  e.  C  |->  ( x  X.  y ) ) )
4 resss 5087 . . . . . 6  |-  ( ( x  e.  B , 
y  e.  D  |->  ( x  X.  y ) )  |`  ( A  X.  C ) )  C_  ( x  e.  B ,  y  e.  D  |->  ( x  X.  y
) )
53, 4eqsstrrdi 3301 . . . . 5  |-  ( ( A  C_  B  /\  C  C_  D )  -> 
( x  e.  A ,  y  e.  C  |->  ( x  X.  y
) )  C_  (
x  e.  B , 
y  e.  D  |->  ( x  X.  y ) ) )
65adantl 277 . . . 4  |-  ( ( ( B  e.  V  /\  D  e.  W
)  /\  ( A  C_  B  /\  C  C_  D ) )  -> 
( x  e.  A ,  y  e.  C  |->  ( x  X.  y
) )  C_  (
x  e.  B , 
y  e.  D  |->  ( x  X.  y ) ) )
7 rnss 5012 . . . 4  |-  ( ( x  e.  A , 
y  e.  C  |->  ( x  X.  y ) )  C_  ( x  e.  B ,  y  e.  D  |->  ( x  X.  y ) )  ->  ran  ( x  e.  A ,  y  e.  C  |->  ( x  X.  y
) )  C_  ran  ( x  e.  B ,  y  e.  D  |->  ( x  X.  y
) ) )
86, 7syl 14 . . 3  |-  ( ( ( B  e.  V  /\  D  e.  W
)  /\  ( A  C_  B  /\  C  C_  D ) )  ->  ran  ( x  e.  A ,  y  e.  C  |->  ( x  X.  y
) )  C_  ran  ( x  e.  B ,  y  e.  D  |->  ( x  X.  y
) ) )
9 tgss 15164 . . 3  |-  ( ( ran  ( x  e.  B ,  y  e.  D  |->  ( x  X.  y ) )  e. 
_V  /\  ran  ( x  e.  A ,  y  e.  C  |->  ( x  X.  y ) ) 
C_  ran  ( x  e.  B ,  y  e.  D  |->  ( x  X.  y ) ) )  ->  ( topGen `  ran  ( x  e.  A ,  y  e.  C  |->  ( x  X.  y
) ) )  C_  ( topGen `  ran  ( x  e.  B ,  y  e.  D  |->  ( x  X.  y ) ) ) )
102, 8, 9syl2an2r 603 . 2  |-  ( ( ( B  e.  V  /\  D  e.  W
)  /\  ( A  C_  B  /\  C  C_  D ) )  -> 
( topGen `  ran  ( x  e.  A ,  y  e.  C  |->  ( x  X.  y ) ) )  C_  ( topGen ` 
ran  ( x  e.  B ,  y  e.  D  |->  ( x  X.  y ) ) ) )
11 ssexg 4272 . . . . 5  |-  ( ( A  C_  B  /\  B  e.  V )  ->  A  e.  _V )
12 ssexg 4272 . . . . 5  |-  ( ( C  C_  D  /\  D  e.  W )  ->  C  e.  _V )
13 eqid 2238 . . . . . 6  |-  ran  (
x  e.  A , 
y  e.  C  |->  ( x  X.  y ) )  =  ran  (
x  e.  A , 
y  e.  C  |->  ( x  X.  y ) )
1413txval 15356 . . . . 5  |-  ( ( A  e.  _V  /\  C  e.  _V )  ->  ( A  tX  C
)  =  ( topGen ` 
ran  ( x  e.  A ,  y  e.  C  |->  ( x  X.  y ) ) ) )
1511, 12, 14syl2an 289 . . . 4  |-  ( ( ( A  C_  B  /\  B  e.  V
)  /\  ( C  C_  D  /\  D  e.  W ) )  -> 
( A  tX  C
)  =  ( topGen ` 
ran  ( x  e.  A ,  y  e.  C  |->  ( x  X.  y ) ) ) )
1615an4s 596 . . 3  |-  ( ( ( A  C_  B  /\  C  C_  D )  /\  ( B  e.  V  /\  D  e.  W ) )  -> 
( A  tX  C
)  =  ( topGen ` 
ran  ( x  e.  A ,  y  e.  C  |->  ( x  X.  y ) ) ) )
1716ancoms 268 . 2  |-  ( ( ( B  e.  V  /\  D  e.  W
)  /\  ( A  C_  B  /\  C  C_  D ) )  -> 
( A  tX  C
)  =  ( topGen ` 
ran  ( x  e.  A ,  y  e.  C  |->  ( x  X.  y ) ) ) )
181txval 15356 . . 3  |-  ( ( B  e.  V  /\  D  e.  W )  ->  ( B  tX  D
)  =  ( topGen ` 
ran  ( x  e.  B ,  y  e.  D  |->  ( x  X.  y ) ) ) )
1918adantr 276 . 2  |-  ( ( ( B  e.  V  /\  D  e.  W
)  /\  ( A  C_  B  /\  C  C_  D ) )  -> 
( B  tX  D
)  =  ( topGen ` 
ran  ( x  e.  B ,  y  e.  D  |->  ( x  X.  y ) ) ) )
2010, 17, 193sstr4d 3293 1  |-  ( ( ( B  e.  V  /\  D  e.  W
)  /\  ( A  C_  B  /\  C  C_  D ) )  -> 
( A  tX  C
)  C_  ( B  tX  D ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   _Vcvv 2821    C_ wss 3220    X. cxp 4772   ran crn 4775    |` cres 4776   ` 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: (None)
  Copyright terms: Public domain W3C validator