Theorem xpcomeng 7120

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 4786	. . 3 ⊢ (𝑥 = 𝐴 → (𝑥 × 𝑦) = (𝐴 × 𝑦))
2		xpeq2 4787	. . 3 ⊢ (𝑥 = 𝐴 → (𝑦 × 𝑥) = (𝑦 × 𝐴))
3	1, 2	breq12d 4141	. 2 ⊢ (𝑥 = 𝐴 → ((𝑥 × 𝑦) ≈ (𝑦 × 𝑥) ↔ (𝐴 × 𝑦) ≈ (𝑦 × 𝐴)))
4		xpeq2 4787	. . 3 ⊢ (𝑦 = 𝐵 → (𝐴 × 𝑦) = (𝐴 × 𝐵))
5		xpeq1 4786	. . 3 ⊢ (𝑦 = 𝐵 → (𝑦 × 𝐴) = (𝐵 × 𝐴))
6	4, 5	breq12d 4141	. 2 ⊢ (𝑦 = 𝐵 → ((𝐴 × 𝑦) ≈ (𝑦 × 𝐴) ↔ (𝐴 × 𝐵) ≈ (𝐵 × 𝐴)))
7		vex 2824	. . 3 ⊢ 𝑥 ∈ V
8		vex 2824	. . 3 ⊢ 𝑦 ∈ V
9	7, 8	xpcomen 7119	. 2 ⊢ (𝑥 × 𝑦) ≈ (𝑦 × 𝑥)
10	3, 6, 9	vtocl2g 2887	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 × 𝐵) ≈ (𝐵 × 𝐴))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209   class class class wbr 4128   × cxp 4770   ≈ cen 7014

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4247  ax-pow 4309  ax-pr 4344  ax-un 4576

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-br 4129  df-opab 4191  df-mpt 4192  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-1st 6368  df-2nd 6369  df-en 7017

This theorem is referenced by:  xpsnen2g  7121  xpdom1g  7125  hashxp  11250