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

Theorem brinxp 4731
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 4730 . . 3  |-  ( A ( R  i^i  ( C  X.  D ) ) B  <->  ( A  e.  C  /\  B  e.  D  /\  A R B ) )
2 df-3an 982 . . 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 921 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 980    e. wcel 2167    i^i cin 3156   class class class wbr 4033    X. cxp 4661
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-br 4034  df-opab 4095  df-xp 4669
This theorem is referenced by:  poinxp  4732  soinxp  4733  seinxp  4734  isores2  5860  ltpiord  7386
  Copyright terms: Public domain W3C validator