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

Theorem elsnxp 6293
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 5674 . . 3 (𝑍 ∈ ({𝑋} × 𝐴) ↔ ∃𝑥∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)))
2 df-rex 3088 . . . . . 6 (∃𝑦 ∈ 𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
3 an13 660 . . . . . . 7 ((𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)) ↔ (𝑦 ∈ 𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
43exbii 1881 . . . . . 6 (∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)) ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
52, 4bitr4i 281 . . . . 5 (∃𝑦 ∈ 𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) ↔ ∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)))
6 elsni 4601 . . . . . . . . 9 (𝑥 ∈ {𝑋} → 𝑥 = 𝑋)
76opeq1d 4839 . . . . . . . 8 (𝑥 ∈ {𝑋} → ⟨𝑥, 𝑦⟩ = ⟨𝑋, 𝑦⟩)
87eqeq2d 2772 . . . . . . 7 (𝑥 ∈ {𝑋} → (𝑍 = ⟨𝑥, 𝑦⟩ ↔ 𝑍 = ⟨𝑋, 𝑦⟩))
98biimpa 482 . . . . . 6 ((𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) → 𝑍 = ⟨𝑋, 𝑦⟩)
109reximi 3101 . . . . 5 (∃𝑦 ∈ 𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) → ∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
115, 10sylbir 238 . . . 4 (∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)) → ∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
1211exlimiv 1963 . . 3 (∃𝑥∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)) → ∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
131, 12sylbi 220 . 2 (𝑍 ∈ ({𝑋} × 𝐴) → ∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
14 snidg 4621 . . . . 5 (𝑋 ∈ 𝑉 → 𝑋 ∈ {𝑋})
15 opelxpi 5688 . . . . 5 ((𝑋 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴) → ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴))
1614, 15sylan 592 . . . 4 ((𝑋 ∈ 𝑉 ∧ 𝑦 ∈ 𝐴) → ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴))
17 eleq1 2849 . . . 4 (𝑍 = ⟨𝑋, 𝑦⟩ → (𝑍 ∈ ({𝑋} × 𝐴) ↔ ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴)))
1816, 17syl5ibrcom 250 . . 3 ((𝑋 ∈ 𝑉 ∧ 𝑦 ∈ 𝐴) → (𝑍 = ⟨𝑋, 𝑦⟩ → 𝑍 ∈ ({𝑋} × 𝐴)))
1918rexlimdva 3164 . 2 (𝑋 ∈ 𝑉 → (∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩ → 𝑍 ∈ ({𝑋} × 𝐴)))
2013, 19impbid2 229 1 (𝑋 ∈ 𝑉 → (𝑍 ∈ ({𝑋} × 𝐴) ↔ ∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∃wrex 3087  {csn 4584  ⟨cop 4590   × cxp 5649
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-opab 5168  df-xp 5657
This theorem is used by:  esum2dlem  34717  esum2d  34718  projf1o  46180  sge0xp  47408
  Copyright terms: Public domain W3C validator