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

Theorem mpompts 6407
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 6406 . 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 4815 . . 3  |-  U_ x  e.  A  ( {
x }  X.  B
)  =  ( A  X.  B )
3 mpteq1 4199 . . 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 2255 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 1398   [_csb 3141   {csn 3694   U_ciun 3996    |-> cmpt 4176    X. cxp 4752   ` cfv 5357    e. cmpo 6060   1stc1st 6345   2ndc2nd 6346
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-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-sbc 3046  df-csb 3142  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-iota 5317  df-fun 5359  df-fv 5365  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348
This theorem is referenced by:  dfmpo  6432
  Copyright terms: Public domain W3C validator