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

Theorem resoprab 6174
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 5102 . . 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 1967 . . . . 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 567 . . . . . . 7  |-  ( ( w  e.  ( A  X.  B )  /\  ( w  =  <. x ,  y >.  /\  ph ) )  <->  ( w  =  <. x ,  y
>.  /\  ( w  e.  ( A  X.  B
)  /\  ph ) ) )
4 eleq1 2301 . . . . . . . . . 10  |-  ( w  =  <. x ,  y
>.  ->  ( w  e.  ( A  X.  B
)  <->  <. x ,  y
>.  e.  ( A  X.  B ) ) )
5 opelxp 4799 . . . . . . . . . 10  |-  ( <.
x ,  y >.  e.  ( A  X.  B
)  <->  ( x  e.  A  /\  y  e.  B ) )
64, 5bitrdi 196 . . . . . . . . 9  |-  ( w  =  <. x ,  y
>.  ->  ( w  e.  ( A  X.  B
)  <->  ( x  e.  A  /\  y  e.  B ) ) )
76anbi1d 469 . . . . . . . 8  |-  ( w  =  <. x ,  y
>.  ->  ( ( w  e.  ( A  X.  B )  /\  ph ) 
<->  ( ( x  e.  A  /\  y  e.  B )  /\  ph ) ) )
87pm5.32i 458 . . . . . . 7  |-  ( ( w  =  <. x ,  y >.  /\  (
w  e.  ( A  X.  B )  /\  ph ) )  <->  ( w  =  <. x ,  y
>.  /\  ( ( x  e.  A  /\  y  e.  B )  /\  ph ) ) )
93, 8bitri 184 . . . . . 6  |-  ( ( w  e.  ( A  X.  B )  /\  ( w  =  <. x ,  y >.  /\  ph ) )  <->  ( w  =  <. x ,  y
>.  /\  ( ( x  e.  A  /\  y  e.  B )  /\  ph ) ) )
1092exbii 1659 . . . . 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 186 . . . 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 4193 . . 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 2259 . 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 6125 . . 3  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) }
1514reseq1i 5054 . 2  |-  ( {
<. <. x ,  y
>. ,  z >.  | 
ph }  |`  ( A  X.  B ) )  =  ( { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) }  |`  ( A  X.  B
) )
16 dfoprab2 6125 . 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 2269 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 104    = wceq 1402   E.wex 1545    e. wcel 2209   <.cop 3708   {copab 4186    X. cxp 4767    |` cres 4771   {coprab 6076
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-opab 4188  df-xp 4775  df-rel 4776  df-res 4781  df-oprab 6079
This theorem is referenced by:  resoprab2  6175
  Copyright terms: Public domain W3C validator