Theorem elsnxp 5677

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.

Step	Hyp	Ref	Expression
1		elxp 5131	. . 3 ⊢ (𝑍 ∈ ({𝑋} × 𝐴) ↔ ∃𝑥∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)))
2		df-rex 2918	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
3		an13 840	. . . . . . 7 ⊢ ((𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)) ↔ (𝑦 ∈ 𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
4	3	exbii 1774	. . . . . 6 ⊢ (∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)) ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
5	2, 4	bitr4i 267	. . . . 5 ⊢ (∃𝑦 ∈ 𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) ↔ ∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)))
6		elsni 4194	. . . . . . . . 9 ⊢ (𝑥 ∈ {𝑋} → 𝑥 = 𝑋)
7	6	opeq1d 4408	. . . . . . . 8 ⊢ (𝑥 ∈ {𝑋} → ⟨𝑥, 𝑦⟩ = ⟨𝑋, 𝑦⟩)
8	7	eqeq2d 2632	. . . . . . 7 ⊢ (𝑥 ∈ {𝑋} → (𝑍 = ⟨𝑥, 𝑦⟩ ↔ 𝑍 = ⟨𝑋, 𝑦⟩))
9	8	biimpa 501	. . . . . 6 ⊢ ((𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) → 𝑍 = ⟨𝑋, 𝑦⟩)
10	9	reximi 3011	. . . . 5 ⊢ (∃𝑦 ∈ 𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) → ∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
11	5, 10	sylbir 225	. . . 4 ⊢ (∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)) → ∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
12	11	exlimiv 1858	. . 3 ⊢ (∃𝑥∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴)) → ∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
13	1, 12	sylbi 207	. 2 ⊢ (𝑍 ∈ ({𝑋} × 𝐴) → ∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
14		snidg 4206	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → 𝑋 ∈ {𝑋})
15		opelxpi 5148	. . . . 5 ⊢ ((𝑋 ∈ {𝑋} ∧ 𝑦 ∈ 𝐴) → ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴))
16	14, 15	sylan 488	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑦 ∈ 𝐴) → ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴))
17		eleq1 2689	. . . 4 ⊢ (𝑍 = ⟨𝑋, 𝑦⟩ → (𝑍 ∈ ({𝑋} × 𝐴) ↔ ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴)))
18	16, 17	syl5ibrcom 237	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑦 ∈ 𝐴) → (𝑍 = ⟨𝑋, 𝑦⟩ → 𝑍 ∈ ({𝑋} × 𝐴)))
19	18	rexlimdva 3031	. 2 ⊢ (𝑋 ∈ 𝑉 → (∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩ → 𝑍 ∈ ({𝑋} × 𝐴)))
20	13, 19	impbid2 216	1 ⊢ (𝑋 ∈ 𝑉 → (𝑍 ∈ ({𝑋} × 𝐴) ↔ ∃𝑦 ∈ 𝐴 𝑍 = ⟨𝑋, 𝑦⟩))

Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   = wceq 1483  ∃wex 1704   ∈ wcel 1990  ∃wrex 2913  {csn 4177  ⟨cop 4183   × cxp 5112

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-opab 4713  df-xp 5120

This theorem is referenced by:  esum2dlem  30154  esum2d  30155  projf1o  39386  sge0xp  40646