Theorem elsnxp 6312

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 5711	. . 3 ⊢ (𝑍 ∈ ({𝑋} × 𝐴) ↔ ∃𝑥∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)))
2		df-rex 3068	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
3		an13 647	. . . . . . 7 ⊢ ((𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)) ↔ (𝑦 ∈ 𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
4	3	exbii 1844	. . . . . 6 ⊢ (∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)) ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
5	2, 4	bitr4i 278	. . . . 5 ⊢ (∃𝑦 ∈ 𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) ↔ ∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)))
6		elsni 4647	. . . . . . . . 9 ⊢ (𝑥 ∈ {𝑋} → 𝑥 = 𝑋)
7	6	opeq1d 4883	. . . . . . . 8 ⊢ (𝑥 ∈ {𝑋} → ⟨𝑥, 𝑦⟩ = ⟨𝑋, 𝑦⟩)
8	7	eqeq2d 2745	. . . . . . 7 ⊢ (𝑥 ∈ {𝑋} → (𝑍 = ⟨𝑥, 𝑦⟩ ↔ 𝑍 = ⟨𝑋, 𝑦⟩))
9	8	biimpa 476	. . . . . 6 ⊢ ((𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) → 𝑍 = ⟨𝑋, 𝑦⟩)
10	9	reximi 3081	. . . . 5 ⊢ (∃𝑦 ∈ 𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) → ∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
11	5, 10	sylbir 235	. . . 4 ⊢ (∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)) → ∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
12	11	exlimiv 1927	. . 3 ⊢ (∃𝑥∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)) → ∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
13	1, 12	sylbi 217	. 2 ⊢ (𝑍 ∈ ({𝑋} × 𝐴) → ∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
14		snidg 4664	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → 𝑋 ∈ {𝑋})
15		opelxpi 5725	. . . . 5 ⊢ ((𝑋 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴) → ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴))
16	14, 15	sylan 580	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑦 ∈ 𝐴) → ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴))
17		eleq1 2826	. . . 4 ⊢ (𝑍 = ⟨𝑋, 𝑦⟩ → (𝑍 ∈ ({𝑋} × 𝐴) ↔ ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴)))
18	16, 17	syl5ibrcom 247	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑦 ∈ 𝐴) → (𝑍 = ⟨𝑋, 𝑦⟩ → 𝑍 ∈ ({𝑋} × 𝐴)))
19	18	rexlimdva 3152	. 2 ⊢ (𝑋 ∈ 𝑉 → (∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩ → 𝑍 ∈ ({𝑋} × 𝐴)))
20	13, 19	impbid2 226	1 ⊢ (𝑋 ∈ 𝑉 → (𝑍 ∈ ({𝑋} × 𝐴) ↔ ∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1536  ∃wex 1775   ∈ wcel 2105  ∃wrex 3067  {csn 4630  ⟨cop 4636   × cxp 5686

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-ext 2705  ax-sep 5301  ax-nul 5311  ax-pr 5437

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-sb 2062  df-clab 2712  df-cleq 2726  df-clel 2813  df-ral 3059  df-rex 3068  df-rab 3433  df-v 3479  df-dif 3965  df-un 3967  df-ss 3979  df-nul 4339  df-if 4531  df-sn 4631  df-pr 4633  df-op 4637  df-opab 5210  df-xp 5694

This theorem is referenced by:  esum2dlem  34072  esum2d  34073  projf1o  45139  sge0xp  46384