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

Theorem mpompts 6104
Description: Express a two-argument function as a one-argument function, or vice-versa. (Contributed by Mario Carneiro, 24-Sep-2015.)
Assertion
Ref Expression
mpompts  |-  ( x  e.  A ,  y  e.  B  |->  C )  =  ( z  e.  ( A  X.  B
)  |->  [_ ( 1st `  z
)  /  x ]_ [_ ( 2nd `  z
)  /  y ]_ C )
Distinct variable groups:    x, y, z, A    y, B, z   
z, C    x, B
Allowed substitution hints:    C( x, y)

Proof of Theorem mpompts
StepHypRef Expression
1 mpomptsx 6103 . 2  |-  ( x  e.  A ,  y  e.  B  |->  C )  =  ( z  e. 
U_ x  e.  A  ( { x }  X.  B )  |->  [_ ( 1st `  z )  /  x ]_ [_ ( 2nd `  z )  /  y ]_ C )
2 iunxpconst 4607 . . 3  |-  U_ x  e.  A  ( {
x }  X.  B
)  =  ( A  X.  B )
3 mpteq1 4020 . . 3  |-  ( U_ x  e.  A  ( { x }  X.  B )  =  ( A  X.  B )  ->  ( z  e. 
U_ x  e.  A  ( { x }  X.  B )  |->  [_ ( 1st `  z )  /  x ]_ [_ ( 2nd `  z )  /  y ]_ C )  =  ( z  e.  ( A  X.  B )  |->  [_ ( 1st `  z )  /  x ]_ [_ ( 2nd `  z )  / 
y ]_ C ) )
42, 3ax-mp 5 . 2  |-  ( z  e.  U_ x  e.  A  ( { x }  X.  B )  |->  [_ ( 1st `  z )  /  x ]_ [_ ( 2nd `  z )  / 
y ]_ C )  =  ( z  e.  ( A  X.  B ) 
|->  [_ ( 1st `  z
)  /  x ]_ [_ ( 2nd `  z
)  /  y ]_ C )
51, 4eqtri 2161 1  |-  ( x  e.  A ,  y  e.  B  |->  C )  =  ( z  e.  ( A  X.  B
)  |->  [_ ( 1st `  z
)  /  x ]_ [_ ( 2nd `  z
)  /  y ]_ C )
Colors of variables: wff set class
Syntax hints:    = wceq 1332   [_csb 3007   {csn 3532   U_ciun 3821    |-> cmpt 3997    X. cxp 4545   ` cfv 5131    e. cmpo 5784   1stc1st 6044   2ndc2nd 6045
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139  ax-un 4363
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-sbc 2914  df-csb 3008  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-iun 3823  df-br 3938  df-opab 3998  df-mpt 3999  df-id 4223  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-iota 5096  df-fun 5133  df-fv 5139  df-oprab 5786  df-mpo 5787  df-1st 6046  df-2nd 6047
This theorem is referenced by:  dfmpo  6128
  Copyright terms: Public domain W3C validator