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

Theorem cnvcnvsn 5612
Description: Double converse of a singleton of an ordered pair. (Unlike cnvsn 5618, this does not need any sethood assumptions on 𝐴 and 𝐵.) (Contributed by Mario Carneiro, 26-Apr-2015.)
Assertion
Ref Expression
cnvcnvsn {⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩}

Proof of Theorem cnvcnvsn
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relcnv 5503 . 2 Rel {⟨𝐴, 𝐵⟩}
2 relcnv 5503 . 2 Rel {⟨𝐵, 𝐴⟩}
3 vex 3203 . . . 4 𝑥 ∈ V
4 vex 3203 . . . 4 𝑦 ∈ V
53, 4opelcnv 5304 . . 3 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩})
6 ancom 466 . . . . . 6 ((𝑥 = 𝐴𝑦 = 𝐵) ↔ (𝑦 = 𝐵𝑥 = 𝐴))
73, 4opth 4945 . . . . . 6 (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝑥 = 𝐴𝑦 = 𝐵))
84, 3opth 4945 . . . . . 6 (⟨𝑦, 𝑥⟩ = ⟨𝐵, 𝐴⟩ ↔ (𝑦 = 𝐵𝑥 = 𝐴))
96, 7, 83bitr4i 292 . . . . 5 (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ ↔ ⟨𝑦, 𝑥⟩ = ⟨𝐵, 𝐴⟩)
10 opex 4932 . . . . . 6 𝑥, 𝑦⟩ ∈ V
1110elsn 4192 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
12 opex 4932 . . . . . 6 𝑦, 𝑥⟩ ∈ V
1312elsn 4192 . . . . 5 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐵, 𝐴⟩} ↔ ⟨𝑦, 𝑥⟩ = ⟨𝐵, 𝐴⟩)
149, 11, 133bitr4i 292 . . . 4 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐵, 𝐴⟩})
154, 3opelcnv 5304 . . . 4 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩})
163, 4opelcnv 5304 . . . 4 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐵, 𝐴⟩} ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐵, 𝐴⟩})
1714, 15, 163bitr4i 292 . . 3 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐵, 𝐴⟩})
185, 17bitri 264 . 2 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐵, 𝐴⟩})
191, 2, 18eqrelriiv 5214 1 {⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩}
Colors of variables: wff setvar class
Syntax hints:  wa 384   = wceq 1483  wcel 1990  {csn 4177  cop 4183  ccnv 5113
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-xp 5120  df-rel 5121  df-cnv 5122
This theorem is referenced by:  rnsnopg  5614  cnvsn  5618  strlemor1OLD  15969
  Copyright terms: Public domain W3C validator