Theorem cnvopab 5071

Description: The converse of a class abstraction of ordered pairs. (Contributed by NM, 11-Dec-2003.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)

Assertion

Ref	Expression
cnvopab	⊢ ◡{⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑦, 𝑥⟩ ∣ 𝜑}

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem cnvopab

Dummy variables 𝑧 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		relcnv 5047	. 2 ⊢ Rel ◡{⟨𝑥, 𝑦⟩ ∣ 𝜑}
2		relopab 4792	. 2 ⊢ Rel {⟨𝑦, 𝑥⟩ ∣ 𝜑}
3		opelopabsbALT 4293	. . . 4 ⊢ (⟨𝑤, 𝑧⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ [𝑧 / 𝑦][𝑤 / 𝑥]𝜑)
4		sbcom2 2006	. . . 4 ⊢ ([𝑧 / 𝑦][𝑤 / 𝑥]𝜑 ↔ [𝑤 / 𝑥][𝑧 / 𝑦]𝜑)
5	3, 4	bitri 184	. . 3 ⊢ (⟨𝑤, 𝑧⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ [𝑤 / 𝑥][𝑧 / 𝑦]𝜑)
6		vex 2766	. . . 4 ⊢ 𝑧 ∈ V
7		vex 2766	. . . 4 ⊢ 𝑤 ∈ V
8	6, 7	opelcnv 4848	. . 3 ⊢ (⟨𝑧, 𝑤⟩ ∈ ◡{⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ⟨𝑤, 𝑧⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
9		opelopabsbALT 4293	. . 3 ⊢ (⟨𝑧, 𝑤⟩ ∈ {⟨𝑦, 𝑥⟩ ∣ 𝜑} ↔ [𝑤 / 𝑥][𝑧 / 𝑦]𝜑)
10	5, 8, 9	3bitr4i 212	. 2 ⊢ (⟨𝑧, 𝑤⟩ ∈ ◡{⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ⟨𝑧, 𝑤⟩ ∈ {⟨𝑦, 𝑥⟩ ∣ 𝜑})
11	1, 2, 10	eqrelriiv 4757	1 ⊢ ◡{⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑦, 𝑥⟩ ∣ 𝜑}

Syntax hints:   = wceq 1364  [wsb 1776   ∈ wcel 2167  ⟨cop 3625  {copab 4093  ^◡ccnv 4662

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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-br 4034  df-opab 4095  df-xp 4669  df-rel 4670  df-cnv 4671

This theorem is referenced by:  mptcnv  5072  cnvxp  5088  mptpreima  5163  f1ocnvd  6125  cnvoprab  6292  mapsncnv  6754  lgsquadlem3  15320