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

Theorem elsnxp 6144
Description: Membership in a Cartesian product with a singleton. (Contributed by Thierry Arnoux, 10-Apr-2020.) (Proof shortened by JJ, 14-Jul-2021.)
Assertion
Ref Expression
elsnxp (𝑋𝑉 → (𝑍 ∈ ({𝑋} × 𝐴) ↔ ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩))
Distinct variable groups:   𝑦,𝐴   𝑦,𝑉   𝑦,𝑋   𝑦,𝑍

Proof of Theorem elsnxp
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 elxp 5580 . . 3 (𝑍 ∈ ({𝑋} × 𝐴) ↔ ∃𝑥𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)))
2 df-rex 3146 . . . . . 6 (∃𝑦𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) ↔ ∃𝑦(𝑦𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
3 an13 645 . . . . . . 7 ((𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)) ↔ (𝑦𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
43exbii 1848 . . . . . 6 (∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)) ↔ ∃𝑦(𝑦𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
52, 4bitr4i 280 . . . . 5 (∃𝑦𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) ↔ ∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)))
6 elsni 4586 . . . . . . . . 9 (𝑥 ∈ {𝑋} → 𝑥 = 𝑋)
76opeq1d 4811 . . . . . . . 8 (𝑥 ∈ {𝑋} → ⟨𝑥, 𝑦⟩ = ⟨𝑋, 𝑦⟩)
87eqeq2d 2834 . . . . . . 7 (𝑥 ∈ {𝑋} → (𝑍 = ⟨𝑥, 𝑦⟩ ↔ 𝑍 = ⟨𝑋, 𝑦⟩))
98biimpa 479 . . . . . 6 ((𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) → 𝑍 = ⟨𝑋, 𝑦⟩)
109reximi 3245 . . . . 5 (∃𝑦𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) → ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
115, 10sylbir 237 . . . 4 (∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)) → ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
1211exlimiv 1931 . . 3 (∃𝑥𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)) → ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
131, 12sylbi 219 . 2 (𝑍 ∈ ({𝑋} × 𝐴) → ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
14 snidg 4601 . . . . 5 (𝑋𝑉𝑋 ∈ {𝑋})
15 opelxpi 5594 . . . . 5 ((𝑋 ∈ {𝑋} ∧ 𝑦𝐴) → ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴))
1614, 15sylan 582 . . . 4 ((𝑋𝑉𝑦𝐴) → ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴))
17 eleq1 2902 . . . 4 (𝑍 = ⟨𝑋, 𝑦⟩ → (𝑍 ∈ ({𝑋} × 𝐴) ↔ ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴)))
1816, 17syl5ibrcom 249 . . 3 ((𝑋𝑉𝑦𝐴) → (𝑍 = ⟨𝑋, 𝑦⟩ → 𝑍 ∈ ({𝑋} × 𝐴)))
1918rexlimdva 3286 . 2 (𝑋𝑉 → (∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩ → 𝑍 ∈ ({𝑋} × 𝐴)))
2013, 19impbid2 228 1 (𝑋𝑉 → (𝑍 ∈ ({𝑋} × 𝐴) ↔ ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1537  wex 1780  wcel 2114  wrex 3141  {csn 4569  cop 4575   × cxp 5555
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pr 5332
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-opab 5131  df-xp 5563
This theorem is referenced by:  esum2dlem  31353  esum2d  31354  projf1o  41466  sge0xp  42718
  Copyright terms: Public domain W3C validator