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

Theorem dfoprab3s 6352
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 6067 . 2  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) }
2 nfsbc1v 3050 . . . . 5  |-  F/ x [. ( 1st `  w
)  /  x ]. [. ( 2nd `  w
)  /  y ]. ph
3219.41 1734 . . . 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 6349 . . . . . . . 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 1653 . . . . . 6  |-  ( E. y ( w  = 
<. x ,  y >.  /\  [. ( 1st `  w
)  /  x ]. [. ( 2nd `  w
)  /  y ]. ph )  <->  E. y ( w  =  <. x ,  y
>.  /\  ph ) )
7 nfcv 2374 . . . . . . . 8  |-  F/_ y
( 1st `  w
)
8 nfsbc1v 3050 . . . . . . . 8  |-  F/ y
[. ( 2nd `  w
)  /  y ]. ph
97, 8nfsbc 3052 . . . . . . 7  |-  F/ y
[. ( 1st `  w
)  /  x ]. [. ( 2nd `  w
)  /  y ]. ph
10919.41 1734 . . . . . 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 1653 . . . 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 4788 . . . . 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 4156 . 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 2252 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 1397   E.wex 1540    e. wcel 2202   _Vcvv 2802   [.wsbc 3031   <.cop 3672   {copab 4149    X. cxp 4723   ` cfv 5326   {coprab 6018   1stc1st 6300   2ndc2nd 6301
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-sbc 3032  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-iota 5286  df-fun 5328  df-fv 5334  df-oprab 6021  df-1st 6302  df-2nd 6303
This theorem is referenced by:  dfoprab3  6353
  Copyright terms: Public domain W3C validator