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

Theorem dfmpo 6432
Description: Alternate definition for the maps-to notation df-mpo 6063 (although it requires that  C be a set). (Contributed by NM, 19-Dec-2008.) (Revised by Mario Carneiro, 31-Aug-2015.)
Hypothesis
Ref Expression
dfmpo.1  |-  C  e. 
_V
Assertion
Ref Expression
dfmpo  |-  ( x  e.  A ,  y  e.  B  |->  C )  =  U_ x  e.  A  U_ y  e.  B  { <. <. x ,  y >. ,  C >. }
Distinct variable groups:    x, y, A   
x, B, y
Allowed substitution hints:    C( x, y)

Proof of Theorem dfmpo
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 mpompts 6407 . 2  |-  ( x  e.  A ,  y  e.  B  |->  C )  =  ( w  e.  ( A  X.  B
)  |->  [_ ( 1st `  w
)  /  x ]_ [_ ( 2nd `  w
)  /  y ]_ C )
2 vex 2818 . . . . 5  |-  w  e. 
_V
3 1stexg 6374 . . . . 5  |-  ( w  e.  _V  ->  ( 1st `  w )  e. 
_V )
42, 3ax-mp 5 . . . 4  |-  ( 1st `  w )  e.  _V
5 2ndexg 6375 . . . . . 6  |-  ( w  e.  _V  ->  ( 2nd `  w )  e. 
_V )
62, 5ax-mp 5 . . . . 5  |-  ( 2nd `  w )  e.  _V
7 dfmpo.1 . . . . 5  |-  C  e. 
_V
86, 7csbexa 4244 . . . 4  |-  [_ ( 2nd `  w )  / 
y ]_ C  e.  _V
94, 8csbexa 4244 . . 3  |-  [_ ( 1st `  w )  /  x ]_ [_ ( 2nd `  w )  /  y ]_ C  e.  _V
109dfmpt 5860 . 2  |-  ( w  e.  ( A  X.  B )  |->  [_ ( 1st `  w )  /  x ]_ [_ ( 2nd `  w )  /  y ]_ C )  =  U_ w  e.  ( A  X.  B ) { <. w ,  [_ ( 1st `  w )  /  x ]_ [_ ( 2nd `  w
)  /  y ]_ C >. }
11 nfcv 2386 . . . . 5  |-  F/_ x w
12 nfcsb1v 3174 . . . . 5  |-  F/_ x [_ ( 1st `  w
)  /  x ]_ [_ ( 2nd `  w
)  /  y ]_ C
1311, 12nfop 3904 . . . 4  |-  F/_ x <. w ,  [_ ( 1st `  w )  /  x ]_ [_ ( 2nd `  w )  /  y ]_ C >.
1413nfsn 3754 . . 3  |-  F/_ x { <. w ,  [_ ( 1st `  w )  /  x ]_ [_ ( 2nd `  w )  / 
y ]_ C >. }
15 nfcv 2386 . . . . 5  |-  F/_ y
w
16 nfcv 2386 . . . . . 6  |-  F/_ y
( 1st `  w
)
17 nfcsb1v 3174 . . . . . 6  |-  F/_ y [_ ( 2nd `  w
)  /  y ]_ C
1816, 17nfcsb 3179 . . . . 5  |-  F/_ y [_ ( 1st `  w
)  /  x ]_ [_ ( 2nd `  w
)  /  y ]_ C
1915, 18nfop 3904 . . . 4  |-  F/_ y <. w ,  [_ ( 1st `  w )  /  x ]_ [_ ( 2nd `  w )  /  y ]_ C >.
2019nfsn 3754 . . 3  |-  F/_ y { <. w ,  [_ ( 1st `  w )  /  x ]_ [_ ( 2nd `  w )  / 
y ]_ C >. }
21 nfcv 2386 . . 3  |-  F/_ w { <. <. x ,  y
>. ,  C >. }
22 id 19 . . . . 5  |-  ( w  =  <. x ,  y
>.  ->  w  =  <. x ,  y >. )
23 csbopeq1a 6395 . . . . 5  |-  ( w  =  <. x ,  y
>.  ->  [_ ( 1st `  w
)  /  x ]_ [_ ( 2nd `  w
)  /  y ]_ C  =  C )
2422, 23opeq12d 3896 . . . 4  |-  ( w  =  <. x ,  y
>.  ->  <. w ,  [_ ( 1st `  w )  /  x ]_ [_ ( 2nd `  w )  / 
y ]_ C >.  =  <. <.
x ,  y >. ,  C >. )
2524sneqd 3707 . . 3  |-  ( w  =  <. x ,  y
>.  ->  { <. w ,  [_ ( 1st `  w
)  /  x ]_ [_ ( 2nd `  w
)  /  y ]_ C >. }  =  { <. <. x ,  y
>. ,  C >. } )
2614, 20, 21, 25iunxpf 4908 . 2  |-  U_ w  e.  ( A  X.  B
) { <. w ,  [_ ( 1st `  w
)  /  x ]_ [_ ( 2nd `  w
)  /  y ]_ C >. }  =  U_ x  e.  A  U_ y  e.  B  { <. <. x ,  y >. ,  C >. }
271, 10, 263eqtri 2259 1  |-  ( x  e.  A ,  y  e.  B  |->  C )  =  U_ x  e.  A  U_ y  e.  B  { <. <. x ,  y >. ,  C >. }
Colors of variables: wff set class
Syntax hints:    = wceq 1398    e. wcel 2205   _Vcvv 2815   [_csb 3141   {csn 3694   <.cop 3697   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-reu 2529  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-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator