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

Theorem opeliunxp2 5825
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 5109 . . 3 (𝐶∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)𝐷 ↔ ⟨𝐶, 𝐷⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵))
2 relxp 5676 . . . . . 6 Rel ({𝑥} × 𝐵)
32rgenw 3084 . . . . 5 ∀𝑥 ∈ 𝐴 Rel ({𝑥} × 𝐵)
4 reliun 5803 . . . . 5 (Rel ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ↔ ∀𝑥 ∈ 𝐴 Rel ({𝑥} × 𝐵))
53, 4mpbir 234 . . . 4 Rel ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)
65brrelex1i 5714 . . 3 (𝐶∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)𝐷 → 𝐶 ∈ V)
71, 6sylbir 238 . 2 (⟨𝐶, 𝐷⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) → 𝐶 ∈ V)
8 elex 3475 . . 3 (𝐶 ∈ 𝐴 → 𝐶 ∈ V)
98adantr 486 . 2 ((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐸) → 𝐶 ∈ V)
10 nfiu1 4991 . . . . 5 Ⅎ𝑥∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)
1110nfel2 2944 . . . 4 Ⅎ𝑥⟨𝐶, 𝐷⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)
12 nfv 1949 . . . 4 Ⅎ𝑥(𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐸)
1311, 12nfbi 1938 . . 3 Ⅎ𝑥(⟨𝐶, 𝐷⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ↔ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐸))
14 opeq1 4845 . . . . 5 (𝑥 = 𝐶 → ⟨𝑥, 𝐷⟩ = ⟨𝐶, 𝐷⟩)
1514eleq1d 2849 . . . 4 (𝑥 = 𝐶 → (⟨𝑥, 𝐷⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ↔ ⟨𝐶, 𝐷⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)))
16 eleq1 2852 . . . . 5 (𝑥 = 𝐶 → (𝑥 ∈ 𝐴 ↔ 𝐶 ∈ 𝐴))
17 opeliunxp2.1 . . . . . 6 (𝑥 = 𝐶 → 𝐵 = 𝐸)
1817eleq2d 2850 . . . . 5 (𝑥 = 𝐶 → (𝐷 ∈ 𝐵 ↔ 𝐷 ∈ 𝐸))
1916, 18anbi12d 644 . . . 4 (𝑥 = 𝐶 → ((𝑥 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) ↔ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐸)))
2015, 19bibi12d 348 . . 3 (𝑥 = 𝐶 → ((⟨𝑥, 𝐷⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵)) ↔ (⟨𝐶, 𝐷⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ↔ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐸))))
21 opeliunxp 5725 . . 3 (⟨𝑥, 𝐷⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵))
2213, 20, 21vtoclg1f 3534 . 2 (𝐶 ∈ V → (⟨𝐶, 𝐷⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ↔ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐸)))
237, 9, 22pm5.21nii 381 1 (⟨𝐶, 𝐷⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ↔ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐸))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  Vcvv 3454  {csn 4588  ⟨cop 4840  ∪ ciun 4956   class class class wbr 5108   × cxp 5656  Rel wrel 5663
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-iun 4958  df-br 5109  df-opab 5174  df-xp 5664  df-rel 5665
This theorem is used by:  mpoxopn0yelv  8268  mpoxopxnop0  8270  eldmcoa  18290  dmdprd  20265  ply1frcl  22691  cnextfres  24443  eldv  26273  perfdvf  26278  eltayl  26744  dfcnv2  33366  gsumwrd2dccat  33738  cvmliftlem1  36258  filnetlem3  37383
  Copyright terms: Public domain W3C validator