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

Theorem opeliun2xp 5720
Description: Membership of an ordered pair in a union of Cartesian products over its second component, analogous to opeliunxp 5719. (Contributed by AV, 30-Mar-2019.)
Assertion
Ref Expression
opeliun2xp (⟨𝐶, 𝑦⟩ ∈ 𝑦𝐵 (𝐴 × {𝑦}) ↔ (𝑦𝐵𝐶𝐴))

Proof of Theorem opeliun2xp
Dummy variables 𝑥 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-iun 4954 . . 3 𝑦𝐵 (𝐴 × {𝑦}) = {𝑥 ∣ ∃𝑦𝐵 𝑥 ∈ (𝐴 × {𝑦})}
21eleq2i 2857 . 2 (⟨𝐶, 𝑦⟩ ∈ 𝑦𝐵 (𝐴 × {𝑦}) ↔ ⟨𝐶, 𝑦⟩ ∈ {𝑥 ∣ ∃𝑦𝐵 𝑥 ∈ (𝐴 × {𝑦})})
3 opex 5436 . . 3 𝐶, 𝑦⟩ ∈ V
4 df-rex 3090 . . . . 5 (∃𝑦𝐵 𝑥 ∈ (𝐴 × {𝑦}) ↔ ∃𝑦(𝑦𝐵𝑥 ∈ (𝐴 × {𝑦})))
5 nfv 1937 . . . . . 6 𝑧(𝑦𝐵𝑥 ∈ (𝐴 × {𝑦}))
6 nfs1v 2193 . . . . . . 7 𝑦[𝑧 / 𝑦]𝑦𝐵
7 nfcsb1v 3879 . . . . . . . . 9 𝑦𝑧 / 𝑦𝐴
8 nfcv 2927 . . . . . . . . 9 𝑦{𝑧}
97, 8nfxp 5685 . . . . . . . 8 𝑦(𝑧 / 𝑦𝐴 × {𝑧})
109nfcri 2919 . . . . . . 7 𝑦 𝑥 ∈ (𝑧 / 𝑦𝐴 × {𝑧})
116, 10nfan 1922 . . . . . 6 𝑦([𝑧 / 𝑦]𝑦𝐵𝑥 ∈ (𝑧 / 𝑦𝐴 × {𝑧}))
12 sbequ12 2289 . . . . . . 7 (𝑦 = 𝑧 → (𝑦𝐵 ↔ [𝑧 / 𝑦]𝑦𝐵))
13 csbeq1a 3869 . . . . . . . . 9 (𝑦 = 𝑧𝐴 = 𝑧 / 𝑦𝐴)
14 sneq 4595 . . . . . . . . 9 (𝑦 = 𝑧 → {𝑦} = {𝑧})
1513, 14xpeq12d 5683 . . . . . . . 8 (𝑦 = 𝑧 → (𝐴 × {𝑦}) = (𝑧 / 𝑦𝐴 × {𝑧}))
1615eleq2d 2851 . . . . . . 7 (𝑦 = 𝑧 → (𝑥 ∈ (𝐴 × {𝑦}) ↔ 𝑥 ∈ (𝑧 / 𝑦𝐴 × {𝑧})))
1712, 16anbi12d 643 . . . . . 6 (𝑦 = 𝑧 → ((𝑦𝐵𝑥 ∈ (𝐴 × {𝑦})) ↔ ([𝑧 / 𝑦]𝑦𝐵𝑥 ∈ (𝑧 / 𝑦𝐴 × {𝑧}))))
185, 11, 17cbvexv1 2376 . . . . 5 (∃𝑦(𝑦𝐵𝑥 ∈ (𝐴 × {𝑦})) ↔ ∃𝑧([𝑧 / 𝑦]𝑦𝐵𝑥 ∈ (𝑧 / 𝑦𝐴 × {𝑧})))
194, 18bitri 278 . . . 4 (∃𝑦𝐵 𝑥 ∈ (𝐴 × {𝑦}) ↔ ∃𝑧([𝑧 / 𝑦]𝑦𝐵𝑥 ∈ (𝑧 / 𝑦𝐴 × {𝑧})))
20 eleq1 2853 . . . . . 6 (𝑥 = ⟨𝐶, 𝑦⟩ → (𝑥 ∈ (𝑧 / 𝑦𝐴 × {𝑧}) ↔ ⟨𝐶, 𝑦⟩ ∈ (𝑧 / 𝑦𝐴 × {𝑧})))
2120anbi2d 641 . . . . 5 (𝑥 = ⟨𝐶, 𝑦⟩ → (([𝑧 / 𝑦]𝑦𝐵𝑥 ∈ (𝑧 / 𝑦𝐴 × {𝑧})) ↔ ([𝑧 / 𝑦]𝑦𝐵 ∧ ⟨𝐶, 𝑦⟩ ∈ (𝑧 / 𝑦𝐴 × {𝑧}))))
2221exbidv 1944 . . . 4 (𝑥 = ⟨𝐶, 𝑦⟩ → (∃𝑧([𝑧 / 𝑦]𝑦𝐵𝑥 ∈ (𝑧 / 𝑦𝐴 × {𝑧})) ↔ ∃𝑧([𝑧 / 𝑦]𝑦𝐵 ∧ ⟨𝐶, 𝑦⟩ ∈ (𝑧 / 𝑦𝐴 × {𝑧}))))
2319, 22bitrid 286 . . 3 (𝑥 = ⟨𝐶, 𝑦⟩ → (∃𝑦𝐵 𝑥 ∈ (𝐴 × {𝑦}) ↔ ∃𝑧([𝑧 / 𝑦]𝑦𝐵 ∧ ⟨𝐶, 𝑦⟩ ∈ (𝑧 / 𝑦𝐴 × {𝑧}))))
243, 23elab 3641 . 2 (⟨𝐶, 𝑦⟩ ∈ {𝑥 ∣ ∃𝑦𝐵 𝑥 ∈ (𝐴 × {𝑦})} ↔ ∃𝑧([𝑧 / 𝑦]𝑦𝐵 ∧ ⟨𝐶, 𝑦⟩ ∈ (𝑧 / 𝑦𝐴 × {𝑧})))
25 opelxp 5688 . . . . . 6 (⟨𝐶, 𝑦⟩ ∈ (𝑧 / 𝑦𝐴 × {𝑧}) ↔ (𝐶𝑧 / 𝑦𝐴𝑦 ∈ {𝑧}))
2625anbi2i 634 . . . . 5 (([𝑧 / 𝑦]𝑦𝐵 ∧ ⟨𝐶, 𝑦⟩ ∈ (𝑧 / 𝑦𝐴 × {𝑧})) ↔ ([𝑧 / 𝑦]𝑦𝐵 ∧ (𝐶𝑧 / 𝑦𝐴𝑦 ∈ {𝑧})))
27 an13 659 . . . . . 6 (([𝑧 / 𝑦]𝑦𝐵 ∧ (𝐶𝑧 / 𝑦𝐴𝑦 ∈ {𝑧})) ↔ (𝑦 ∈ {𝑧} ∧ (𝐶𝑧 / 𝑦𝐴 ∧ [𝑧 / 𝑦]𝑦𝐵)))
28 ancom 465 . . . . . . 7 ((𝐶𝑧 / 𝑦𝐴 ∧ [𝑧 / 𝑦]𝑦𝐵) ↔ ([𝑧 / 𝑦]𝑦𝐵𝐶𝑧 / 𝑦𝐴))
2928anbi2i 634 . . . . . 6 ((𝑦 ∈ {𝑧} ∧ (𝐶𝑧 / 𝑦𝐴 ∧ [𝑧 / 𝑦]𝑦𝐵)) ↔ (𝑦 ∈ {𝑧} ∧ ([𝑧 / 𝑦]𝑦𝐵𝐶𝑧 / 𝑦𝐴)))
3027, 29bitri 278 . . . . 5 (([𝑧 / 𝑦]𝑦𝐵 ∧ (𝐶𝑧 / 𝑦𝐴𝑦 ∈ {𝑧})) ↔ (𝑦 ∈ {𝑧} ∧ ([𝑧 / 𝑦]𝑦𝐵𝐶𝑧 / 𝑦𝐴)))
31 velsn 4601 . . . . . . 7 (𝑦 ∈ {𝑧} ↔ 𝑦 = 𝑧)
32 equcom 2041 . . . . . . 7 (𝑦 = 𝑧𝑧 = 𝑦)
3331, 32bitri 278 . . . . . 6 (𝑦 ∈ {𝑧} ↔ 𝑧 = 𝑦)
3433anbi1i 635 . . . . 5 ((𝑦 ∈ {𝑧} ∧ ([𝑧 / 𝑦]𝑦𝐵𝐶𝑧 / 𝑦𝐴)) ↔ (𝑧 = 𝑦 ∧ ([𝑧 / 𝑦]𝑦𝐵𝐶𝑧 / 𝑦𝐴)))
3526, 30, 343bitri 300 . . . 4 (([𝑧 / 𝑦]𝑦𝐵 ∧ ⟨𝐶, 𝑦⟩ ∈ (𝑧 / 𝑦𝐴 × {𝑧})) ↔ (𝑧 = 𝑦 ∧ ([𝑧 / 𝑦]𝑦𝐵𝐶𝑧 / 𝑦𝐴)))
3635exbii 1871 . . 3 (∃𝑧([𝑧 / 𝑦]𝑦𝐵 ∧ ⟨𝐶, 𝑦⟩ ∈ (𝑧 / 𝑦𝐴 × {𝑧})) ↔ ∃𝑧(𝑧 = 𝑦 ∧ ([𝑧 / 𝑦]𝑦𝐵𝐶𝑧 / 𝑦𝐴)))
37 sbequ12r 2290 . . . . 5 (𝑧 = 𝑦 → ([𝑧 / 𝑦]𝑦𝐵𝑦𝐵))
3813equcoms 2043 . . . . . . 7 (𝑧 = 𝑦𝐴 = 𝑧 / 𝑦𝐴)
3938eqcomd 2771 . . . . . 6 (𝑧 = 𝑦𝑧 / 𝑦𝐴 = 𝐴)
4039eleq2d 2851 . . . . 5 (𝑧 = 𝑦 → (𝐶𝑧 / 𝑦𝐴𝐶𝐴))
4137, 40anbi12d 643 . . . 4 (𝑧 = 𝑦 → (([𝑧 / 𝑦]𝑦𝐵𝐶𝑧 / 𝑦𝐴) ↔ (𝑦𝐵𝐶𝐴)))
4241equsexvw 2028 . . 3 (∃𝑧(𝑧 = 𝑦 ∧ ([𝑧 / 𝑦]𝑦𝐵𝐶𝑧 / 𝑦𝐴)) ↔ (𝑦𝐵𝐶𝐴))
4336, 42bitri 278 . 2 (∃𝑧([𝑧 / 𝑦]𝑦𝐵 ∧ ⟨𝐶, 𝑦⟩ ∈ (𝑧 / 𝑦𝐴 × {𝑧})) ↔ (𝑦𝐵𝐶𝐴))
442, 24, 433bitri 300 1 (⟨𝐶, 𝑦⟩ ∈ 𝑦𝐵 (𝐴 × {𝑦}) ↔ (𝑦𝐵𝐶𝐴))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 400   = wceq 1563  wex 1802  [wsb 2093  wcel 2145  {cab 2743  wrex 3089  csb 3855  {csn 4585  cop 4591   ciun 4952   × cxp 5650
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-pr 5395
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-iun 4954  df-opab 5168  df-xp 5658
This theorem is referenced by:  fldextrspunlsplem  33980  eliunxp2  48965
  Copyright terms: Public domain W3C validator