Theorem xp2 8008

Description: Representation of Cartesian product based on ordered pair component functions. (Contributed by NM, 16-Sep-2006.)

Assertion

Ref	Expression
xp2	⊢ (𝐴 × 𝐵) = {𝑥 ∈ (V × V) ∣ ((1st ‘𝑥) ∈ 𝐴 ∧ (2nd ‘𝑥) ∈ 𝐵)}

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem xp2

Step	Hyp	Ref	Expression
1		elxp7 8006	. . 3 ⊢ (𝑥 ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ (V × V) ∧ ((1st ‘𝑥) ∈ 𝐴 ∧ (2nd ‘𝑥) ∈ 𝐵)))
2	1	eqabi 2869	. 2 ⊢ (𝐴 × 𝐵) = {𝑥 ∣ (𝑥 ∈ (V × V) ∧ ((1st ‘𝑥) ∈ 𝐴 ∧ (2nd ‘𝑥) ∈ 𝐵))}
3		df-rab 3433	. 2 ⊢ {𝑥 ∈ (V × V) ∣ ((1st ‘𝑥) ∈ 𝐴 ∧ (2nd ‘𝑥) ∈ 𝐵)} = {𝑥 ∣ (𝑥 ∈ (V × V) ∧ ((1st ‘𝑥) ∈ 𝐴 ∧ (2nd ‘𝑥) ∈ 𝐵))}
4	2, 3	eqtr4i 2763	1 ⊢ (𝐴 × 𝐵) = {𝑥 ∈ (V × V) ∣ ((1st ‘𝑥) ∈ 𝐴 ∧ (2nd ‘𝑥) ∈ 𝐵)}

Syntax hints:   ∧ wa 396   = wceq 1541   ∈ wcel 2106  {cab 2709  {crab 3432  Vcvv 3474   × cxp 5673  ‘cfv 6540  1^st c1st 7969  2^nd c2nd 7970

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5298  ax-nul 5305  ax-pr 5426  ax-un 7721

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-iota 6492  df-fun 6542  df-fv 6548  df-1st 7971  df-2nd 7972

This theorem is referenced by:  unielxp  8009  xpinpreima  32874  xpinpreima2  32875