MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dfoprab3 Unicode version

Theorem dfoprab3 6342
Description: Operation class abstraction expressed without existential quantifiers. (Contributed by NM, 16-Dec-2008.)
Hypothesis
Ref Expression
dfoprab3.1  |-  ( w  =  <. x ,  y
>.  ->  ( ph  <->  ps )
)
Assertion
Ref Expression
dfoprab3  |-  { <. w ,  z >.  |  ( w  e.  ( _V 
X.  _V )  /\  ph ) }  =  { <. <. x ,  y
>. ,  z >.  |  ps }
Distinct variable groups:    x, y, ph    ps, w    x, z, w, y
Allowed substitution hints:    ph( z, w)    ps( x, y, z)

Proof of Theorem dfoprab3
StepHypRef Expression
1 dfoprab3s 6341 . 2  |-  { <. <.
x ,  y >. ,  z >.  |  ps }  =  { <. w ,  z >.  |  ( w  e.  ( _V 
X.  _V )  /\  [. ( 1st `  w )  /  x ]. [. ( 2nd `  w )  /  y ]. ps ) }
2 fvex 5682 . . . . 5  |-  ( 1st `  w )  e.  _V
3 fvex 5682 . . . . 5  |-  ( 2nd `  w )  e.  _V
4 eqcom 2389 . . . . . . . . . 10  |-  ( x  =  ( 1st `  w
)  <->  ( 1st `  w
)  =  x )
5 eqcom 2389 . . . . . . . . . 10  |-  ( y  =  ( 2nd `  w
)  <->  ( 2nd `  w
)  =  y )
64, 5anbi12i 679 . . . . . . . . 9  |-  ( ( x  =  ( 1st `  w )  /\  y  =  ( 2nd `  w
) )  <->  ( ( 1st `  w )  =  x  /\  ( 2nd `  w )  =  y ) )
7 eqopi 6322 . . . . . . . . 9  |-  ( ( w  e.  ( _V 
X.  _V )  /\  (
( 1st `  w
)  =  x  /\  ( 2nd `  w )  =  y ) )  ->  w  =  <. x ,  y >. )
86, 7sylan2b 462 . . . . . . . 8  |-  ( ( w  e.  ( _V 
X.  _V )  /\  (
x  =  ( 1st `  w )  /\  y  =  ( 2nd `  w
) ) )  ->  w  =  <. x ,  y >. )
9 dfoprab3.1 . . . . . . . 8  |-  ( w  =  <. x ,  y
>.  ->  ( ph  <->  ps )
)
108, 9syl 16 . . . . . . 7  |-  ( ( w  e.  ( _V 
X.  _V )  /\  (
x  =  ( 1st `  w )  /\  y  =  ( 2nd `  w
) ) )  -> 
( ph  <->  ps ) )
1110bicomd 193 . . . . . 6  |-  ( ( w  e.  ( _V 
X.  _V )  /\  (
x  =  ( 1st `  w )  /\  y  =  ( 2nd `  w
) ) )  -> 
( ps  <->  ph ) )
1211ex 424 . . . . 5  |-  ( w  e.  ( _V  X.  _V )  ->  ( ( x  =  ( 1st `  w )  /\  y  =  ( 2nd `  w
) )  ->  ( ps 
<-> 
ph ) ) )
132, 3, 12sbc2iedv 3172 . . . 4  |-  ( w  e.  ( _V  X.  _V )  ->  ( [. ( 1st `  w )  /  x ]. [. ( 2nd `  w )  / 
y ]. ps  <->  ph ) )
1413pm5.32i 619 . . 3  |-  ( ( w  e.  ( _V 
X.  _V )  /\  [. ( 1st `  w )  /  x ]. [. ( 2nd `  w )  /  y ]. ps )  <->  ( w  e.  ( _V  X.  _V )  /\  ph ) )
1514opabbii 4213 . 2  |-  { <. w ,  z >.  |  ( w  e.  ( _V 
X.  _V )  /\  [. ( 1st `  w )  /  x ]. [. ( 2nd `  w )  /  y ]. ps ) }  =  { <. w ,  z
>.  |  ( w  e.  ( _V  X.  _V )  /\  ph ) }
161, 15eqtr2i 2408 1  |-  { <. w ,  z >.  |  ( w  e.  ( _V 
X.  _V )  /\  ph ) }  =  { <. <. x ,  y
>. ,  z >.  |  ps }
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177    /\ wa 359    = wceq 1649    e. wcel 1717   _Vcvv 2899   [.wsbc 3104   <.cop 3760   {copab 4206    X. cxp 4816   ` cfv 5394   {coprab 6021   1stc1st 6286   2ndc2nd 6287
This theorem is referenced by:  dfoprab4  6343  df1st2  6372  df2nd2  6373
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-13 1719  ax-14 1721  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2368  ax-sep 4271  ax-nul 4279  ax-pow 4318  ax-pr 4344  ax-un 4641
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2242  df-mo 2243  df-clab 2374  df-cleq 2380  df-clel 2383  df-nfc 2512  df-ne 2552  df-ral 2654  df-rex 2655  df-rab 2658  df-v 2901  df-sbc 3105  df-dif 3266  df-un 3268  df-in 3270  df-ss 3277  df-nul 3572  df-if 3683  df-sn 3763  df-pr 3764  df-op 3766  df-uni 3958  df-br 4154  df-opab 4208  df-mpt 4209  df-id 4439  df-xp 4824  df-rel 4825  df-cnv 4826  df-co 4827  df-dm 4828  df-rn 4829  df-iota 5358  df-fun 5396  df-fv 5402  df-oprab 6024  df-1st 6288  df-2nd 6289
  Copyright terms: Public domain W3C validator