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

Theorem dfopab2 5843
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 2805 . . . . 5  |-  F/ x [. ( 1st `  z
)  /  x ]. [. ( 2nd `  z
)  /  y ]. ph
2119.41 1592 . . . 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 5841 . . . . . . . 8  |-  ( z  =  <. x ,  y
>.  ->  ( [. ( 1st `  z )  /  x ]. [. ( 2nd `  z )  /  y ]. ph  <->  ph ) )
43pm5.32i 435 . . . . . . 7  |-  ( ( z  =  <. x ,  y >.  /\  [. ( 1st `  z )  /  x ]. [. ( 2nd `  z )  /  y ]. ph )  <->  ( z  =  <. x ,  y
>.  /\  ph ) )
54exbii 1512 . . . . . 6  |-  ( E. y ( z  = 
<. x ,  y >.  /\  [. ( 1st `  z
)  /  x ]. [. ( 2nd `  z
)  /  y ]. ph )  <->  E. y ( z  =  <. x ,  y
>.  /\  ph ) )
6 nfcv 2194 . . . . . . . 8  |-  F/_ y
( 1st `  z
)
7 nfsbc1v 2805 . . . . . . . 8  |-  F/ y
[. ( 2nd `  z
)  /  y ]. ph
86, 7nfsbc 2807 . . . . . . 7  |-  F/ y
[. ( 1st `  z
)  /  x ]. [. ( 2nd `  z
)  /  y ]. ph
9819.41 1592 . . . . . 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 179 . . . . 5  |-  ( E. y ( z  = 
<. x ,  y >.  /\  ph )  <->  ( E. y  z  =  <. x ,  y >.  /\  [. ( 1st `  z )  /  x ]. [. ( 2nd `  z )  /  y ]. ph ) )
1110exbii 1512 . . . 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 4430 . . . . 5  |-  ( z  e.  ( _V  X.  _V )  <->  E. x E. y 
z  =  <. x ,  y >. )
1312anbi1i 439 . . . 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 205 . . 3  |-  ( E. x E. y ( z  =  <. x ,  y >.  /\  ph ) 
<->  ( z  e.  ( _V  X.  _V )  /\  [. ( 1st `  z
)  /  x ]. [. ( 2nd `  z
)  /  y ]. ph ) )
1514abbii 2169 . 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 3847 . 2  |-  { <. x ,  y >.  |  ph }  =  { z  |  E. x E. y
( z  =  <. x ,  y >.  /\  ph ) }
17 df-rab 2332 . 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 2086 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 101    = wceq 1259   E.wex 1397    e. wcel 1409   {cab 2042   {crab 2327   _Vcvv 2574   [.wsbc 2787   <.cop 3406   {copab 3845    X. cxp 4371   ` cfv 4930   1stc1st 5793   2ndc2nd 5794
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-13 1420  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-sep 3903  ax-pow 3955  ax-pr 3972  ax-un 4198
This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-eu 1919  df-mo 1920  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ral 2328  df-rex 2329  df-rab 2332  df-v 2576  df-sbc 2788  df-un 2950  df-in 2952  df-ss 2959  df-pw 3389  df-sn 3409  df-pr 3410  df-op 3412  df-uni 3609  df-br 3793  df-opab 3847  df-mpt 3848  df-id 4058  df-xp 4379  df-rel 4380  df-cnv 4381  df-co 4382  df-dm 4383  df-rn 4384  df-iota 4895  df-fun 4932  df-fv 4938  df-1st 5795  df-2nd 5796
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator