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

Theorem mpompts 6089
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 6088 . 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 4594 . . 3  |-  U_ x  e.  A  ( {
x }  X.  B
)  =  ( A  X.  B )
3 mpteq1 4007 . . 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 2158 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 1331   [_csb 2998   {csn 3522   U_ciun 3808    |-> cmpt 3984    X. cxp 4532   ` cfv 5118    e. cmpo 5769   1stc1st 6029   2ndc2nd 6030
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126  ax-un 4350
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-sbc 2905  df-csb 2999  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-iun 3810  df-br 3925  df-opab 3985  df-mpt 3986  df-id 4210  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-iota 5083  df-fun 5120  df-fv 5126  df-oprab 5771  df-mpo 5772  df-1st 6031  df-2nd 6032
This theorem is referenced by:  dfmpo  6113
  Copyright terms: Public domain W3C validator