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

Theorem mpomptsx 6306
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 2779 . . . . . 6  |-  u  e. 
_V
2 vex 2779 . . . . . 6  |-  v  e. 
_V
31, 2op1std 6257 . . . . 5  |-  ( z  =  <. u ,  v
>.  ->  ( 1st `  z
)  =  u )
43csbeq1d 3108 . . . 4  |-  ( z  =  <. u ,  v
>.  ->  [_ ( 1st `  z
)  /  x ]_ [_ ( 2nd `  z
)  /  y ]_ C  =  [_ u  /  x ]_ [_ ( 2nd `  z )  /  y ]_ C )
51, 2op2ndd 6258 . . . . . 6  |-  ( z  =  <. u ,  v
>.  ->  ( 2nd `  z
)  =  v )
65csbeq1d 3108 . . . . 5  |-  ( z  =  <. u ,  v
>.  ->  [_ ( 2nd `  z
)  /  y ]_ C  =  [_ v  / 
y ]_ C )
76csbeq2dv 3127 . . . 4  |-  ( z  =  <. u ,  v
>.  ->  [_ u  /  x ]_ [_ ( 2nd `  z
)  /  y ]_ C  =  [_ u  /  x ]_ [_ v  / 
y ]_ C )
84, 7eqtrd 2240 . . 3  |-  ( z  =  <. u ,  v
>.  ->  [_ ( 1st `  z
)  /  x ]_ [_ ( 2nd `  z
)  /  y ]_ C  =  [_ u  /  x ]_ [_ v  / 
y ]_ C )
98mpomptx 6059 . 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 2350 . . . 4  |-  F/_ u
( { x }  X.  B )
11 nfcv 2350 . . . . 5  |-  F/_ x { u }
12 nfcsb1v 3134 . . . . 5  |-  F/_ x [_ u  /  x ]_ B
1311, 12nfxp 4720 . . . 4  |-  F/_ x
( { u }  X.  [_ u  /  x ]_ B )
14 sneq 3654 . . . . 5  |-  ( x  =  u  ->  { x }  =  { u } )
15 csbeq1a 3110 . . . . 5  |-  ( x  =  u  ->  B  =  [_ u  /  x ]_ B )
1614, 15xpeq12d 4718 . . . 4  |-  ( x  =  u  ->  ( { x }  X.  B )  =  ( { u }  X.  [_ u  /  x ]_ B ) )
1710, 13, 16cbviun 3978 . . 3  |-  U_ x  e.  A  ( {
x }  X.  B
)  =  U_ u  e.  A  ( {
u }  X.  [_ u  /  x ]_ B
)
18 mpteq1 4144 . . 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 2350 . . 3  |-  F/_ u B
21 nfcv 2350 . . 3  |-  F/_ u C
22 nfcv 2350 . . 3  |-  F/_ v C
23 nfcsb1v 3134 . . 3  |-  F/_ x [_ u  /  x ]_ [_ v  /  y ]_ C
24 nfcv 2350 . . . 4  |-  F/_ y
u
25 nfcsb1v 3134 . . . 4  |-  F/_ y [_ v  /  y ]_ C
2624, 25nfcsb 3139 . . 3  |-  F/_ y [_ u  /  x ]_ [_ v  /  y ]_ C
27 csbeq1a 3110 . . . 4  |-  ( y  =  v  ->  C  =  [_ v  /  y ]_ C )
28 csbeq1a 3110 . . . 4  |-  ( x  =  u  ->  [_ v  /  y ]_ C  =  [_ u  /  x ]_ [_ v  /  y ]_ C )
2927, 28sylan9eqr 2262 . . 3  |-  ( ( x  =  u  /\  y  =  v )  ->  C  =  [_ u  /  x ]_ [_ v  /  y ]_ C
)
3020, 12, 21, 22, 23, 26, 15, 29cbvmpox 6046 . 2  |-  ( x  e.  A ,  y  e.  B  |->  C )  =  ( u  e.  A ,  v  e. 
[_ u  /  x ]_ B  |->  [_ u  /  x ]_ [_ v  /  y ]_ C
)
319, 19, 303eqtr4ri 2239 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 1373   [_csb 3101   {csn 3643   <.cop 3646   U_ciun 3941    |-> cmpt 4121    X. cxp 4691   ` cfv 5290    e. cmpo 5969   1stc1st 6247   2ndc2nd 6248
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-v 2778  df-sbc 3006  df-csb 3102  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-iota 5251  df-fun 5292  df-fv 5298  df-oprab 5971  df-mpo 5972  df-1st 6249  df-2nd 6250
This theorem is referenced by:  mpompts  6307  mpofvex  6314
  Copyright terms: Public domain W3C validator