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

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

Proof of Theorem dfoprab3s
StepHypRef Expression
1 dfoprab2 5992 . 2  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) }
2 nfsbc1v 3017 . . . . 5  |-  F/ x [. ( 1st `  w
)  /  x ]. [. ( 2nd `  w
)  /  y ]. ph
3219.41 1709 . . . 4  |-  ( E. x ( E. y  w  =  <. x ,  y >.  /\  [. ( 1st `  w )  /  x ]. [. ( 2nd `  w )  /  y ]. ph )  <->  ( E. x E. y  w  = 
<. x ,  y >.  /\  [. ( 1st `  w
)  /  x ]. [. ( 2nd `  w
)  /  y ]. ph ) )
4 sbcopeq1a 6273 . . . . . . . 8  |-  ( w  =  <. x ,  y
>.  ->  ( [. ( 1st `  w )  /  x ]. [. ( 2nd `  w )  /  y ]. ph  <->  ph ) )
54pm5.32i 454 . . . . . . 7  |-  ( ( w  =  <. x ,  y >.  /\  [. ( 1st `  w )  /  x ]. [. ( 2nd `  w )  /  y ]. ph )  <->  ( w  =  <. x ,  y
>.  /\  ph ) )
65exbii 1628 . . . . . 6  |-  ( E. y ( w  = 
<. x ,  y >.  /\  [. ( 1st `  w
)  /  x ]. [. ( 2nd `  w
)  /  y ]. ph )  <->  E. y ( w  =  <. x ,  y
>.  /\  ph ) )
7 nfcv 2348 . . . . . . . 8  |-  F/_ y
( 1st `  w
)
8 nfsbc1v 3017 . . . . . . . 8  |-  F/ y
[. ( 2nd `  w
)  /  y ]. ph
97, 8nfsbc 3019 . . . . . . 7  |-  F/ y
[. ( 1st `  w
)  /  x ]. [. ( 2nd `  w
)  /  y ]. ph
10919.41 1709 . . . . . 6  |-  ( E. y ( w  = 
<. x ,  y >.  /\  [. ( 1st `  w
)  /  x ]. [. ( 2nd `  w
)  /  y ]. ph )  <->  ( E. y  w  =  <. x ,  y >.  /\  [. ( 1st `  w )  /  x ]. [. ( 2nd `  w )  /  y ]. ph ) )
116, 10bitr3i 186 . . . . 5  |-  ( E. y ( w  = 
<. x ,  y >.  /\  ph )  <->  ( E. y  w  =  <. x ,  y >.  /\  [. ( 1st `  w )  /  x ]. [. ( 2nd `  w )  /  y ]. ph ) )
1211exbii 1628 . . . 4  |-  ( E. x E. y ( w  =  <. x ,  y >.  /\  ph ) 
<->  E. x ( E. y  w  =  <. x ,  y >.  /\  [. ( 1st `  w )  /  x ]. [. ( 2nd `  w )  /  y ]. ph ) )
13 elvv 4737 . . . . 5  |-  ( w  e.  ( _V  X.  _V )  <->  E. x E. y  w  =  <. x ,  y >. )
1413anbi1i 458 . . . 4  |-  ( ( w  e.  ( _V 
X.  _V )  /\  [. ( 1st `  w )  /  x ]. [. ( 2nd `  w )  /  y ]. ph )  <->  ( E. x E. y  w  = 
<. x ,  y >.  /\  [. ( 1st `  w
)  /  x ]. [. ( 2nd `  w
)  /  y ]. ph ) )
153, 12, 143bitr4i 212 . . 3  |-  ( E. x E. y ( w  =  <. x ,  y >.  /\  ph ) 
<->  ( w  e.  ( _V  X.  _V )  /\  [. ( 1st `  w
)  /  x ]. [. ( 2nd `  w
)  /  y ]. ph ) )
1615opabbii 4111 . 2  |-  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) }  =  { <. w ,  z >.  |  ( w  e.  ( _V 
X.  _V )  /\  [. ( 1st `  w )  /  x ]. [. ( 2nd `  w )  /  y ]. ph ) }
171, 16eqtri 2226 1  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. w ,  z >.  |  ( w  e.  ( _V 
X.  _V )  /\  [. ( 1st `  w )  /  x ]. [. ( 2nd `  w )  /  y ]. ph ) }
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1373   E.wex 1515    e. wcel 2176   _Vcvv 2772   [.wsbc 2998   <.cop 3636   {copab 4104    X. cxp 4673   ` cfv 5271   {coprab 5945   1stc1st 6224   2ndc2nd 6225
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253  ax-un 4480
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-v 2774  df-sbc 2999  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-br 4045  df-opab 4106  df-mpt 4107  df-id 4340  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-iota 5232  df-fun 5273  df-fv 5279  df-oprab 5948  df-1st 6226  df-2nd 6227
This theorem is referenced by:  dfoprab3  6277
  Copyright terms: Public domain W3C validator