ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  elxp2 GIF version

Theorem elxp2 4681
Description: Membership in a cross product. (Contributed by NM, 23-Feb-2004.)
Assertion
Ref Expression
elxp2 (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥𝐵𝑦𝐶 𝐴 = ⟨𝑥, 𝑦⟩)
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦

Proof of Theorem elxp2
StepHypRef Expression
1 df-rex 2481 . . . 4 (∃𝑦𝐶 (𝑥𝐵𝐴 = ⟨𝑥, 𝑦⟩) ↔ ∃𝑦(𝑦𝐶 ∧ (𝑥𝐵𝐴 = ⟨𝑥, 𝑦⟩)))
2 r19.42v 2654 . . . 4 (∃𝑦𝐶 (𝑥𝐵𝐴 = ⟨𝑥, 𝑦⟩) ↔ (𝑥𝐵 ∧ ∃𝑦𝐶 𝐴 = ⟨𝑥, 𝑦⟩))
3 an13 563 . . . . 5 ((𝑦𝐶 ∧ (𝑥𝐵𝐴 = ⟨𝑥, 𝑦⟩)) ↔ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)))
43exbii 1619 . . . 4 (∃𝑦(𝑦𝐶 ∧ (𝑥𝐵𝐴 = ⟨𝑥, 𝑦⟩)) ↔ ∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)))
51, 2, 43bitr3i 210 . . 3 ((𝑥𝐵 ∧ ∃𝑦𝐶 𝐴 = ⟨𝑥, 𝑦⟩) ↔ ∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)))
65exbii 1619 . 2 (∃𝑥(𝑥𝐵 ∧ ∃𝑦𝐶 𝐴 = ⟨𝑥, 𝑦⟩) ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)))
7 df-rex 2481 . 2 (∃𝑥𝐵𝑦𝐶 𝐴 = ⟨𝑥, 𝑦⟩ ↔ ∃𝑥(𝑥𝐵 ∧ ∃𝑦𝐶 𝐴 = ⟨𝑥, 𝑦⟩))
8 elxp 4680 . 2 (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)))
96, 7, 83bitr4ri 213 1 (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥𝐵𝑦𝐶 𝐴 = ⟨𝑥, 𝑦⟩)
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105   = wceq 1364  wex 1506  wcel 2167  wrex 2476  cop 3625   × cxp 4661
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-rex 2481  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-opab 4095  df-xp 4669
This theorem is referenced by:  opelxp  4693  xpiundi  4721  xpiundir  4722  ssrel2  4753  f1o2ndf1  6286  xpdom2  6890  elreal  7895
  Copyright terms: Public domain W3C validator