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

Proof of Theorem eliunxp2
StepHypRef Expression
1 relxp 5360 . . . . . . . 8 Rel (𝐴 × {𝑦})
21rgenw 3133 . . . . . . 7 𝑦𝐵 Rel (𝐴 × {𝑦})
3 reliun 5474 . . . . . . 7 (Rel 𝑦𝐵 (𝐴 × {𝑦}) ↔ ∀𝑦𝐵 Rel (𝐴 × {𝑦}))
42, 3mpbir 223 . . . . . 6 Rel 𝑦𝐵 (𝐴 × {𝑦})
5 elrel 5456 . . . . . 6 ((Rel 𝑦𝐵 (𝐴 × {𝑦}) ∧ 𝐶 𝑦𝐵 (𝐴 × {𝑦})) → ∃𝑥𝑦 𝐶 = ⟨𝑥, 𝑦⟩)
64, 5mpan 681 . . . . 5 (𝐶 𝑦𝐵 (𝐴 × {𝑦}) → ∃𝑥𝑦 𝐶 = ⟨𝑥, 𝑦⟩)
7 excom 2212 . . . . 5 (∃𝑦𝑥 𝐶 = ⟨𝑥, 𝑦⟩ ↔ ∃𝑥𝑦 𝐶 = ⟨𝑥, 𝑦⟩)
86, 7sylibr 226 . . . 4 (𝐶 𝑦𝐵 (𝐴 × {𝑦}) → ∃𝑦𝑥 𝐶 = ⟨𝑥, 𝑦⟩)
98pm4.71ri 556 . . 3 (𝐶 𝑦𝐵 (𝐴 × {𝑦}) ↔ (∃𝑦𝑥 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑦𝐵 (𝐴 × {𝑦})))
10 nfiu1 4770 . . . . 5 𝑦 𝑦𝐵 (𝐴 × {𝑦})
1110nfel2 2986 . . . 4 𝑦 𝐶 𝑦𝐵 (𝐴 × {𝑦})
121119.41 2278 . . 3 (∃𝑦(∃𝑥 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑦𝐵 (𝐴 × {𝑦})) ↔ (∃𝑦𝑥 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑦𝐵 (𝐴 × {𝑦})))
13 19.41v 2048 . . . . 5 (∃𝑥(𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑦𝐵 (𝐴 × {𝑦})) ↔ (∃𝑥 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑦𝐵 (𝐴 × {𝑦})))
14 eleq1 2894 . . . . . . . 8 (𝐶 = ⟨𝑥, 𝑦⟩ → (𝐶 𝑦𝐵 (𝐴 × {𝑦}) ↔ ⟨𝑥, 𝑦⟩ ∈ 𝑦𝐵 (𝐴 × {𝑦})))
15 opeliun2xp 42951 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ ∈ 𝑦𝐵 (𝐴 × {𝑦}) ↔ (𝑦𝐵𝑥𝐴))
16 ancom 454 . . . . . . . . 9 ((𝑦𝐵𝑥𝐴) ↔ (𝑥𝐴𝑦𝐵))
1715, 16bitri 267 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ 𝑦𝐵 (𝐴 × {𝑦}) ↔ (𝑥𝐴𝑦𝐵))
1814, 17syl6bb 279 . . . . . . 7 (𝐶 = ⟨𝑥, 𝑦⟩ → (𝐶 𝑦𝐵 (𝐴 × {𝑦}) ↔ (𝑥𝐴𝑦𝐵)))
1918pm5.32i 570 . . . . . 6 ((𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑦𝐵 (𝐴 × {𝑦})) ↔ (𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
2019exbii 1947 . . . . 5 (∃𝑥(𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑦𝐵 (𝐴 × {𝑦})) ↔ ∃𝑥(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
2113, 20bitr3i 269 . . . 4 ((∃𝑥 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑦𝐵 (𝐴 × {𝑦})) ↔ ∃𝑥(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
2221exbii 1947 . . 3 (∃𝑦(∃𝑥 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 𝑦𝐵 (𝐴 × {𝑦})) ↔ ∃𝑦𝑥(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
239, 12, 223bitr2i 291 . 2 (𝐶 𝑦𝐵 (𝐴 × {𝑦}) ↔ ∃𝑦𝑥(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
24 excom 2212 . 2 (∃𝑦𝑥(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)) ↔ ∃𝑥𝑦(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
2523, 24bitri 267 1 (𝐶 𝑦𝐵 (𝐴 × {𝑦}) ↔ ∃𝑥𝑦(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wb 198  wa 386   = wceq 1656  wex 1878  wcel 2164  wral 3117  {csn 4397  cop 4403   ciun 4740   × cxp 5340  Rel wrel 5347
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1894  ax-4 1908  ax-5 2009  ax-6 2075  ax-7 2112  ax-9 2173  ax-10 2192  ax-11 2207  ax-12 2220  ax-13 2389  ax-ext 2803  ax-sep 5005  ax-nul 5013  ax-pr 5127
This theorem depends on definitions:  df-bi 199  df-an 387  df-or 879  df-3an 1113  df-tru 1660  df-ex 1879  df-nf 1883  df-sb 2068  df-clab 2812  df-cleq 2818  df-clel 2821  df-nfc 2958  df-ral 3122  df-rex 3123  df-rab 3126  df-v 3416  df-sbc 3663  df-csb 3758  df-dif 3801  df-un 3803  df-in 3805  df-ss 3812  df-nul 4145  df-if 4307  df-sn 4398  df-pr 4400  df-op 4404  df-iun 4742  df-opab 4936  df-xp 5348  df-rel 5349
This theorem is referenced by:  mpt2mptx2  42953
  Copyright terms: Public domain W3C validator