Theorem elaltxp 35970

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 3502	. 2 ⊢ (𝑋 ∈ (𝐴 ×× 𝐵) → 𝑋 ∈ V)
2		altopex 35955	. . . . 5 ⊢ ⟪𝑥, 𝑦⟫ ∈ V
3		eleq1 2829	. . . . 5 ⊢ (𝑋 = ⟪𝑥, 𝑦⟫ → (𝑋 ∈ V ↔ ⟪𝑥, 𝑦⟫ ∈ V))
4	2, 3	mpbiri 258	. . . 4 ⊢ (𝑋 = ⟪𝑥, 𝑦⟫ → 𝑋 ∈ V)
5	4	a1i 11	. . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑋 = ⟪𝑥, 𝑦⟫ → 𝑋 ∈ V))
6	5	rexlimivv 3201	. 2 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑋 = ⟪𝑥, 𝑦⟫ → 𝑋 ∈ V)
7		eqeq1 2741	. . . 4 ⊢ (𝑧 = 𝑋 → (𝑧 = ⟪𝑥, 𝑦⟫ ↔ 𝑋 = ⟪𝑥, 𝑦⟫))
8	7	2rexbidv 3222	. . 3 ⊢ (𝑧 = 𝑋 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟪𝑥, 𝑦⟫ ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑋 = ⟪𝑥, 𝑦⟫))
9		df-altxp 35954	. . 3 ⊢ (𝐴 ×× 𝐵) = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟪𝑥, 𝑦⟫}
10	8, 9	elab2g 3686	. 2 ⊢ (𝑋 ∈ V → (𝑋 ∈ (𝐴 ×× 𝐵) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑋 = ⟪𝑥, 𝑦⟫))
11	1, 6, 10	pm5.21nii 378	1 ⊢ (𝑋 ∈ (𝐴 ×× 𝐵) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑋 = ⟪𝑥, 𝑦⟫)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1539   ∈ wcel 2108  ∃wrex 3070  Vcvv 3481  ⟪caltop 35951   ×× caltxp 35952

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2708  ax-sep 5305  ax-nul 5315  ax-pr 5441

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1542  df-fal 1552  df-ex 1779  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-rex 3071  df-v 3483  df-dif 3969  df-un 3971  df-nul 4343  df-sn 4635  df-pr 4637  df-altop 35953  df-altxp 35954

This theorem is referenced by:  altopelaltxp  35971  altxpsspw  35972