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

Theorem opres 5148
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 5144 . 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 1725   _Vcvv 2949   <.cop 3810    |` cres 4873
This theorem is referenced by:  resieq  5149  2elresin  5549
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2417  ax-sep 4323  ax-nul 4331  ax-pr 4396
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-clab 2423  df-cleq 2429  df-clel 2432  df-nfc 2561  df-ne 2601  df-ral 2703  df-rex 2704  df-rab 2707  df-v 2951  df-dif 3316  df-un 3318  df-in 3320  df-ss 3327  df-nul 3622  df-if 3733  df-sn 3813  df-pr 3814  df-op 3816  df-opab 4260  df-xp 4877  df-res 4883
  Copyright terms: Public domain W3C validator