ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  xpcomeng GIF version

Theorem xpcomeng 7131
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.
StepHypRef Expression
1 xpeq1 4790 . . 3 (𝑥 = 𝐴 → (𝑥 × 𝑦) = (𝐴 × 𝑦))
2 xpeq2 4791 . . 3 (𝑥 = 𝐴 → (𝑦 × 𝑥) = (𝑦 × 𝐴))
31, 2breq12d 4144 . 2 (𝑥 = 𝐴 → ((𝑥 × 𝑦) ≈ (𝑦 × 𝑥) ↔ (𝐴 × 𝑦) ≈ (𝑦 × 𝐴)))
4 xpeq2 4791 . . 3 (𝑦 = 𝐵 → (𝐴 × 𝑦) = (𝐴 × 𝐵))
5 xpeq1 4790 . . 3 (𝑦 = 𝐵 → (𝑦 × 𝐴) = (𝐵 × 𝐴))
64, 5breq12d 4144 . 2 (𝑦 = 𝐵 → ((𝐴 × 𝑦) ≈ (𝑦 × 𝐴) ↔ (𝐴 × 𝐵) ≈ (𝐵 × 𝐴)))
7 vex 2824 . . 3 𝑥 ∈ V
8 vex 2824 . . 3 𝑦 ∈ V
97, 8xpcomen 7130 . 2 (𝑥 × 𝑦) ≈ (𝑦 × 𝑥)
103, 6, 9vtocl2g 2887 1 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 × 𝐵) ≈ (𝐵 × 𝐴))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209   class class class wbr 4131   × cxp 4774   ≈ cen 7025
This proof depends on 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 4251  ax-pow 4313  ax-pr 4348  ax-un 4580
This proof 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 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-1st 6378  df-2nd 6379  df-en 7028
This theorem is used by:  xpsnen2g  7132  xpdom1g  7136  hashxp  11290
  Copyright terms: Public domain W3C validator