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

Theorem elsnxp 6183
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 5603 . . 3 (𝑍 ∈ ({𝑋} × 𝐴) ↔ ∃𝑥𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)))
2 df-rex 3069 . . . . . 6 (∃𝑦𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) ↔ ∃𝑦(𝑦𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
3 an13 643 . . . . . . 7 ((𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)) ↔ (𝑦𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
43exbii 1851 . . . . . 6 (∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)) ↔ ∃𝑦(𝑦𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
52, 4bitr4i 277 . . . . 5 (∃𝑦𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) ↔ ∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)))
6 elsni 4575 . . . . . . . . 9 (𝑥 ∈ {𝑋} → 𝑥 = 𝑋)
76opeq1d 4807 . . . . . . . 8 (𝑥 ∈ {𝑋} → ⟨𝑥, 𝑦⟩ = ⟨𝑋, 𝑦⟩)
87eqeq2d 2749 . . . . . . 7 (𝑥 ∈ {𝑋} → (𝑍 = ⟨𝑥, 𝑦⟩ ↔ 𝑍 = ⟨𝑋, 𝑦⟩))
98biimpa 476 . . . . . 6 ((𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) → 𝑍 = ⟨𝑋, 𝑦⟩)
109reximi 3174 . . . . 5 (∃𝑦𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) → ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
115, 10sylbir 234 . . . 4 (∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)) → ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
1211exlimiv 1934 . . 3 (∃𝑥𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)) → ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
131, 12sylbi 216 . 2 (𝑍 ∈ ({𝑋} × 𝐴) → ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
14 snidg 4592 . . . . 5 (𝑋𝑉𝑋 ∈ {𝑋})
15 opelxpi 5617 . . . . 5 ((𝑋 ∈ {𝑋} ∧ 𝑦𝐴) → ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴))
1614, 15sylan 579 . . . 4 ((𝑋𝑉𝑦𝐴) → ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴))
17 eleq1 2826 . . . 4 (𝑍 = ⟨𝑋, 𝑦⟩ → (𝑍 ∈ ({𝑋} × 𝐴) ↔ ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴)))
1816, 17syl5ibrcom 246 . . 3 ((𝑋𝑉𝑦𝐴) → (𝑍 = ⟨𝑋, 𝑦⟩ → 𝑍 ∈ ({𝑋} × 𝐴)))
1918rexlimdva 3212 . 2 (𝑋𝑉 → (∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩ → 𝑍 ∈ ({𝑋} × 𝐴)))
2013, 19impbid2 225 1 (𝑋𝑉 → (𝑍 ∈ ({𝑋} × 𝐴) ↔ ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1539  wex 1783  wcel 2108  wrex 3064  {csn 4558  cop 4564   × cxp 5578
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-opab 5133  df-xp 5586
This theorem is referenced by:  esum2dlem  31960  esum2d  31961  projf1o  42625  sge0xp  43857
  Copyright terms: Public domain W3C validator