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

Theorem brresg 4968
Description: Binary relation on a restriction. (Contributed by Mario Carneiro, 4-Nov-2015.)
Assertion
Ref Expression
brresg  |-  ( B  e.  V  ->  ( A ( C  |`  D ) B  <->  ( A C B  /\  A  e.  D ) ) )

Proof of Theorem brresg
StepHypRef Expression
1 opelresg 4967 . 2  |-  ( B  e.  V  ->  ( <. A ,  B >.  e.  ( C  |`  D )  <-> 
( <. A ,  B >.  e.  C  /\  A  e.  D ) ) )
2 df-br 4046 . 2  |-  ( A ( C  |`  D ) B  <->  <. A ,  B >.  e.  ( C  |`  D ) )
3 df-br 4046 . . 3  |-  ( A C B  <->  <. A ,  B >.  e.  C )
43anbi1i 458 . 2  |-  ( ( A C B  /\  A  e.  D )  <->  (
<. A ,  B >.  e.  C  /\  A  e.  D ) )
51, 2, 43bitr4g 223 1  |-  ( B  e.  V  ->  ( A ( C  |`  D ) B  <->  ( A C B  /\  A  e.  D ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    e. wcel 2176   <.cop 3636   class class class wbr 4045    |` cres 4678
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 4163  ax-pow 4219  ax-pr 4254
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  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 4046  df-opab 4107  df-xp 4682  df-res 4688
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator