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

Theorem resopab 5102
Description: Restriction of a class abstraction of ordered pairs. (Contributed by NM, 5-Nov-2002.)
Assertion
Ref Expression
resopab  |-  ( {
<. x ,  y >.  |  ph }  |`  A )  =  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }
Distinct variable group:    x, y, A
Allowed substitution hints:    ph( x, y)

Proof of Theorem resopab
StepHypRef Expression
1 df-res 4781 . 2  |-  ( {
<. x ,  y >.  |  ph }  |`  A )  =  ( { <. x ,  y >.  |  ph }  i^i  ( A  X.  _V ) )
2 df-xp 4775 . . . . . 6  |-  ( A  X.  _V )  =  { <. x ,  y
>.  |  ( x  e.  A  /\  y  e.  _V ) }
3 vex 2824 . . . . . . . 8  |-  y  e. 
_V
43biantru 302 . . . . . . 7  |-  ( x  e.  A  <->  ( x  e.  A  /\  y  e.  _V ) )
54opabbii 4193 . . . . . 6  |-  { <. x ,  y >.  |  x  e.  A }  =  { <. x ,  y
>.  |  ( x  e.  A  /\  y  e.  _V ) }
62, 5eqtr4i 2262 . . . . 5  |-  ( A  X.  _V )  =  { <. x ,  y
>.  |  x  e.  A }
76ineq2i 3429 . . . 4  |-  ( {
<. x ,  y >.  |  ph }  i^i  ( A  X.  _V ) )  =  ( { <. x ,  y >.  |  ph }  i^i  { <. x ,  y >.  |  x  e.  A } )
8 incom 3421 . . . 4  |-  ( {
<. x ,  y >.  |  ph }  i^i  { <. x ,  y >.  |  x  e.  A } )  =  ( { <. x ,  y
>.  |  x  e.  A }  i^i  { <. x ,  y >.  |  ph } )
97, 8eqtri 2259 . . 3  |-  ( {
<. x ,  y >.  |  ph }  i^i  ( A  X.  _V ) )  =  ( { <. x ,  y >.  |  x  e.  A }  i^i  {
<. x ,  y >.  |  ph } )
10 inopab 4907 . . 3  |-  ( {
<. x ,  y >.  |  x  e.  A }  i^i  { <. x ,  y >.  |  ph } )  =  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }
119, 10eqtri 2259 . 2  |-  ( {
<. x ,  y >.  |  ph }  i^i  ( A  X.  _V ) )  =  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }
121, 11eqtri 2259 1  |-  ( {
<. x ,  y >.  |  ph }  |`  A )  =  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1402    e. wcel 2209   _Vcvv 2821    i^i cin 3219   {copab 4186    X. cxp 4767    |` cres 4771
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
This theorem is referenced by:  resopab2  5105  opabresid  5111  mptpreima  5276  isarep2  5463  resoprab  6174  df1st2  6445  df2nd2  6446
  Copyright terms: Public domain W3C validator