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

Theorem dfopab2 6190
Description: A way to define an ordered-pair class abstraction without using existential quantifiers. (Contributed by NM, 18-Aug-2006.) (Revised by Mario Carneiro, 31-Aug-2015.)
Assertion
Ref Expression
dfopab2  |-  { <. x ,  y >.  |  ph }  =  { z  e.  ( _V  X.  _V )  |  [. ( 1st `  z )  /  x ]. [. ( 2nd `  z
)  /  y ]. ph }
Distinct variable groups:    ph, z    x, y, z
Allowed substitution hints:    ph( x, y)

Proof of Theorem dfopab2
StepHypRef Expression
1 nfsbc1v 3023 . . . . 5  |-  F/ x [. ( 1st `  z
)  /  x ]. [. ( 2nd `  z
)  /  y ]. ph
2119.41 1827 . . . 4  |-  ( E. x ( E. y 
z  =  <. x ,  y >.  /\  [. ( 1st `  z )  /  x ]. [. ( 2nd `  z )  /  y ]. ph )  <->  ( E. x E. y  z  = 
<. x ,  y >.  /\  [. ( 1st `  z
)  /  x ]. [. ( 2nd `  z
)  /  y ]. ph ) )
3 sbcopeq1a 6188 . . . . . . . 8  |-  ( z  =  <. x ,  y
>.  ->  ( [. ( 1st `  z )  /  x ]. [. ( 2nd `  z )  /  y ]. ph  <->  ph ) )
43pm5.32i 618 . . . . . . 7  |-  ( ( z  =  <. x ,  y >.  /\  [. ( 1st `  z )  /  x ]. [. ( 2nd `  z )  /  y ]. ph )  <->  ( z  =  <. x ,  y
>.  /\  ph ) )
54exbii 1572 . . . . . 6  |-  ( E. y ( z  = 
<. x ,  y >.  /\  [. ( 1st `  z
)  /  x ]. [. ( 2nd `  z
)  /  y ]. ph )  <->  E. y ( z  =  <. x ,  y
>.  /\  ph ) )
6 nfcv 2432 . . . . . . . 8  |-  F/_ y
( 1st `  z
)
7 nfsbc1v 3023 . . . . . . . 8  |-  F/ y
[. ( 2nd `  z
)  /  y ]. ph
86, 7nfsbc 3025 . . . . . . 7  |-  F/ y
[. ( 1st `  z
)  /  x ]. [. ( 2nd `  z
)  /  y ]. ph
9819.41 1827 . . . . . 6  |-  ( E. y ( z  = 
<. x ,  y >.  /\  [. ( 1st `  z
)  /  x ]. [. ( 2nd `  z
)  /  y ]. ph )  <->  ( E. y 
z  =  <. x ,  y >.  /\  [. ( 1st `  z )  /  x ]. [. ( 2nd `  z )  /  y ]. ph ) )
105, 9bitr3i 242 . . . . 5  |-  ( E. y ( z  = 
<. x ,  y >.  /\  ph )  <->  ( E. y  z  =  <. x ,  y >.  /\  [. ( 1st `  z )  /  x ]. [. ( 2nd `  z )  /  y ]. ph ) )
1110exbii 1572 . . . 4  |-  ( E. x E. y ( z  =  <. x ,  y >.  /\  ph ) 
<->  E. x ( E. y  z  =  <. x ,  y >.  /\  [. ( 1st `  z )  /  x ]. [. ( 2nd `  z )  /  y ]. ph ) )
12 elvv 4764 . . . . 5  |-  ( z  e.  ( _V  X.  _V )  <->  E. x E. y 
z  =  <. x ,  y >. )
1312anbi1i 676 . . . 4  |-  ( ( z  e.  ( _V 
X.  _V )  /\  [. ( 1st `  z )  /  x ]. [. ( 2nd `  z )  /  y ]. ph )  <->  ( E. x E. y  z  = 
<. x ,  y >.  /\  [. ( 1st `  z
)  /  x ]. [. ( 2nd `  z
)  /  y ]. ph ) )
142, 11, 133bitr4i 268 . . 3  |-  ( E. x E. y ( z  =  <. x ,  y >.  /\  ph ) 
<->  ( z  e.  ( _V  X.  _V )  /\  [. ( 1st `  z
)  /  x ]. [. ( 2nd `  z
)  /  y ]. ph ) )
1514abbii 2408 . 2  |-  { z  |  E. x E. y ( z  = 
<. x ,  y >.  /\  ph ) }  =  { z  |  ( z  e.  ( _V 
X.  _V )  /\  [. ( 1st `  z )  /  x ]. [. ( 2nd `  z )  /  y ]. ph ) }
16 df-opab 4094 . 2  |-  { <. x ,  y >.  |  ph }  =  { z  |  E. x E. y
( z  =  <. x ,  y >.  /\  ph ) }
17 df-rab 2565 . 2  |-  { z  e.  ( _V  X.  _V )  |  [. ( 1st `  z )  /  x ]. [. ( 2nd `  z )  /  y ]. ph }  =  {
z  |  ( z  e.  ( _V  X.  _V )  /\  [. ( 1st `  z )  /  x ]. [. ( 2nd `  z )  /  y ]. ph ) }
1815, 16, 173eqtr4i 2326 1  |-  { <. x ,  y >.  |  ph }  =  { z  e.  ( _V  X.  _V )  |  [. ( 1st `  z )  /  x ]. [. ( 2nd `  z
)  /  y ]. ph }
Colors of variables: wff set class
Syntax hints:    /\ wa 358   E.wex 1531    = wceq 1632    e. wcel 1696   {cab 2282   {crab 2560   _Vcvv 2801   [.wsbc 3004   <.cop 3656   {copab 4092    X. cxp 4703   ` cfv 5271   1stc1st 6136   2ndc2nd 6137
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-sbc 3005  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-br 4040  df-opab 4094  df-mpt 4095  df-id 4325  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-iota 5235  df-fun 5273  df-fv 5279  df-1st 6138  df-2nd 6139
  Copyright terms: Public domain W3C validator