MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  brinxp Structured version   Visualization version   GIF version

Theorem brinxp 5625
Description: Intersection of binary relation with Cartesian product. (Contributed by NM, 9-Mar-1997.)
Assertion
Ref Expression
brinxp ((𝐴𝐶𝐵𝐷) → (𝐴𝑅𝐵𝐴(𝑅 ∩ (𝐶 × 𝐷))𝐵))

Proof of Theorem brinxp
StepHypRef Expression
1 brinxp2 5624 . 2 (𝐴(𝑅 ∩ (𝐶 × 𝐷))𝐵 ↔ ((𝐴𝐶𝐵𝐷) ∧ 𝐴𝑅𝐵))
21baibr 539 1 ((𝐴𝐶𝐵𝐷) → (𝐴𝑅𝐵𝐴(𝑅 ∩ (𝐶 × 𝐷))𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  wcel 2110  cin 3935   class class class wbr 5059   × cxp 5548
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-sep 5196  ax-nul 5203  ax-pr 5322
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3497  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4562  df-pr 4564  df-op 4568  df-br 5060  df-opab 5122  df-xp 5556
This theorem is referenced by:  poinxp  5627  soinxp  5628  frinxp  5629  seinxp  5630  exfo  6866  isores2  7080  ltpiord  10303  ordpinq  10359  pwsleval  16760  tsrss  17827  ordtrest  21804  ordtrest2lem  21805  ordtrestNEW  31159  ordtrest2NEWlem  31160  satefvfmla0  32660
  Copyright terms: Public domain W3C validator