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

Theorem elxp 5673
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 5656 . . 3 (𝐵 × 𝐶) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)}
21eleq2i 2852 . 2 (𝐴 ∈ (𝐵 × 𝐶) ↔ 𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)})
3 elopab 5500 . 2 (𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)} ↔ ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)))
42, 3bitri 278 1 (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ⟨cop 4834  {copab 5166   × cxp 5648
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-ss 3896  df-in 4091  df-un 4151  df-sn 4585  df-pr 4587  df-op 4835  df-opab 5167  df-xp 5656
This theorem is used by:  elxp2  5674  0nelxp  5684  0nelelxp  5685  rabxp  5698  elxp3  5716  elvv  5725  elvvv  5726  dfres3  5974  xpdifid  6158  xpdifcnvepel  6159  dfco2a  6247  elsnxp  6294  tpres  7207  elxp4  7934  elxp5  7935  opabex3d  7977  opabex3rd  7978  opabex3  7979  xp1st  8033  xp2nd  8034  poxp  8142  soxp  8143  xpsnen  9083  xpcomco  9089  xpassen  9093  dfac5lem1  10205  dfac5lem4  10208  axdc4lem  10536  fsum2dlem  15941  fprod2dlem  16152  mgmn0plusgf  18832  mgmn0plusgplusf  18833  numclwwlk1lem2fo  30964  satefvfmla0  36269  elima4  36632  brcart  36786  brimg  36791  coi1in  38053  dibelval3  42297
  Copyright terms: Public domain W3C validator