MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  opres Unicode version

Theorem opres 5088
Description: Ordered pair membership in a restriction when the first member belongs to the restricting class. (Contributed by NM, 30-Apr-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
Hypothesis
Ref Expression
opres.1  |-  B  e. 
_V
Assertion
Ref Expression
opres  |-  ( A  e.  D  ->  ( <. A ,  B >.  e.  ( C  |`  D )  <->  <. A ,  B >.  e.  C ) )

Proof of Theorem opres
StepHypRef Expression
1 opres.1 . . 3  |-  B  e. 
_V
21opelres 5084 . 2  |-  ( <. A ,  B >.  e.  ( C  |`  D )  <-> 
( <. A ,  B >.  e.  C  /\  A  e.  D ) )
32rbaib 874 1  |-  ( A  e.  D  ->  ( <. A ,  B >.  e.  ( C  |`  D )  <->  <. A ,  B >.  e.  C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177    e. wcel 1717   _Vcvv 2892   <.cop 3753    |` cres 4813
This theorem is referenced by:  resieq  5089  2elresin  5489
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-14 1721  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2361  ax-sep 4264  ax-nul 4272  ax-pr 4337
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2367  df-cleq 2373  df-clel 2376  df-nfc 2505  df-ne 2545  df-ral 2647  df-rex 2648  df-rab 2651  df-v 2894  df-dif 3259  df-un 3261  df-in 3263  df-ss 3270  df-nul 3565  df-if 3676  df-sn 3756  df-pr 3757  df-op 3759  df-opab 4201  df-xp 4817  df-res 4823
  Copyright terms: Public domain W3C validator