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

Theorem opelinxp 5754
Description: Ordered pair element in an intersection with Cartesian product. (Contributed by Peter Mazsa, 21-Jul-2019.)
Assertion
Ref Expression
opelinxp (⟨𝐶, 𝐷⟩ ∈ (𝑅 ∩ (𝐴 × 𝐵)) ↔ ((𝐶𝐴𝐷𝐵) ∧ ⟨𝐶, 𝐷⟩ ∈ 𝑅))

Proof of Theorem opelinxp
StepHypRef Expression
1 brinxp2 5752 . 2 (𝐶(𝑅 ∩ (𝐴 × 𝐵))𝐷 ↔ ((𝐶𝐴𝐷𝐵) ∧ 𝐶𝑅𝐷))
2 df-br 5149 . 2 (𝐶(𝑅 ∩ (𝐴 × 𝐵))𝐷 ↔ ⟨𝐶, 𝐷⟩ ∈ (𝑅 ∩ (𝐴 × 𝐵)))
3 df-br 5149 . . 3 (𝐶𝑅𝐷 ↔ ⟨𝐶, 𝐷⟩ ∈ 𝑅)
43anbi2i 624 . 2 (((𝐶𝐴𝐷𝐵) ∧ 𝐶𝑅𝐷) ↔ ((𝐶𝐴𝐷𝐵) ∧ ⟨𝐶, 𝐷⟩ ∈ 𝑅))
51, 2, 43bitr3i 301 1 (⟨𝐶, 𝐷⟩ ∈ (𝑅 ∩ (𝐴 × 𝐵)) ↔ ((𝐶𝐴𝐷𝐵) ∧ ⟨𝐶, 𝐷⟩ ∈ 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 397  wcel 2107  cin 3947  cop 4634   class class class wbr 5148   × cxp 5674
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2704  ax-sep 5299  ax-nul 5306  ax-pr 5427
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-br 5149  df-opab 5211  df-xp 5682
This theorem is referenced by:  elinxp  6018  ssrnres  6175  iss2  37202
  Copyright terms: Public domain W3C validator