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

Theorem brinxp 5321
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 5320 . . 3 (𝐴(𝑅 ∩ (𝐶 × 𝐷))𝐵 ↔ (𝐴𝐶𝐵𝐷𝐴𝑅𝐵))
2 df-3an 1073 . . 3 ((𝐴𝐶𝐵𝐷𝐴𝑅𝐵) ↔ ((𝐴𝐶𝐵𝐷) ∧ 𝐴𝑅𝐵))
31, 2bitri 264 . 2 (𝐴(𝑅 ∩ (𝐶 × 𝐷))𝐵 ↔ ((𝐴𝐶𝐵𝐷) ∧ 𝐴𝑅𝐵))
43baibr 526 1 ((𝐴𝐶𝐵𝐷) → (𝐴𝑅𝐵𝐴(𝑅 ∩ (𝐶 × 𝐷))𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 382  w3a 1071  wcel 2145  cin 3722   class class class wbr 4786   × cxp 5247
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-sep 4915  ax-nul 4923  ax-pr 5034
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3353  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-nul 4064  df-if 4226  df-sn 4317  df-pr 4319  df-op 4323  df-br 4787  df-opab 4847  df-xp 5255
This theorem is referenced by:  poinxp  5322  soinxp  5323  frinxp  5324  seinxp  5325  exfo  6520  isores2  6726  ltpiord  9911  ordpinq  9967  pwsleval  16361  tsrss  17431  ordtrest  21227  ordtrest2lem  21228  ordtrestNEW  30307  ordtrest2NEWlem  30308
  Copyright terms: Public domain W3C validator