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

Theorem elxp 5683
Description: Membership in a Cartesian product. (Contributed by NM, 4-Jul-1994.)
Assertion
Ref Expression
elxp (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦

Proof of Theorem elxp
StepHypRef Expression
1 df-xp 5666 . . 3 (𝐵 × 𝐶) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝑦𝐶)}
21eleq2i 2854 . 2 (𝐴 ∈ (𝐵 × 𝐶) ↔ 𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝑦𝐶)})
3 elopab 5510 . 2 (𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝑦𝐶)} ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)))
42, 3bitri 278 1 (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209  wa 400   = wceq 1569  wex 1808  wcel 2142  cop 4594  {copab 5172   × cxp 5658
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5256  ax-pr 5403
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3416  df-v 3456  df-un 3909  df-in 3911  df-ss 3921  df-sn 4589  df-pr 4591  df-op 4595  df-opab 5173  df-xp 5666
This theorem is used by:  elxp2  5684  0nelxp  5694  0nelelxp  5695  rabxp  5708  elxp3  5726  elvv  5735  elvvv  5736  dfres3  5982  xpdifid  6164  xpdifcnvepel  6165  dfco2a  6246  elsnxp  6292  tpres  7199  elxp4  7917  elxp5  7918  opabex3d  7960  opabex3rd  7961  opabex3  7962  xp1st  8016  xp2nd  8017  poxp  8122  soxp  8123  xpsnen  9047  xpcomco  9053  xpassen  9057  dfac5lem1  10114  dfac5lem4  10117  axdc4lem  10445  fsum2dlem  15828  fprod2dlem  16041  numclwwlk1lem2fo  30720  satefvfmla0  35918  elima4  36276  brcart  36430  brimg  36435  dibelval3  41949
  Copyright terms: Public domain W3C validator