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

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

Proof of Theorem mpomptsx
Dummy variables  v  u are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 2729 . . . . . 6  |-  u  e. 
_V
2 vex 2729 . . . . . 6  |-  v  e. 
_V
31, 2op1std 6116 . . . . 5  |-  ( z  =  <. u ,  v
>.  ->  ( 1st `  z
)  =  u )
43csbeq1d 3052 . . . 4  |-  ( z  =  <. u ,  v
>.  ->  [_ ( 1st `  z
)  /  x ]_ [_ ( 2nd `  z
)  /  y ]_ C  =  [_ u  /  x ]_ [_ ( 2nd `  z )  /  y ]_ C )
51, 2op2ndd 6117 . . . . . 6  |-  ( z  =  <. u ,  v
>.  ->  ( 2nd `  z
)  =  v )
65csbeq1d 3052 . . . . 5  |-  ( z  =  <. u ,  v
>.  ->  [_ ( 2nd `  z
)  /  y ]_ C  =  [_ v  / 
y ]_ C )
76csbeq2dv 3071 . . . 4  |-  ( z  =  <. u ,  v
>.  ->  [_ u  /  x ]_ [_ ( 2nd `  z
)  /  y ]_ C  =  [_ u  /  x ]_ [_ v  / 
y ]_ C )
84, 7eqtrd 2198 . . 3  |-  ( z  =  <. u ,  v
>.  ->  [_ ( 1st `  z
)  /  x ]_ [_ ( 2nd `  z
)  /  y ]_ C  =  [_ u  /  x ]_ [_ v  / 
y ]_ C )
98mpomptx 5933 . 2  |-  ( z  e.  U_ u  e.  A  ( { u }  X.  [_ u  /  x ]_ B )  |->  [_ ( 1st `  z )  /  x ]_ [_ ( 2nd `  z )  / 
y ]_ C )  =  ( u  e.  A ,  v  e.  [_ u  /  x ]_ B  |->  [_ u  /  x ]_ [_ v  /  y ]_ C
)
10 nfcv 2308 . . . 4  |-  F/_ u
( { x }  X.  B )
11 nfcv 2308 . . . . 5  |-  F/_ x { u }
12 nfcsb1v 3078 . . . . 5  |-  F/_ x [_ u  /  x ]_ B
1311, 12nfxp 4631 . . . 4  |-  F/_ x
( { u }  X.  [_ u  /  x ]_ B )
14 sneq 3587 . . . . 5  |-  ( x  =  u  ->  { x }  =  { u } )
15 csbeq1a 3054 . . . . 5  |-  ( x  =  u  ->  B  =  [_ u  /  x ]_ B )
1614, 15xpeq12d 4629 . . . 4  |-  ( x  =  u  ->  ( { x }  X.  B )  =  ( { u }  X.  [_ u  /  x ]_ B ) )
1710, 13, 16cbviun 3903 . . 3  |-  U_ x  e.  A  ( {
x }  X.  B
)  =  U_ u  e.  A  ( {
u }  X.  [_ u  /  x ]_ B
)
18 mpteq1 4066 . . 3  |-  ( U_ x  e.  A  ( { x }  X.  B )  =  U_ u  e.  A  ( { u }  X.  [_ u  /  x ]_ B )  ->  (
z  e.  U_ x  e.  A  ( {
x }  X.  B
)  |->  [_ ( 1st `  z
)  /  x ]_ [_ ( 2nd `  z
)  /  y ]_ C )  =  ( z  e.  U_ u  e.  A  ( {
u }  X.  [_ u  /  x ]_ B
)  |->  [_ ( 1st `  z
)  /  x ]_ [_ ( 2nd `  z
)  /  y ]_ C ) )
1917, 18ax-mp 5 . 2  |-  ( z  e.  U_ x  e.  A  ( { x }  X.  B )  |->  [_ ( 1st `  z )  /  x ]_ [_ ( 2nd `  z )  / 
y ]_ C )  =  ( z  e.  U_ u  e.  A  ( { u }  X.  [_ u  /  x ]_ B )  |->  [_ ( 1st `  z )  /  x ]_ [_ ( 2nd `  z )  /  y ]_ C )
20 nfcv 2308 . . 3  |-  F/_ u B
21 nfcv 2308 . . 3  |-  F/_ u C
22 nfcv 2308 . . 3  |-  F/_ v C
23 nfcsb1v 3078 . . 3  |-  F/_ x [_ u  /  x ]_ [_ v  /  y ]_ C
24 nfcv 2308 . . . 4  |-  F/_ y
u
25 nfcsb1v 3078 . . . 4  |-  F/_ y [_ v  /  y ]_ C
2624, 25nfcsb 3082 . . 3  |-  F/_ y [_ u  /  x ]_ [_ v  /  y ]_ C
27 csbeq1a 3054 . . . 4  |-  ( y  =  v  ->  C  =  [_ v  /  y ]_ C )
28 csbeq1a 3054 . . . 4  |-  ( x  =  u  ->  [_ v  /  y ]_ C  =  [_ u  /  x ]_ [_ v  /  y ]_ C )
2927, 28sylan9eqr 2221 . . 3  |-  ( ( x  =  u  /\  y  =  v )  ->  C  =  [_ u  /  x ]_ [_ v  /  y ]_ C
)
3020, 12, 21, 22, 23, 26, 15, 29cbvmpox 5920 . 2  |-  ( x  e.  A ,  y  e.  B  |->  C )  =  ( u  e.  A ,  v  e. 
[_ u  /  x ]_ B  |->  [_ u  /  x ]_ [_ v  /  y ]_ C
)
319, 19, 303eqtr4ri 2197 1  |-  ( x  e.  A ,  y  e.  B  |->  C )  =  ( z  e. 
U_ x  e.  A  ( { x }  X.  B )  |->  [_ ( 1st `  z )  /  x ]_ [_ ( 2nd `  z )  /  y ]_ C )
Colors of variables: wff set class
Syntax hints:    = wceq 1343   [_csb 3045   {csn 3576   <.cop 3579   U_ciun 3866    |-> cmpt 4043    X. cxp 4602   ` cfv 5188    e. cmpo 5844   1stc1st 6106   2ndc2nd 6107
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 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187  ax-un 4411
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-sbc 2952  df-csb 3046  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-iota 5153  df-fun 5190  df-fv 5196  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109
This theorem is referenced by:  mpompts  6166  mpofvex  6171
  Copyright terms: Public domain W3C validator