Theorem elsnxp 6280

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.

Step	Hyp	Ref	Expression
1		elxp 5677	. . 3 ⊢ (𝑍 ∈ ({𝑋} × 𝐴) ↔ ∃𝑥∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)))
2		df-rex 3061	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
3		an13 647	. . . . . . 7 ⊢ ((𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)) ↔ (𝑦 ∈ 𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
4	3	exbii 1848	. . . . . 6 ⊢ (∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)) ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
5	2, 4	bitr4i 278	. . . . 5 ⊢ (∃𝑦 ∈ 𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) ↔ ∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)))
6		elsni 4618	. . . . . . . . 9 ⊢ (𝑥 ∈ {𝑋} → 𝑥 = 𝑋)
7	6	opeq1d 4855	. . . . . . . 8 ⊢ (𝑥 ∈ {𝑋} → ⟨𝑥, 𝑦⟩ = ⟨𝑋, 𝑦⟩)
8	7	eqeq2d 2746	. . . . . . 7 ⊢ (𝑥 ∈ {𝑋} → (𝑍 = ⟨𝑥, 𝑦⟩ ↔ 𝑍 = ⟨𝑋, 𝑦⟩))
9	8	biimpa 476	. . . . . 6 ⊢ ((𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) → 𝑍 = ⟨𝑋, 𝑦⟩)
10	9	reximi 3074	. . . . 5 ⊢ (∃𝑦 ∈ 𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) → ∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
11	5, 10	sylbir 235	. . . 4 ⊢ (∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)) → ∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
12	11	exlimiv 1930	. . 3 ⊢ (∃𝑥∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)) → ∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
13	1, 12	sylbi 217	. 2 ⊢ (𝑍 ∈ ({𝑋} × 𝐴) → ∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
14		snidg 4636	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → 𝑋 ∈ {𝑋})
15		opelxpi 5691	. . . . 5 ⊢ ((𝑋 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴) → ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴))
16	14, 15	sylan 580	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑦 ∈ 𝐴) → ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴))
17		eleq1 2822	. . . 4 ⊢ (𝑍 = ⟨𝑋, 𝑦⟩ → (𝑍 ∈ ({𝑋} × 𝐴) ↔ ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴)))
18	16, 17	syl5ibrcom 247	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑦 ∈ 𝐴) → (𝑍 = ⟨𝑋, 𝑦⟩ → 𝑍 ∈ ({𝑋} × 𝐴)))
19	18	rexlimdva 3141	. 2 ⊢ (𝑋 ∈ 𝑉 → (∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩ → 𝑍 ∈ ({𝑋} × 𝐴)))
20	13, 19	impbid2 226	1 ⊢ (𝑋 ∈ 𝑉 → (𝑍 ∈ ({𝑋} × 𝐴) ↔ ∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540  ∃wex 1779   ∈ wcel 2108  ∃wrex 3060  {csn 4601  ⟨cop 4607   × cxp 5652

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pr 5402

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2065  df-clab 2714  df-cleq 2727  df-clel 2809  df-ral 3052  df-rex 3061  df-rab 3416  df-v 3461  df-dif 3929  df-un 3931  df-ss 3943  df-nul 4309  df-if 4501  df-sn 4602  df-pr 4604  df-op 4608  df-opab 5182  df-xp 5660

This theorem is referenced by:  esum2dlem  34069  esum2d  34070  projf1o  45169  sge0xp  46406