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

Theorem eliunxp 5844
Description: Membership in a union of Cartesian products. Analogue of elxp 5705 for nonconstant 𝐵(𝑥). (Contributed by Mario Carneiro, 29-Dec-2014.)
Assertion
Ref Expression
eliunxp (𝐶 𝑥𝐴 ({𝑥} × 𝐵) ↔ ∃𝑥𝑦(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
Distinct variable groups:   𝑦,𝐴   𝑦,𝐵   𝑥,𝑦,𝐶
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem eliunxp
StepHypRef Expression
1 relxp 5700 . . . . . 6 Rel ({𝑥} × 𝐵)
21rgenw 3062 . . . . 5 𝑥𝐴 Rel ({𝑥} × 𝐵)
3 reliun 5822 . . . . 5 (Rel 𝑥𝐴 ({𝑥} × 𝐵) ↔ ∀𝑥𝐴 Rel ({𝑥} × 𝐵))
42, 3mpbir 230 . . . 4 Rel 𝑥𝐴 ({𝑥} × 𝐵)
5 elrel 5804 . . . 4 ((Rel 𝑥𝐴 ({𝑥} × 𝐵) ∧ 𝐶 𝑥𝐴 ({𝑥} × 𝐵)) → ∃𝑥𝑦 𝐶 = ⟨𝑥, 𝑦⟩)
64, 5mpan 688 . . 3 (𝐶 𝑥𝐴 ({𝑥} × 𝐵) → ∃𝑥𝑦 𝐶 = ⟨𝑥, 𝑦⟩)
76pm4.71ri 559 . 2 (𝐶 𝑥𝐴 ({𝑥} × 𝐵) ↔ (∃𝑥𝑦 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑥𝐴 ({𝑥} × 𝐵)))
8 nfiu1 5034 . . . 4 𝑥 𝑥𝐴 ({𝑥} × 𝐵)
98nfel2 2918 . . 3 𝑥 𝐶 𝑥𝐴 ({𝑥} × 𝐵)
10919.41 2223 . 2 (∃𝑥(∃𝑦 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑥𝐴 ({𝑥} × 𝐵)) ↔ (∃𝑥𝑦 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑥𝐴 ({𝑥} × 𝐵)))
11 19.41v 1945 . . . 4 (∃𝑦(𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑥𝐴 ({𝑥} × 𝐵)) ↔ (∃𝑦 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑥𝐴 ({𝑥} × 𝐵)))
12 eleq1 2817 . . . . . . 7 (𝐶 = ⟨𝑥, 𝑦⟩ → (𝐶 𝑥𝐴 ({𝑥} × 𝐵) ↔ ⟨𝑥, 𝑦⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵)))
13 opeliunxp 5749 . . . . . . 7 (⟨𝑥, 𝑦⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝑥𝐴𝑦𝐵))
1412, 13bitrdi 286 . . . . . 6 (𝐶 = ⟨𝑥, 𝑦⟩ → (𝐶 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝑥𝐴𝑦𝐵)))
1514pm5.32i 573 . . . . 5 ((𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑥𝐴 ({𝑥} × 𝐵)) ↔ (𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
1615exbii 1842 . . . 4 (∃𝑦(𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑥𝐴 ({𝑥} × 𝐵)) ↔ ∃𝑦(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
1711, 16bitr3i 276 . . 3 ((∃𝑦 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑥𝐴 ({𝑥} × 𝐵)) ↔ ∃𝑦(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
1817exbii 1842 . 2 (∃𝑥(∃𝑦 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑥𝐴 ({𝑥} × 𝐵)) ↔ ∃𝑥𝑦(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
197, 10, 183bitr2i 298 1 (𝐶 𝑥𝐴 ({𝑥} × 𝐵) ↔ ∃𝑥𝑦(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 394   = wceq 1533  wex 1773  wcel 2098  wral 3058  {csn 4632  cop 4638   ciun 5000   × cxp 5680  Rel wrel 5687
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2699  ax-sep 5303  ax-nul 5310  ax-pr 5433
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ral 3059  df-rex 3068  df-rab 3431  df-v 3475  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4327  df-if 4533  df-sn 4633  df-pr 4635  df-op 4639  df-iun 5002  df-opab 5215  df-xp 5688  df-rel 5689
This theorem is referenced by:  raliunxp  5846  dfmpt3  6694  mpomptx  7539  fsumcom2  15760  fprodcom2  15968  isfunc  17857  gsum2d2  19936  dprd2d2  20008  fsumvma  27166  2ndresdju  32456  mpomptxf  32485  poimirlem26  37152  dvnprodlem1  45363
  Copyright terms: Public domain W3C validator