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

Theorem brinxp 4794
Description: Intersection of binary relation with Cartesian product. (Contributed by NM, 9-Mar-1997.)
Assertion
Ref Expression
brinxp  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( A R B  <-> 
A ( R  i^i  ( C  X.  D
) ) B ) )

Proof of Theorem brinxp
StepHypRef Expression
1 brinxp2 4793 . . 3  |-  ( A ( R  i^i  ( C  X.  D ) ) B  <->  ( A  e.  C  /\  B  e.  D  /\  A R B ) )
2 df-3an 1006 . . 3  |-  ( ( A  e.  C  /\  B  e.  D  /\  A R B )  <->  ( ( A  e.  C  /\  B  e.  D )  /\  A R B ) )
31, 2bitri 184 . 2  |-  ( A ( R  i^i  ( C  X.  D ) ) B  <->  ( ( A  e.  C  /\  B  e.  D )  /\  A R B ) )
43baibr 927 1  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( A R B  <-> 
A ( R  i^i  ( C  X.  D
) ) B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1004    e. wcel 2202    i^i cin 3199   class class class wbr 4088    X. cxp 4723
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089  df-opab 4151  df-xp 4731
This theorem is referenced by:  poinxp  4795  soinxp  4796  seinxp  4797  isores2  5953  ltpiord  7538
  Copyright terms: Public domain W3C validator