Theorem elxpi 5669

Description: Membership in a Cartesian product. Uses fewer axioms than elxp 5670. (Contributed by NM, 4-Jul-1994.)

Assertion

Ref	Expression
elxpi	⊢ (𝐴 ∈ (𝐵 × 𝐶) → ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦

Proof of Theorem elxpi

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqeq1 2766	. . . . 5 ⊢ (𝑧 = 𝐴 → (𝑧 = ⟨𝑥, 𝑦⟩ ↔ 𝐴 = ⟨𝑥, 𝑦⟩))
2	1	anbi1d 640	. . . 4 ⊢ (𝑧 = 𝐴 → ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))))
3	2	2exbidv 1944	. . 3 ⊢ (𝑧 = 𝐴 → (∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))))
4		df-xp 5653	. . . 4 ⊢ (𝐵 × 𝐶) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)}
5		df-opab 5163	. . . 4 ⊢ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))}
6	4, 5	eqtri 2785	. . 3 ⊢ (𝐵 × 𝐶) = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))}
7	3, 6	elab2g 3639	. 2 ⊢ (𝐴 ∈ (𝐵 × 𝐶) → (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))))
8	7	ibi 269	1 ⊢ (𝐴 ∈ (𝐵 × 𝐶) → ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)))

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1560  ∃wex 1799   ∈ wcel 2142  {cab 2740  ⟨cop 4588  {copab 5162   × cxp 5645

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-ext 2734

This theorem depends on definitions:  df-bi 209  df-an 400  df-tru 1563  df-ex 1800  df-sb 2091  df-clab 2741  df-cleq 2754  df-clel 2837  df-opab 5163  df-xp 5653

This theorem is referenced by:  optocl  5741  0xp  5746  xp0  5747  xpdifid  6153  xpdifcnvepel  6154  opreuopreu  8015  djuunxp  9879  rngqiprngimfo  21371  fsumdvdsmul  27259  fmla0xp  35733  mnringmulrcld  44804  rrx2plordisom  49345