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

Theorem dfres2 5011
Description: Alternate definition of the restriction operation. (Contributed by Mario Carneiro, 5-Nov-2013.)
Assertion
Ref Expression
dfres2  |-  ( R  |`  A )  =  { <. x ,  y >.  |  ( x  e.  A  /\  x R y ) }
Distinct variable groups:    x, y, A   
x, R, y

Proof of Theorem dfres2
Dummy variables  w  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relres 4987 . 2  |-  Rel  ( R  |`  A )
2 relopab 4804 . 2  |-  Rel  { <. x ,  y >.  |  ( x  e.  A  /\  x R y ) }
3 vex 2775 . . . . 5  |-  w  e. 
_V
43brres 4965 . . . 4  |-  ( z ( R  |`  A ) w  <->  ( z R w  /\  z  e.  A ) )
5 df-br 4045 . . . 4  |-  ( z ( R  |`  A ) w  <->  <. z ,  w >.  e.  ( R  |`  A ) )
6 ancom 266 . . . 4  |-  ( ( z R w  /\  z  e.  A )  <->  ( z  e.  A  /\  z R w ) )
74, 5, 63bitr3i 210 . . 3  |-  ( <.
z ,  w >.  e.  ( R  |`  A )  <-> 
( z  e.  A  /\  z R w ) )
8 vex 2775 . . . 4  |-  z  e. 
_V
9 eleq1 2268 . . . . 5  |-  ( x  =  z  ->  (
x  e.  A  <->  z  e.  A ) )
10 breq1 4047 . . . . 5  |-  ( x  =  z  ->  (
x R y  <->  z R
y ) )
119, 10anbi12d 473 . . . 4  |-  ( x  =  z  ->  (
( x  e.  A  /\  x R y )  <-> 
( z  e.  A  /\  z R y ) ) )
12 breq2 4048 . . . . 5  |-  ( y  =  w  ->  (
z R y  <->  z R w ) )
1312anbi2d 464 . . . 4  |-  ( y  =  w  ->  (
( z  e.  A  /\  z R y )  <-> 
( z  e.  A  /\  z R w ) ) )
148, 3, 11, 13opelopab 4318 . . 3  |-  ( <.
z ,  w >.  e. 
{ <. x ,  y
>.  |  ( x  e.  A  /\  x R y ) }  <-> 
( z  e.  A  /\  z R w ) )
157, 14bitr4i 187 . 2  |-  ( <.
z ,  w >.  e.  ( R  |`  A )  <->  <. z ,  w >.  e. 
{ <. x ,  y
>.  |  ( x  e.  A  /\  x R y ) } )
161, 2, 15eqrelriiv 4769 1  |-  ( R  |`  A )  =  { <. x ,  y >.  |  ( x  e.  A  /\  x R y ) }
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1373    e. wcel 2176   <.cop 3636   class class class wbr 4044   {copab 4104    |` cres 4677
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-v 2774  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-br 4045  df-opab 4106  df-xp 4681  df-rel 4682  df-res 4687
This theorem is referenced by:  shftidt2  11143
  Copyright terms: Public domain W3C validator