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

Theorem dfmpt2 5864
Description: Alternate definition for the "maps to" notation df-mpt2 5537 (although it requires that  C be a set). (Contributed by NM, 19-Dec-2008.) (Revised by Mario Carneiro, 31-Aug-2015.)
Hypothesis
Ref Expression
dfmpt2.1  |-  C  e. 
_V
Assertion
Ref Expression
dfmpt2  |-  ( 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 dfmpt2
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 mpt2mpts 5844 . 2  |-  ( x  e.  A ,  y  e.  B  |->  C )  =  ( w  e.  ( A  X.  B
)  |->  [_ ( 1st `  w
)  /  x ]_ [_ ( 2nd `  w
)  /  y ]_ C )
2 vex 2604 . . . . 5  |-  w  e. 
_V
3 1stexg 5814 . . . . 5  |-  ( w  e.  _V  ->  ( 1st `  w )  e. 
_V )
42, 3ax-mp 7 . . . 4  |-  ( 1st `  w )  e.  _V
5 2ndexg 5815 . . . . . 6  |-  ( w  e.  _V  ->  ( 2nd `  w )  e. 
_V )
62, 5ax-mp 7 . . . . 5  |-  ( 2nd `  w )  e.  _V
7 dfmpt2.1 . . . . 5  |-  C  e. 
_V
86, 7csbexa 3907 . . . 4  |-  [_ ( 2nd `  w )  / 
y ]_ C  e.  _V
94, 8csbexa 3907 . . 3  |-  [_ ( 1st `  w )  /  x ]_ [_ ( 2nd `  w )  /  y ]_ C  e.  _V
109dfmpt 5361 . 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 2219 . . . . 5  |-  F/_ x w
12 nfcsb1v 2938 . . . . 5  |-  F/_ x [_ ( 1st `  w
)  /  x ]_ [_ ( 2nd `  w
)  /  y ]_ C
1311, 12nfop 3586 . . . 4  |-  F/_ x <. w ,  [_ ( 1st `  w )  /  x ]_ [_ ( 2nd `  w )  /  y ]_ C >.
1413nfsn 3452 . . 3  |-  F/_ x { <. w ,  [_ ( 1st `  w )  /  x ]_ [_ ( 2nd `  w )  / 
y ]_ C >. }
15 nfcv 2219 . . . . 5  |-  F/_ y
w
16 nfcv 2219 . . . . . 6  |-  F/_ y
( 1st `  w
)
17 nfcsb1v 2938 . . . . . 6  |-  F/_ y [_ ( 2nd `  w
)  /  y ]_ C
1816, 17nfcsb 2940 . . . . 5  |-  F/_ y [_ ( 1st `  w
)  /  x ]_ [_ ( 2nd `  w
)  /  y ]_ C
1915, 18nfop 3586 . . . 4  |-  F/_ y <. w ,  [_ ( 1st `  w )  /  x ]_ [_ ( 2nd `  w )  /  y ]_ C >.
2019nfsn 3452 . . 3  |-  F/_ y { <. w ,  [_ ( 1st `  w )  /  x ]_ [_ ( 2nd `  w )  / 
y ]_ C >. }
21 nfcv 2219 . . 3  |-  F/_ w { <. <. x ,  y
>. ,  C >. }
22 id 19 . . . . 5  |-  ( w  =  <. x ,  y
>.  ->  w  =  <. x ,  y >. )
23 csbopeq1a 5834 . . . . 5  |-  ( w  =  <. x ,  y
>.  ->  [_ ( 1st `  w
)  /  x ]_ [_ ( 2nd `  w
)  /  y ]_ C  =  C )
2422, 23opeq12d 3578 . . . 4  |-  ( w  =  <. x ,  y
>.  ->  <. w ,  [_ ( 1st `  w )  /  x ]_ [_ ( 2nd `  w )  / 
y ]_ C >.  =  <. <.
x ,  y >. ,  C >. )
2524sneqd 3411 . . 3  |-  ( w  =  <. x ,  y
>.  ->  { <. w ,  [_ ( 1st `  w
)  /  x ]_ [_ ( 2nd `  w
)  /  y ]_ C >. }  =  { <. <. x ,  y
>. ,  C >. } )
2614, 20, 21, 25iunxpf 4502 . 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 2105 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 1284    e. wcel 1433   _Vcvv 2601   [_csb 2908   {csn 3398   <.cop 3401   U_ciun 3678    |-> cmpt 3839    X. cxp 4361   ` cfv 4922    |-> cmpt2 5534   1stc1st 5785   2ndc2nd 5786
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964  ax-un 4188
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-reu 2355  df-v 2603  df-sbc 2816  df-csb 2909  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-iun 3680  df-br 3786  df-opab 3840  df-mpt 3841  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930  df-oprab 5536  df-mpt2 5537  df-1st 5787  df-2nd 5788
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator