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

Theorem elxp3 5698
Description: Membership in a Cartesian product. (Contributed by NM, 5-Mar-1995.)
Assertion
Ref Expression
elxp3 (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥𝑦(⟨𝑥, 𝑦⟩ = 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶)))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦

Proof of Theorem elxp3
StepHypRef Expression
1 elxp 5655 . 2 (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)))
2 eqcom 2744 . . . 4 (⟨𝑥, 𝑦⟩ = 𝐴𝐴 = ⟨𝑥, 𝑦⟩)
3 opelxp 5668 . . . 4 (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶) ↔ (𝑥𝐵𝑦𝐶))
42, 3anbi12i 629 . . 3 ((⟨𝑥, 𝑦⟩ = 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶)) ↔ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)))
542exbii 1851 . 2 (∃𝑥𝑦(⟨𝑥, 𝑦⟩ = 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶)) ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)))
61, 5bitr4i 278 1 (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥𝑦(⟨𝑥, 𝑦⟩ = 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1542  wex 1781  wcel 2114  cop 4588   × cxp 5630
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5243  ax-pr 5379
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-opab 5163  df-xp 5638
This theorem is referenced by:  optoclOLD  5727  unixp0  6249
  Copyright terms: Public domain W3C validator