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

Theorem cnvcnvsn 6171
Description: Double converse of a singleton of an ordered pair. (Unlike cnvsn 6178, 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 6057 . 2 Rel {⟨𝐴, 𝐵⟩}
2 relcnv 6057 . 2 Rel {⟨𝐵, 𝐴⟩}
3 vex 3441 . . . 4 𝑥 ∈ V
4 vex 3441 . . . 4 𝑦 ∈ V
53, 4opelcnv 5825 . . 3 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩})
6 ancom 460 . . . . . 6 ((𝑥 = 𝐴𝑦 = 𝐵) ↔ (𝑦 = 𝐵𝑥 = 𝐴))
73, 4opth 5419 . . . . . 6 (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝑥 = 𝐴𝑦 = 𝐵))
84, 3opth 5419 . . . . . 6 (⟨𝑦, 𝑥⟩ = ⟨𝐵, 𝐴⟩ ↔ (𝑦 = 𝐵𝑥 = 𝐴))
96, 7, 83bitr4i 303 . . . . 5 (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ ↔ ⟨𝑦, 𝑥⟩ = ⟨𝐵, 𝐴⟩)
10 opex 5407 . . . . . 6 𝑥, 𝑦⟩ ∈ V
1110elsn 4590 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
12 opex 5407 . . . . . 6 𝑦, 𝑥⟩ ∈ V
1312elsn 4590 . . . . 5 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐵, 𝐴⟩} ↔ ⟨𝑦, 𝑥⟩ = ⟨𝐵, 𝐴⟩)
149, 11, 133bitr4i 303 . . . 4 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐵, 𝐴⟩})
154, 3opelcnv 5825 . . . 4 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩})
163, 4opelcnv 5825 . . . 4 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐵, 𝐴⟩} ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐵, 𝐴⟩})
1714, 15, 163bitr4i 303 . . 3 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐵, 𝐴⟩})
185, 17bitri 275 . 2 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐵, 𝐴⟩})
191, 2, 18eqrelriiv 5734 1 {⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩}
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1541  wcel 2113  {csn 4575  cop 4581  ccnv 5618
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2705  ax-sep 5236  ax-nul 5246  ax-pr 5372
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2712  df-cleq 2725  df-clel 2808  df-rab 3397  df-v 3439  df-dif 3901  df-un 3903  df-ss 3915  df-nul 4283  df-if 4475  df-sn 4576  df-pr 4578  df-op 4582  df-br 5094  df-opab 5156  df-xp 5625  df-rel 5626  df-cnv 5627
This theorem is referenced by:  rnsnopg  6173  cnvsng  6175
  Copyright terms: Public domain W3C validator