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

Theorem mpompts 6265
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 6264 . 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 4724 . . 3  |-  U_ x  e.  A  ( {
x }  X.  B
)  =  ( A  X.  B )
3 mpteq1 4118 . . 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 2217 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 1364   [_csb 3084   {csn 3623   U_ciun 3917    |-> cmpt 4095    X. cxp 4662   ` cfv 5259    e. cmpo 5927   1stc1st 6205   2ndc2nd 6206
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-sbc 2990  df-csb 3085  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-iota 5220  df-fun 5261  df-fv 5267  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208
This theorem is referenced by:  dfmpo  6290
  Copyright terms: Public domain W3C validator