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

Theorem opelinxp 5751
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 5749 . 2 (𝐶(𝑅 ∩ (𝐴 × 𝐵))𝐷 ↔ ((𝐶𝐴𝐷𝐵) ∧ 𝐶𝑅𝐷))
2 df-br 5143 . 2 (𝐶(𝑅 ∩ (𝐴 × 𝐵))𝐷 ↔ ⟨𝐶, 𝐷⟩ ∈ (𝑅 ∩ (𝐴 × 𝐵)))
3 df-br 5143 . . 3 (𝐶𝑅𝐷 ↔ ⟨𝐶, 𝐷⟩ ∈ 𝑅)
43anbi2i 622 . 2 (((𝐶𝐴𝐷𝐵) ∧ 𝐶𝑅𝐷) ↔ ((𝐶𝐴𝐷𝐵) ∧ ⟨𝐶, 𝐷⟩ ∈ 𝑅))
51, 2, 43bitr3i 301 1 (⟨𝐶, 𝐷⟩ ∈ (𝑅 ∩ (𝐴 × 𝐵)) ↔ ((𝐶𝐴𝐷𝐵) ∧ ⟨𝐶, 𝐷⟩ ∈ 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 395  wcel 2099  cin 3943  cop 4630   class class class wbr 5142   × cxp 5670
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-ext 2698  ax-sep 5293  ax-nul 5300  ax-pr 5423
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-sb 2061  df-clab 2705  df-cleq 2719  df-clel 2805  df-ral 3057  df-rex 3066  df-rab 3428  df-v 3471  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4319  df-if 4525  df-sn 4625  df-pr 4627  df-op 4631  df-br 5143  df-opab 5205  df-xp 5678
This theorem is referenced by:  elinxp  6017  ssrnres  6176  iss2  37805
  Copyright terms: Public domain W3C validator