MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cnvxpOLD Structured version   Visualization version   GIF version

Theorem cnvxpOLD 6151
Description: Obsolete version of cnvxp 6150 as of 26-Aug-2026. (Contributed by NM, 14-Aug-1999.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
cnvxpOLD (𝐴 × 𝐵) = (𝐵 × 𝐴)

Proof of Theorem cnvxpOLD
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cnvopab 6133 . . 3 {⟨𝑦, 𝑥⟩ ∣ (𝑦𝐴𝑥𝐵)} = {⟨𝑥, 𝑦⟩ ∣ (𝑦𝐴𝑥𝐵)}
2 ancom 466 . . . 4 ((𝑦𝐴𝑥𝐵) ↔ (𝑥𝐵𝑦𝐴))
32opabbii 5172 . . 3 {⟨𝑥, 𝑦⟩ ∣ (𝑦𝐴𝑥𝐵)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝑦𝐴)}
41, 3eqtri 2783 . 2 {⟨𝑦, 𝑥⟩ ∣ (𝑦𝐴𝑥𝐵)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝑦𝐴)}
5 df-xp 5661 . . 3 (𝐴 × 𝐵) = {⟨𝑦, 𝑥⟩ ∣ (𝑦𝐴𝑥𝐵)}
65cnveqi 5856 . 2 (𝐴 × 𝐵) = {⟨𝑦, 𝑥⟩ ∣ (𝑦𝐴𝑥𝐵)}
7 df-xp 5661 . 2 (𝐵 × 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝑦𝐴)}
84, 6, 73eqtr4i 2793 1 (𝐴 × 𝐵) = (𝐵 × 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wa 401   = wceq 1570  wcel 2145  {copab 5167   × cxp 5653  ccnv 5654
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-11 2194  ax-ext 2732  ax-sep 5251  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5661  df-rel 5662  df-cnv 5663
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator