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

Theorem resmpo 6186
Description: Restriction of the mapping operation. (Contributed by Mario Carneiro, 17-Dec-2013.)
Assertion
Ref Expression
resmpo  |-  ( ( C  C_  A  /\  D  C_  B )  -> 
( ( x  e.  A ,  y  e.  B  |->  E )  |`  ( C  X.  D
) )  =  ( x  e.  C , 
y  e.  D  |->  E ) )
Distinct variable groups:    x, A, y   
x, B, y    x, C, y    x, D, y
Allowed substitution hints:    E( x,  y)

Proof of Theorem resmpo
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 resoprab2 6185 . 2  |-  ( ( C  C_  A  /\  D  C_  B )  -> 
( { <. <. x ,  y >. ,  z
>.  |  ( (
x  e.  A  /\  y  e.  B )  /\  z  =  E
) }  |`  ( C  X.  D ) )  =  { <. <. x ,  y >. ,  z
>.  |  ( (
x  e.  C  /\  y  e.  D )  /\  z  =  E
) } )
2 df-mpo 6090 . . 3  |-  ( x  e.  A ,  y  e.  B  |->  E )  =  { <. <. x ,  y >. ,  z
>.  |  ( (
x  e.  A  /\  y  e.  B )  /\  z  =  E
) }
32reseq1i 5059 . 2  |-  ( ( x  e.  A , 
y  e.  B  |->  E )  |`  ( C  X.  D ) )  =  ( { <. <. x ,  y >. ,  z
>.  |  ( (
x  e.  A  /\  y  e.  B )  /\  z  =  E
) }  |`  ( C  X.  D ) )
4 df-mpo 6090 . 2  |-  ( x  e.  C ,  y  e.  D  |->  E )  =  { <. <. x ,  y >. ,  z
>.  |  ( (
x  e.  C  /\  y  e.  D )  /\  z  =  E
) }
51, 3, 43eqtr4g 2296 1  |-  ( ( C  C_  A  /\  D  C_  B )  -> 
( ( x  e.  A ,  y  e.  B  |->  E )  |`  ( C  X.  D
) )  =  ( x  e.  C , 
y  e.  D  |->  E ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209    C_ wss 3220    X. cxp 4772    |` cres 4776   {coprab 6086    e. cmpo 6087
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  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-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-opab 4193  df-xp 4780  df-rel 4781  df-res 4786  df-oprab 6089  df-mpo 6090
This theorem is used by:  ofmres  6369  divfnzn  10021  txss12  15367  txbasval  15368  cnmpt2res  15398
  Copyright terms: Public domain W3C validator