Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  eliunxp2 Structured version   Visualization version   GIF version

Theorem eliunxp2 41426
Description: Membership in a union of Cartesian products over its second component, analogous to eliunxp 5224. (Contributed by AV, 30-Mar-2019.)
Assertion
Ref Expression
eliunxp2 (𝐶 𝑦𝐵 (𝐴 × {𝑦}) ↔ ∃𝑥𝑦(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝑦,𝐶
Allowed substitution hints:   𝐴(𝑦)   𝐵(𝑦)

Proof of Theorem eliunxp2
StepHypRef Expression
1 relxp 5193 . . . . . . . 8 Rel (𝐴 × {𝑦})
21rgenw 2919 . . . . . . 7 𝑦𝐵 Rel (𝐴 × {𝑦})
3 reliun 5205 . . . . . . 7 (Rel 𝑦𝐵 (𝐴 × {𝑦}) ↔ ∀𝑦𝐵 Rel (𝐴 × {𝑦}))
42, 3mpbir 221 . . . . . 6 Rel 𝑦𝐵 (𝐴 × {𝑦})
5 elrel 5188 . . . . . 6 ((Rel 𝑦𝐵 (𝐴 × {𝑦}) ∧ 𝐶 𝑦𝐵 (𝐴 × {𝑦})) → ∃𝑥𝑦 𝐶 = ⟨𝑥, 𝑦⟩)
64, 5mpan 705 . . . . 5 (𝐶 𝑦𝐵 (𝐴 × {𝑦}) → ∃𝑥𝑦 𝐶 = ⟨𝑥, 𝑦⟩)
7 excom 2039 . . . . 5 (∃𝑦𝑥 𝐶 = ⟨𝑥, 𝑦⟩ ↔ ∃𝑥𝑦 𝐶 = ⟨𝑥, 𝑦⟩)
86, 7sylibr 224 . . . 4 (𝐶 𝑦𝐵 (𝐴 × {𝑦}) → ∃𝑦𝑥 𝐶 = ⟨𝑥, 𝑦⟩)
98pm4.71ri 664 . . 3 (𝐶 𝑦𝐵 (𝐴 × {𝑦}) ↔ (∃𝑦𝑥 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑦𝐵 (𝐴 × {𝑦})))
10 nfiu1 4521 . . . . 5 𝑦 𝑦𝐵 (𝐴 × {𝑦})
1110nfel2 2777 . . . 4 𝑦 𝐶 𝑦𝐵 (𝐴 × {𝑦})
121119.41 2101 . . 3 (∃𝑦(∃𝑥 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑦𝐵 (𝐴 × {𝑦})) ↔ (∃𝑦𝑥 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑦𝐵 (𝐴 × {𝑦})))
13 19.41v 1911 . . . . 5 (∃𝑥(𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑦𝐵 (𝐴 × {𝑦})) ↔ (∃𝑥 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑦𝐵 (𝐴 × {𝑦})))
14 eleq1 2686 . . . . . . . 8 (𝐶 = ⟨𝑥, 𝑦⟩ → (𝐶 𝑦𝐵 (𝐴 × {𝑦}) ↔ ⟨𝑥, 𝑦⟩ ∈ 𝑦𝐵 (𝐴 × {𝑦})))
15 opeliun2xp 41425 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ ∈ 𝑦𝐵 (𝐴 × {𝑦}) ↔ (𝑦𝐵𝑥𝐴))
16 ancom 466 . . . . . . . . 9 ((𝑦𝐵𝑥𝐴) ↔ (𝑥𝐴𝑦𝐵))
1715, 16bitri 264 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ 𝑦𝐵 (𝐴 × {𝑦}) ↔ (𝑥𝐴𝑦𝐵))
1814, 17syl6bb 276 . . . . . . 7 (𝐶 = ⟨𝑥, 𝑦⟩ → (𝐶 𝑦𝐵 (𝐴 × {𝑦}) ↔ (𝑥𝐴𝑦𝐵)))
1918pm5.32i 668 . . . . . 6 ((𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑦𝐵 (𝐴 × {𝑦})) ↔ (𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
2019exbii 1771 . . . . 5 (∃𝑥(𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑦𝐵 (𝐴 × {𝑦})) ↔ ∃𝑥(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
2113, 20bitr3i 266 . . . 4 ((∃𝑥 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑦𝐵 (𝐴 × {𝑦})) ↔ ∃𝑥(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
2221exbii 1771 . . 3 (∃𝑦(∃𝑥 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑦𝐵 (𝐴 × {𝑦})) ↔ ∃𝑦𝑥(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
239, 12, 223bitr2i 288 . 2 (𝐶 𝑦𝐵 (𝐴 × {𝑦}) ↔ ∃𝑦𝑥(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
24 excom 2039 . 2 (∃𝑦𝑥(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)) ↔ ∃𝑥𝑦(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
2523, 24bitri 264 1 (𝐶 𝑦𝐵 (𝐴 × {𝑦}) ↔ ∃𝑥𝑦(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wb 196  wa 384   = wceq 1480  wex 1701  wcel 1987  wral 2907  {csn 4153  cop 4159   ciun 4490   × cxp 5077  Rel wrel 5084
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4746  ax-nul 4754  ax-pr 4872
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3191  df-sbc 3422  df-csb 3519  df-dif 3562  df-un 3564  df-in 3566  df-ss 3573  df-nul 3897  df-if 4064  df-sn 4154  df-pr 4156  df-op 4160  df-iun 4492  df-opab 4679  df-xp 5085  df-rel 5086
This theorem is referenced by:  mpt2mptx2  41427
  Copyright terms: Public domain W3C validator