Theorem cnvopab 5130

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 5106	. 2 ⊢ Rel ◡{⟨𝑥, 𝑦⟩ ∣ 𝜑}
2		relopab 4848	. 2 ⊢ Rel {⟨𝑦, 𝑥⟩ ∣ 𝜑}
3		opelopabsbALT 4347	. . . 4 ⊢ (⟨𝑤, 𝑧⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ [𝑧 / 𝑦][𝑤 / 𝑥]𝜑)
4		sbcom2 2038	. . . 4 ⊢ ([𝑧 / 𝑦][𝑤 / 𝑥]𝜑 ↔ [𝑤 / 𝑥][𝑧 / 𝑦]𝜑)
5	3, 4	bitri 184	. . 3 ⊢ (⟨𝑤, 𝑧⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ [𝑤 / 𝑥][𝑧 / 𝑦]𝜑)
6		vex 2802	. . . 4 ⊢ 𝑧 ∈ V
7		vex 2802	. . . 4 ⊢ 𝑤 ∈ V
8	6, 7	opelcnv 4904	. . 3 ⊢ (⟨𝑧, 𝑤⟩ ∈ ◡{⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ⟨𝑤, 𝑧⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
9		opelopabsbALT 4347	. . 3 ⊢ (⟨𝑧, 𝑤⟩ ∈ {⟨𝑦, 𝑥⟩ ∣ 𝜑} ↔ [𝑤 / 𝑥][𝑧 / 𝑦]𝜑)
10	5, 8, 9	3bitr4i 212	. 2 ⊢ (⟨𝑧, 𝑤⟩ ∈ ◡{⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ⟨𝑧, 𝑤⟩ ∈ {⟨𝑦, 𝑥⟩ ∣ 𝜑})
11	1, 2, 10	eqrelriiv 4813	1 ⊢ ◡{⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑦, 𝑥⟩ ∣ 𝜑}

Syntax hints:   = wceq 1395  [wsb 1808   ∈ wcel 2200  ⟨cop 3669  {copab 4144  ^◡ccnv 4718

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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-br 4084  df-opab 4146  df-xp 4725  df-rel 4726  df-cnv 4727

This theorem is referenced by:  mptcnv  5131  cnvxp  5147  mptpreima  5222  f1ocnvd  6208  cnvoprab  6380  mapsncnv  6842  lgsquadlem3  15758