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

Theorem opelinxp 5743
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 5741 . 2 (𝐶(𝑅 ∩ (𝐴 × 𝐵))𝐷 ↔ ((𝐶𝐴𝐷𝐵) ∧ 𝐶𝑅𝐷))
2 df-br 5112 . 2 (𝐶(𝑅 ∩ (𝐴 × 𝐵))𝐷 ↔ ⟨𝐶, 𝐷⟩ ∈ (𝑅 ∩ (𝐴 × 𝐵)))
3 df-br 5112 . . 3 (𝐶𝑅𝐷 ↔ ⟨𝐶, 𝐷⟩ ∈ 𝑅)
43anbi2i 635 . 2 (((𝐶𝐴𝐷𝐵) ∧ 𝐶𝑅𝐷) ↔ ((𝐶𝐴𝐷𝐵) ∧ ⟨𝐶, 𝐷⟩ ∈ 𝑅))
51, 2, 43bitr3i 304 1 (⟨𝐶, 𝐷⟩ ∈ (𝑅 ∩ (𝐴 × 𝐵)) ↔ ((𝐶𝐴𝐷𝐵) ∧ ⟨𝐶, 𝐷⟩ ∈ 𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209  wa 401  wcel 2146  cin 3905  cop 4597   class class class wbr 5111   × cxp 5661
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737  ax-sep 5259  ax-pr 5406
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-opab 5176  df-xp 5669
This theorem is used by:  elinxp  6020  ssrnres  6178  iss2  39053
  Copyright terms: Public domain W3C validator