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

Theorem resoprab 5617
Description: Restriction of an operation class abstraction. (Contributed by NM, 10-Feb-2007.)
Assertion
Ref Expression
resoprab  |-  ( {
<. <. x ,  y
>. ,  z >.  | 
ph }  |`  ( A  X.  B ) )  =  { <. <. x ,  y >. ,  z
>.  |  ( (
x  e.  A  /\  y  e.  B )  /\  ph ) }
Distinct variable groups:    x, y, z, A    x, B, y, z
Allowed substitution hints:    ph( x, y, z)

Proof of Theorem resoprab
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 resopab 4672 . . 3  |-  ( {
<. w ,  z >.  |  E. x E. y
( w  =  <. x ,  y >.  /\  ph ) }  |`  ( A  X.  B ) )  =  { <. w ,  z >.  |  ( w  e.  ( A  X.  B )  /\  E. x E. y ( w  =  <. x ,  y >.  /\  ph ) ) }
2 19.42vv 1829 . . . . 5  |-  ( E. x E. y ( w  e.  ( A  X.  B )  /\  ( w  =  <. x ,  y >.  /\  ph ) )  <->  ( w  e.  ( A  X.  B
)  /\  E. x E. y ( w  = 
<. x ,  y >.  /\  ph ) ) )
3 an12 525 . . . . . . 7  |-  ( ( w  e.  ( A  X.  B )  /\  ( w  =  <. x ,  y >.  /\  ph ) )  <->  ( w  =  <. x ,  y
>.  /\  ( w  e.  ( A  X.  B
)  /\  ph ) ) )
4 eleq1 2141 . . . . . . . . . 10  |-  ( w  =  <. x ,  y
>.  ->  ( w  e.  ( A  X.  B
)  <->  <. x ,  y
>.  e.  ( A  X.  B ) ) )
5 opelxp 4392 . . . . . . . . . 10  |-  ( <.
x ,  y >.  e.  ( A  X.  B
)  <->  ( x  e.  A  /\  y  e.  B ) )
64, 5syl6bb 194 . . . . . . . . 9  |-  ( w  =  <. x ,  y
>.  ->  ( w  e.  ( A  X.  B
)  <->  ( x  e.  A  /\  y  e.  B ) ) )
76anbi1d 452 . . . . . . . 8  |-  ( w  =  <. x ,  y
>.  ->  ( ( w  e.  ( A  X.  B )  /\  ph ) 
<->  ( ( x  e.  A  /\  y  e.  B )  /\  ph ) ) )
87pm5.32i 441 . . . . . . 7  |-  ( ( w  =  <. x ,  y >.  /\  (
w  e.  ( A  X.  B )  /\  ph ) )  <->  ( w  =  <. x ,  y
>.  /\  ( ( x  e.  A  /\  y  e.  B )  /\  ph ) ) )
93, 8bitri 182 . . . . . 6  |-  ( ( w  e.  ( A  X.  B )  /\  ( w  =  <. x ,  y >.  /\  ph ) )  <->  ( w  =  <. x ,  y
>.  /\  ( ( x  e.  A  /\  y  e.  B )  /\  ph ) ) )
1092exbii 1537 . . . . 5  |-  ( E. x E. y ( w  e.  ( A  X.  B )  /\  ( w  =  <. x ,  y >.  /\  ph ) )  <->  E. x E. y ( w  = 
<. x ,  y >.  /\  ( ( x  e.  A  /\  y  e.  B )  /\  ph ) ) )
112, 10bitr3i 184 . . . 4  |-  ( ( w  e.  ( A  X.  B )  /\  E. x E. y ( w  =  <. x ,  y >.  /\  ph ) )  <->  E. x E. y ( w  = 
<. x ,  y >.  /\  ( ( x  e.  A  /\  y  e.  B )  /\  ph ) ) )
1211opabbii 3845 . . 3  |-  { <. w ,  z >.  |  ( w  e.  ( A  X.  B )  /\  E. x E. y ( w  =  <. x ,  y >.  /\  ph ) ) }  =  { <. w ,  z
>.  |  E. x E. y ( w  = 
<. x ,  y >.  /\  ( ( x  e.  A  /\  y  e.  B )  /\  ph ) ) }
131, 12eqtri 2101 . 2  |-  ( {
<. w ,  z >.  |  E. x E. y
( w  =  <. x ,  y >.  /\  ph ) }  |`  ( A  X.  B ) )  =  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ( ( x  e.  A  /\  y  e.  B )  /\  ph ) ) }
14 dfoprab2 5572 . . 3  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) }
1514reseq1i 4626 . 2  |-  ( {
<. <. x ,  y
>. ,  z >.  | 
ph }  |`  ( A  X.  B ) )  =  ( { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) }  |`  ( A  X.  B
) )
16 dfoprab2 5572 . 2  |-  { <. <.
x ,  y >. ,  z >.  |  ( ( x  e.  A  /\  y  e.  B
)  /\  ph ) }  =  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ( ( x  e.  A  /\  y  e.  B )  /\  ph ) ) }
1713, 15, 163eqtr4i 2111 1  |-  ( {
<. <. x ,  y
>. ,  z >.  | 
ph }  |`  ( A  X.  B ) )  =  { <. <. x ,  y >. ,  z
>.  |  ( (
x  e.  A  /\  y  e.  B )  /\  ph ) }
Colors of variables: wff set class
Syntax hints:    /\ wa 102    = wceq 1284   E.wex 1421    e. wcel 1433   <.cop 3401   {copab 3838    X. cxp 4361    |` cres 4365   {coprab 5533
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-opab 3840  df-xp 4369  df-rel 4370  df-res 4375  df-oprab 5536
This theorem is referenced by:  resoprab2  5618
  Copyright terms: Public domain W3C validator