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

Theorem opeliunxp2f 7223
Description: Membership in a union of Cartesian products, using bound-variable hypothesis for 𝐸 instead of distinct variable conditions as in opeliunxp2 5182. (Contributed by AV, 25-Oct-2020.)
Hypotheses
Ref Expression
opeliunxp2f.f 𝑥𝐸
opeliunxp2f.e (𝑥 = 𝐶𝐵 = 𝐸)
Assertion
Ref Expression
opeliunxp2f (⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝐶𝐴𝐷𝐸))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐶   𝑥,𝐷
Allowed substitution hints:   𝐵(𝑥)   𝐸(𝑥)

Proof of Theorem opeliunxp2f
StepHypRef Expression
1 df-br 4584 . . 3 (𝐶 𝑥𝐴 ({𝑥} × 𝐵)𝐷 ↔ ⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵))
2 relxp 5150 . . . . . 6 Rel ({𝑥} × 𝐵)
32rgenw 2908 . . . . 5 𝑥𝐴 Rel ({𝑥} × 𝐵)
4 reliun 5162 . . . . 5 (Rel 𝑥𝐴 ({𝑥} × 𝐵) ↔ ∀𝑥𝐴 Rel ({𝑥} × 𝐵))
53, 4mpbir 220 . . . 4 Rel 𝑥𝐴 ({𝑥} × 𝐵)
65brrelexi 5082 . . 3 (𝐶 𝑥𝐴 ({𝑥} × 𝐵)𝐷𝐶 ∈ V)
71, 6sylbir 224 . 2 (⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) → 𝐶 ∈ V)
8 elex 3185 . . 3 (𝐶𝐴𝐶 ∈ V)
98adantr 480 . 2 ((𝐶𝐴𝐷𝐸) → 𝐶 ∈ V)
10 nfiu1 4486 . . . . 5 𝑥 𝑥𝐴 ({𝑥} × 𝐵)
1110nfel2 2767 . . . 4 𝑥𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵)
12 nfv 1830 . . . . 5 𝑥 𝐶𝐴
13 opeliunxp2f.f . . . . . 6 𝑥𝐸
1413nfel2 2767 . . . . 5 𝑥 𝐷𝐸
1512, 14nfan 1816 . . . 4 𝑥(𝐶𝐴𝐷𝐸)
1611, 15nfbi 1821 . . 3 𝑥(⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝐶𝐴𝐷𝐸))
17 opeq1 4340 . . . . 5 (𝑥 = 𝐶 → ⟨𝑥, 𝐷⟩ = ⟨𝐶, 𝐷⟩)
1817eleq1d 2672 . . . 4 (𝑥 = 𝐶 → (⟨𝑥, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ ⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵)))
19 eleq1 2676 . . . . 5 (𝑥 = 𝐶 → (𝑥𝐴𝐶𝐴))
20 opeliunxp2f.e . . . . . 6 (𝑥 = 𝐶𝐵 = 𝐸)
2120eleq2d 2673 . . . . 5 (𝑥 = 𝐶 → (𝐷𝐵𝐷𝐸))
2219, 21anbi12d 743 . . . 4 (𝑥 = 𝐶 → ((𝑥𝐴𝐷𝐵) ↔ (𝐶𝐴𝐷𝐸)))
2318, 22bibi12d 334 . . 3 (𝑥 = 𝐶 → ((⟨𝑥, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝑥𝐴𝐷𝐵)) ↔ (⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝐶𝐴𝐷𝐸))))
24 opeliunxp 5093 . . 3 (⟨𝑥, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝑥𝐴𝐷𝐵))
2516, 23, 24vtoclg1f 3238 . 2 (𝐶 ∈ V → (⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝐶𝐴𝐷𝐸)))
267, 9, 25pm5.21nii 367 1 (⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝐶𝐴𝐷𝐸))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383   = wceq 1475  wcel 1977  wnfc 2738  wral 2896  Vcvv 3173  {csn 4125  cop 4131   ciun 4455   class class class wbr 4583   × cxp 5036  Rel wrel 5043
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-iun 4457  df-br 4584  df-opab 4644  df-xp 5044  df-rel 5045
This theorem is referenced by:  mpt2xeldm  7224  fsumcom2  14347  fprodcom2  14553
  Copyright terms: Public domain W3C validator