Theorem elaltxp 33431

Description: Membership in alternate Cartesian products. (Contributed by Scott Fenton, 23-Mar-2012.)

Assertion

Ref	Expression
elaltxp	⊢ (𝑋 ∈ (𝐴 ×× 𝐵) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑋 = ⟪𝑥, 𝑦⟫)

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

Proof of Theorem elaltxp

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3513	. 2 ⊢ (𝑋 ∈ (𝐴 ×× 𝐵) → 𝑋 ∈ V)
2		altopex 33416	. . . . 5 ⊢ ⟪𝑥, 𝑦⟫ ∈ V
3		eleq1 2900	. . . . 5 ⊢ (𝑋 = ⟪𝑥, 𝑦⟫ → (𝑋 ∈ V ↔ ⟪𝑥, 𝑦⟫ ∈ V))
4	2, 3	mpbiri 260	. . . 4 ⊢ (𝑋 = ⟪𝑥, 𝑦⟫ → 𝑋 ∈ V)
5	4	a1i 11	. . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑋 = ⟪𝑥, 𝑦⟫ → 𝑋 ∈ V))
6	5	rexlimivv 3292	. 2 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑋 = ⟪𝑥, 𝑦⟫ → 𝑋 ∈ V)
7		eqeq1 2825	. . . 4 ⊢ (𝑧 = 𝑋 → (𝑧 = ⟪𝑥, 𝑦⟫ ↔ 𝑋 = ⟪𝑥, 𝑦⟫))
8	7	2rexbidv 3300	. . 3 ⊢ (𝑧 = 𝑋 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟪𝑥, 𝑦⟫ ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑋 = ⟪𝑥, 𝑦⟫))
9		df-altxp 33415	. . 3 ⊢ (𝐴 ×× 𝐵) = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟪𝑥, 𝑦⟫}
10	8, 9	elab2g 3668	. 2 ⊢ (𝑋 ∈ V → (𝑋 ∈ (𝐴 ×× 𝐵) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑋 = ⟪𝑥, 𝑦⟫))
11	1, 6, 10	pm5.21nii 382	1 ⊢ (𝑋 ∈ (𝐴 ×× 𝐵) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑋 = ⟪𝑥, 𝑦⟫)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1533   ∈ wcel 2110  ∃wrex 3139  Vcvv 3495  ⟪caltop 33412   ×× caltxp 33413

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-sep 5196  ax-nul 5203  ax-pr 5322

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-v 3497  df-dif 3939  df-un 3941  df-nul 4292  df-sn 4562  df-pr 4564  df-altop 33414  df-altxp 33415

This theorem is referenced by:  altopelaltxp  33432  altxpsspw  33433