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

Theorem opeliunxp2 5826
Description: Membership in a union of Cartesian products. (Contributed by Mario Carneiro, 14-Feb-2015.)
Hypothesis
Ref Expression
opeliunxp2.1 (𝑥 = 𝐶𝐵 = 𝐸)
Assertion
Ref Expression
opeliunxp2 (⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝐶𝐴𝐷𝐸))
Distinct variable groups:   𝑥,𝐶   𝑥,𝐷   𝑥,𝐸   𝑥,𝐴
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem opeliunxp2
StepHypRef Expression
1 df-br 5111 . . 3 (𝐶 𝑥𝐴 ({𝑥} × 𝐵)𝐷 ↔ ⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵))
2 relxp 5681 . . . . . 6 Rel ({𝑥} × 𝐵)
32rgenw 3083 . . . . 5 𝑥𝐴 Rel ({𝑥} × 𝐵)
4 reliun 5805 . . . . 5 (Rel 𝑥𝐴 ({𝑥} × 𝐵) ↔ ∀𝑥𝐴 Rel ({𝑥} × 𝐵))
53, 4mpbir 234 . . . 4 Rel 𝑥𝐴 ({𝑥} × 𝐵)
65brrelex1i 5719 . . 3 (𝐶 𝑥𝐴 ({𝑥} × 𝐵)𝐷𝐶 ∈ V)
71, 6sylbir 238 . 2 (⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) → 𝐶 ∈ V)
8 elex 3476 . . 3 (𝐶𝐴𝐶 ∈ V)
98adantr 485 . 2 ((𝐶𝐴𝐷𝐸) → 𝐶 ∈ V)
10 nfiu1 4993 . . . . 5 𝑥 𝑥𝐴 ({𝑥} × 𝐵)
1110nfel2 2943 . . . 4 𝑥𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵)
12 nfv 1944 . . . 4 𝑥(𝐶𝐴𝐷𝐸)
1311, 12nfbi 1933 . . 3 𝑥(⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝐶𝐴𝐷𝐸))
14 opeq1 4839 . . . . 5 (𝑥 = 𝐶 → ⟨𝑥, 𝐷⟩ = ⟨𝐶, 𝐷⟩)
1514eleq1d 2848 . . . 4 (𝑥 = 𝐶 → (⟨𝑥, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ ⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵)))
16 eleq1 2851 . . . . 5 (𝑥 = 𝐶 → (𝑥𝐴𝐶𝐴))
17 opeliunxp2.1 . . . . . 6 (𝑥 = 𝐶𝐵 = 𝐸)
1817eleq2d 2849 . . . . 5 (𝑥 = 𝐶 → (𝐷𝐵𝐷𝐸))
1916, 18anbi12d 643 . . . 4 (𝑥 = 𝐶 → ((𝑥𝐴𝐷𝐵) ↔ (𝐶𝐴𝐷𝐸)))
2015, 19bibi12d 348 . . 3 (𝑥 = 𝐶 → ((⟨𝑥, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝑥𝐴𝐷𝐵)) ↔ (⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝐶𝐴𝐷𝐸))))
21 opeliunxp 5730 . . 3 (⟨𝑥, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝑥𝐴𝐷𝐵))
2213, 20, 21vtoclg1f 3536 . 2 (𝐶 ∈ V → (⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝐶𝐴𝐷𝐸)))
237, 9, 22pm5.21nii 381 1 (⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝐶𝐴𝐷𝐸))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1570  wcel 2143  wral 3079  Vcvv 3455  {csn 4590  cop 4596   ciun 4957   class class class wbr 5110   × cxp 5661  Rel wrel 5668
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-pr 5406
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-iun 4959  df-br 5111  df-opab 5175  df-xp 5669  df-rel 5670
This theorem is referenced by:  mpoxopn0yelv  8210  mpoxopxnop0  8212  eldmcoa  18123  dmdprd  20071  ply1frcl  22459  cnextfres  24207  eldv  26038  perfdvf  26043  eltayl  26504  dfcnv2  33001  gsumwrd2dccat  33379  cvmliftlem1  35758  filnetlem3  36872
  Copyright terms: Public domain W3C validator