Metamath Proof Explorer


Theorem cnvxp

Description: The converse of a Cartesian product. Exercise 11 of Suppes p. 67. (Contributed by NM, 14-Aug-1999) (Proof shortened by Andrew Salmon, 27-Aug-2011) Avoid ax-11 . (Revised by SN, 26-Aug-2026)

Ref Expression
Assertion cnvxp ⊢ A × B -1 = B × A

Proof

Step Hyp Ref Expression
1 relcnv ⊢ Rel ⁡ A × B -1
2 relxp ⊢ Rel ⁡ B × A
3 vex ⊢ x ∈ V
4 vex ⊢ y ∈ V
5 3 4 brcnv ⊢ x A × B -1 y ↔ y A × B x
6 ancom ⊢ y ∈ A ∧ x ∈ B ↔ x ∈ B ∧ y ∈ A
7 brxp ⊢ y A × B x ↔ y ∈ A ∧ x ∈ B
8 brxp ⊢ x B × A y ↔ x ∈ B ∧ y ∈ A
9 6 7 8 3bitr4i ⊢ y A × B x ↔ x B × A y
10 5 9 bitri ⊢ x A × B -1 y ↔ x B × A y
11 1 2 10 eqbrriv ⊢ A × B -1 = B × A