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

Theorem brres 4636
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 4635 . 2  |-  ( <. A ,  B >.  e.  ( C  |`  D )  <-> 
( <. A ,  B >.  e.  C  /\  A  e.  D ) )
3 df-br 3786 . 2  |-  ( A ( C  |`  D ) B  <->  <. A ,  B >.  e.  ( C  |`  D ) )
4 df-br 3786 . . 3  |-  ( A C B  <->  <. A ,  B >.  e.  C )
54anbi1i 445 . 2  |-  ( ( A C B  /\  A  e.  D )  <->  (
<. A ,  B >.  e.  C  /\  A  e.  D ) )
62, 3, 53bitr4i 210 1  |-  ( A ( C  |`  D ) B  <->  ( A C B  /\  A  e.  D ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 102    <-> wb 103    e. wcel 1433   _Vcvv 2601   <.cop 3401   class class class wbr 3785    |` cres 4365
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-br 3786  df-opab 3840  df-xp 4369  df-res 4375
This theorem is referenced by:  dfres2  4678  dfima2  4690  poirr2  4737  cores  4844  resco  4845  rnco  4847  fnres  5035  fvres  5219  nfunsn  5228  1stconst  5862  2ndconst  5863
  Copyright terms: Public domain W3C validator