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

Theorem elxpi 4550
Description: Membership in a cross product. Uses fewer axioms than elxp 4551. (Contributed by NM, 4-Jul-1994.)
Assertion
Ref Expression
elxpi (𝐴 ∈ (𝐵 × 𝐶) → ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦

Proof of Theorem elxpi
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 eqeq1 2144 . . . . . 6 (𝑧 = 𝐴 → (𝑧 = ⟨𝑥, 𝑦⟩ ↔ 𝐴 = ⟨𝑥, 𝑦⟩))
21anbi1d 460 . . . . 5 (𝑧 = 𝐴 → ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)) ↔ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶))))
322exbidv 1840 . . . 4 (𝑧 = 𝐴 → (∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)) ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶))))
43elabg 2825 . . 3 (𝐴 ∈ {𝑧 ∣ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶))} → (𝐴 ∈ {𝑧 ∣ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶))} ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶))))
54ibi 175 . 2 (𝐴 ∈ {𝑧 ∣ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶))} → ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)))
6 df-xp 4540 . . 3 (𝐵 × 𝐶) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝑦𝐶)}
7 df-opab 3985 . . 3 {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝑦𝐶)} = {𝑧 ∣ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶))}
86, 7eqtri 2158 . 2 (𝐵 × 𝐶) = {𝑧 ∣ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶))}
95, 8eleq2s 2232 1 (𝐴 ∈ (𝐵 × 𝐶) → ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103   = wceq 1331  wex 1468  wcel 1480  {cab 2123  cop 3525  {copab 3983   × cxp 4532
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-v 2683  df-opab 3985  df-xp 4540
This theorem is referenced by:  xpsspw  4646  dmaddpqlem  7178  nqpi  7179  enq0ref  7234  nqnq0  7242  nq0nn  7243  cnm  7633  axaddcl  7665  axmulcl  7667
  Copyright terms: Public domain W3C validator