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

Theorem resoprab 5860
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 4858 . . 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 1883 . . . . 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 550 . . . . . . 7  |-  ( ( w  e.  ( A  X.  B )  /\  ( w  =  <. x ,  y >.  /\  ph ) )  <->  ( w  =  <. x ,  y
>.  /\  ( w  e.  ( A  X.  B
)  /\  ph ) ) )
4 eleq1 2200 . . . . . . . . . 10  |-  ( w  =  <. x ,  y
>.  ->  ( w  e.  ( A  X.  B
)  <->  <. x ,  y
>.  e.  ( A  X.  B ) ) )
5 opelxp 4564 . . . . . . . . . 10  |-  ( <.
x ,  y >.  e.  ( A  X.  B
)  <->  ( x  e.  A  /\  y  e.  B ) )
64, 5syl6bb 195 . . . . . . . . 9  |-  ( w  =  <. x ,  y
>.  ->  ( w  e.  ( A  X.  B
)  <->  ( x  e.  A  /\  y  e.  B ) ) )
76anbi1d 460 . . . . . . . 8  |-  ( w  =  <. x ,  y
>.  ->  ( ( w  e.  ( A  X.  B )  /\  ph ) 
<->  ( ( x  e.  A  /\  y  e.  B )  /\  ph ) ) )
87pm5.32i 449 . . . . . . 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 1585 . . . . 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 3990 . . 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 2158 . 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 5811 . . 3  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) }
1514reseq1i 4810 . 2  |-  ( {
<. <. x ,  y
>. ,  z >.  | 
ph }  |`  ( A  X.  B ) )  =  ( { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) }  |`  ( A  X.  B
) )
16 dfoprab2 5811 . 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 2168 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 1331   E.wex 1468    e. wcel 1480   <.cop 3525   {copab 3983    X. cxp 4532    |` cres 4536   {coprab 5768
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-opab 3985  df-xp 4540  df-rel 4541  df-res 4546  df-oprab 5771
This theorem is referenced by:  resoprab2  5861
  Copyright terms: Public domain W3C validator