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

Theorem opeliunxp2 5736
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 5071 . . 3 (𝐶 𝑥𝐴 ({𝑥} × 𝐵)𝐷 ↔ ⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵))
2 relxp 5598 . . . . . 6 Rel ({𝑥} × 𝐵)
32rgenw 3075 . . . . 5 𝑥𝐴 Rel ({𝑥} × 𝐵)
4 reliun 5715 . . . . 5 (Rel 𝑥𝐴 ({𝑥} × 𝐵) ↔ ∀𝑥𝐴 Rel ({𝑥} × 𝐵))
53, 4mpbir 230 . . . 4 Rel 𝑥𝐴 ({𝑥} × 𝐵)
65brrelex1i 5634 . . 3 (𝐶 𝑥𝐴 ({𝑥} × 𝐵)𝐷𝐶 ∈ V)
71, 6sylbir 234 . 2 (⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) → 𝐶 ∈ V)
8 elex 3440 . . 3 (𝐶𝐴𝐶 ∈ V)
98adantr 480 . 2 ((𝐶𝐴𝐷𝐸) → 𝐶 ∈ V)
10 nfiu1 4955 . . . . 5 𝑥 𝑥𝐴 ({𝑥} × 𝐵)
1110nfel2 2924 . . . 4 𝑥𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵)
12 nfv 1918 . . . 4 𝑥(𝐶𝐴𝐷𝐸)
1311, 12nfbi 1907 . . 3 𝑥(⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝐶𝐴𝐷𝐸))
14 opeq1 4801 . . . . 5 (𝑥 = 𝐶 → ⟨𝑥, 𝐷⟩ = ⟨𝐶, 𝐷⟩)
1514eleq1d 2823 . . . 4 (𝑥 = 𝐶 → (⟨𝑥, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ ⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵)))
16 eleq1 2826 . . . . 5 (𝑥 = 𝐶 → (𝑥𝐴𝐶𝐴))
17 opeliunxp2.1 . . . . . 6 (𝑥 = 𝐶𝐵 = 𝐸)
1817eleq2d 2824 . . . . 5 (𝑥 = 𝐶 → (𝐷𝐵𝐷𝐸))
1916, 18anbi12d 630 . . . 4 (𝑥 = 𝐶 → ((𝑥𝐴𝐷𝐵) ↔ (𝐶𝐴𝐷𝐸)))
2015, 19bibi12d 345 . . 3 (𝑥 = 𝐶 → ((⟨𝑥, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝑥𝐴𝐷𝐵)) ↔ (⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝐶𝐴𝐷𝐸))))
21 opeliunxp 5645 . . 3 (⟨𝑥, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝑥𝐴𝐷𝐵))
2213, 20, 21vtoclg1f 3494 . 2 (𝐶 ∈ V → (⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝐶𝐴𝐷𝐸)))
237, 9, 22pm5.21nii 379 1 (⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝐶𝐴𝐷𝐸))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1539  wcel 2108  wral 3063  Vcvv 3422  {csn 4558  cop 4564   ciun 4921   class class class wbr 5070   × cxp 5578  Rel wrel 5585
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-iun 4923  df-br 5071  df-opab 5133  df-xp 5586  df-rel 5587
This theorem is referenced by:  mpoxopn0yelv  8000  mpoxopxnop0  8002  eldmcoa  17696  dmdprd  19516  ply1frcl  21394  cnextfres  23128  eldv  24967  perfdvf  24972  eltayl  25424  dfcnv2  30915  cvmliftlem1  33147  filnetlem3  34496
  Copyright terms: Public domain W3C validator