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

Theorem elxp3 5713
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 5670 . 2 (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)))
2 eqcom 2769 . . . 4 (⟨𝑥, 𝑦⟩ = 𝐴𝐴 = ⟨𝑥, 𝑦⟩)
3 opelxp 5683 . . . 4 (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶) ↔ (𝑥𝐵𝑦𝐶))
42, 3anbi12i 637 . . 3 ((⟨𝑥, 𝑦⟩ = 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶)) ↔ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)))
542exbii 1869 . 2 (∃𝑥𝑦(⟨𝑥, 𝑦⟩ = 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶)) ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)))
61, 5bitr4i 280 1 (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥𝑦(⟨𝑥, 𝑦⟩ = 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wb 208  wa 399   = wceq 1560  wex 1799  wcel 2142  cop 4588   × cxp 5645
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5246  ax-pr 5390
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-sb 2091  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3077  df-rex 3087  df-rab 3415  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-sn 4583  df-pr 4585  df-op 4589  df-opab 5163  df-xp 5653
This theorem is referenced by:  optoclOLD  5742  unixp0  6270
  Copyright terms: Public domain W3C validator