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

Theorem elsnxp 5594
Description: Elementhood to 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 5055 . . 3 (𝑍 ∈ ({𝑋} × 𝐴) ↔ ∃𝑥𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)))
2 df-rex 2902 . . . . . 6 (∃𝑦𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) ↔ ∃𝑦(𝑦𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
3 an13 836 . . . . . . 7 ((𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)) ↔ (𝑦𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
43exbii 1764 . . . . . 6 (∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)) ↔ ∃𝑦(𝑦𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
52, 4bitr4i 266 . . . . 5 (∃𝑦𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) ↔ ∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)))
6 elsni 4142 . . . . . . . . 9 (𝑥 ∈ {𝑋} → 𝑥 = 𝑋)
76opeq1d 4346 . . . . . . . 8 (𝑥 ∈ {𝑋} → ⟨𝑥, 𝑦⟩ = ⟨𝑋, 𝑦⟩)
87eqeq2d 2620 . . . . . . 7 (𝑥 ∈ {𝑋} → (𝑍 = ⟨𝑥, 𝑦⟩ ↔ 𝑍 = ⟨𝑋, 𝑦⟩))
98biimpa 500 . . . . . 6 ((𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) → 𝑍 = ⟨𝑋, 𝑦⟩)
109reximi 2994 . . . . 5 (∃𝑦𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) → ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
115, 10sylbir 224 . . . 4 (∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)) → ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
1211exlimiv 1845 . . 3 (∃𝑥𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)) → ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
131, 12sylbi 206 . 2 (𝑍 ∈ ({𝑋} × 𝐴) → ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
14 snidg 4153 . . . . 5 (𝑋𝑉𝑋 ∈ {𝑋})
15 opelxpi 5072 . . . . 5 ((𝑋 ∈ {𝑋} ∧ 𝑦𝐴) → ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴))
1614, 15sylan 487 . . . 4 ((𝑋𝑉𝑦𝐴) → ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴))
17 eleq1 2676 . . . 4 (𝑍 = ⟨𝑋, 𝑦⟩ → (𝑍 ∈ ({𝑋} × 𝐴) ↔ ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴)))
1816, 17syl5ibrcom 236 . . 3 ((𝑋𝑉𝑦𝐴) → (𝑍 = ⟨𝑋, 𝑦⟩ → 𝑍 ∈ ({𝑋} × 𝐴)))
1918rexlimdva 3013 . 2 (𝑋𝑉 → (∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩ → 𝑍 ∈ ({𝑋} × 𝐴)))
2013, 19impbid2 215 1 (𝑋𝑉 → (𝑍 ∈ ({𝑋} × 𝐴) ↔ ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383   = wceq 1475  wex 1695  wcel 1977  wrex 2897  {csn 4125  cop 4131   × cxp 5036
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-opab 4644  df-xp 5044
This theorem is referenced by:  esum2dlem  29481  esum2d  29482  projf1o  38381  sge0xp  39322
  Copyright terms: Public domain W3C validator