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

Theorem resoprab 5949
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 4935 . . 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 1904 . . . . 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 556 . . . . . . 7  |-  ( ( w  e.  ( A  X.  B )  /\  ( w  =  <. x ,  y >.  /\  ph ) )  <->  ( w  =  <. x ,  y
>.  /\  ( w  e.  ( A  X.  B
)  /\  ph ) ) )
4 eleq1 2233 . . . . . . . . . 10  |-  ( w  =  <. x ,  y
>.  ->  ( w  e.  ( A  X.  B
)  <->  <. x ,  y
>.  e.  ( A  X.  B ) ) )
5 opelxp 4641 . . . . . . . . . 10  |-  ( <.
x ,  y >.  e.  ( A  X.  B
)  <->  ( x  e.  A  /\  y  e.  B ) )
64, 5bitrdi 195 . . . . . . . . 9  |-  ( w  =  <. x ,  y
>.  ->  ( w  e.  ( A  X.  B
)  <->  ( x  e.  A  /\  y  e.  B ) ) )
76anbi1d 462 . . . . . . . 8  |-  ( w  =  <. x ,  y
>.  ->  ( ( w  e.  ( A  X.  B )  /\  ph ) 
<->  ( ( x  e.  A  /\  y  e.  B )  /\  ph ) ) )
87pm5.32i 451 . . . . . . 7  |-  ( ( w  =  <. x ,  y >.  /\  (
w  e.  ( A  X.  B )  /\  ph ) )  <->  ( w  =  <. x ,  y
>.  /\  ( ( x  e.  A  /\  y  e.  B )  /\  ph ) ) )
93, 8bitri 183 . . . . . 6  |-  ( ( w  e.  ( A  X.  B )  /\  ( w  =  <. x ,  y >.  /\  ph ) )  <->  ( w  =  <. x ,  y
>.  /\  ( ( x  e.  A  /\  y  e.  B )  /\  ph ) ) )
1092exbii 1599 . . . . 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 185 . . . 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 4056 . . 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 2191 . 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 5900 . . 3  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) }
1514reseq1i 4887 . 2  |-  ( {
<. <. x ,  y
>. ,  z >.  | 
ph }  |`  ( A  X.  B ) )  =  ( { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) }  |`  ( A  X.  B
) )
16 dfoprab2 5900 . 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 2201 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 103    = wceq 1348   E.wex 1485    e. wcel 2141   <.cop 3586   {copab 4049    X. cxp 4609    |` cres 4613   {coprab 5854
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-opab 4051  df-xp 4617  df-rel 4618  df-res 4623  df-oprab 5857
This theorem is referenced by:  resoprab2  5950
  Copyright terms: Public domain W3C validator