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

Theorem brres 4984
Description: Binary relation on a restriction. (Contributed by NM, 12-Dec-2006.)
Hypothesis
Ref Expression
opelres.1  |-  B  e. 
_V
Assertion
Ref Expression
brres  |-  ( A ( C  |`  D ) B  <->  ( A C B  /\  A  e.  D ) )

Proof of Theorem brres
StepHypRef Expression
1 opelres.1 . . 3  |-  B  e. 
_V
21opelres 4983 . 2  |-  ( <. A ,  B >.  e.  ( C  |`  D )  <-> 
( <. A ,  B >.  e.  C  /\  A  e.  D ) )
3 df-br 4060 . 2  |-  ( A ( C  |`  D ) B  <->  <. A ,  B >.  e.  ( C  |`  D ) )
4 df-br 4060 . . 3  |-  ( A C B  <->  <. A ,  B >.  e.  C )
54anbi1i 458 . 2  |-  ( ( A C B  /\  A  e.  D )  <->  (
<. A ,  B >.  e.  C  /\  A  e.  D ) )
62, 3, 53bitr4i 212 1  |-  ( A ( C  |`  D ) B  <->  ( A C B  /\  A  e.  D ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    e. wcel 2178   _Vcvv 2776   <.cop 3646   class class class wbr 4059    |` cres 4695
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 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-v 2778  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-br 4060  df-opab 4122  df-xp 4699  df-res 4705
This theorem is referenced by:  dfres2  5030  dfima2  5043  poirr2  5094  cores  5205  resco  5206  rnco  5208  fnres  5412  fvres  5623  nfunsn  5634  1stconst  6330  2ndconst  6331
  Copyright terms: Public domain W3C validator