Theorem xpcomeng 6325

Description: Commutative law for equinumerosity of Cartesian product. Proposition 4.22(d) of [Mendelson] p. 254. (Contributed by NM, 27-Mar-2006.)

Assertion

Ref	Expression
xpcomeng	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 × 𝐵) ≈ (𝐵 × 𝐴))

Proof of Theorem xpcomeng

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		xpeq1 4377	. . 3 ⊢ (𝑥 = 𝐴 → (𝑥 × 𝑦) = (𝐴 × 𝑦))
2		xpeq2 4378	. . 3 ⊢ (𝑥 = 𝐴 → (𝑦 × 𝑥) = (𝑦 × 𝐴))
3	1, 2	breq12d 3798	. 2 ⊢ (𝑥 = 𝐴 → ((𝑥 × 𝑦) ≈ (𝑦 × 𝑥) ↔ (𝐴 × 𝑦) ≈ (𝑦 × 𝐴)))
4		xpeq2 4378	. . 3 ⊢ (𝑦 = 𝐵 → (𝐴 × 𝑦) = (𝐴 × 𝐵))
5		xpeq1 4377	. . 3 ⊢ (𝑦 = 𝐵 → (𝑦 × 𝐴) = (𝐵 × 𝐴))
6	4, 5	breq12d 3798	. 2 ⊢ (𝑦 = 𝐵 → ((𝐴 × 𝑦) ≈ (𝑦 × 𝐴) ↔ (𝐴 × 𝐵) ≈ (𝐵 × 𝐴)))
7		vex 2604	. . 3 ⊢ 𝑥 ∈ V
8		vex 2604	. . 3 ⊢ 𝑦 ∈ V
9	7, 8	xpcomen 6324	. 2 ⊢ (𝑥 × 𝑦) ≈ (𝑦 × 𝑥)
10	3, 6, 9	vtocl2g 2662	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 × 𝐵) ≈ (𝐵 × 𝐴))

Syntax hints:   → wi 4   ∧ wa 102   = wceq 1284   ∈ wcel 1433   class class class wbr 3785   × cxp 4361   ≈ cen 6242

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964  ax-un 4188

This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-sbc 2816  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-opab 3840  df-mpt 3841  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930  df-1st 5787  df-2nd 5788  df-en 6245

This theorem is referenced by:  xpsnen2g  6326  xpdom1g  6330