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

Theorem cnvcnvsn 6168
Description: Double converse of a singleton of an ordered pair. (Unlike cnvsn 6175, 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 6055 . 2 Rel {⟨𝐴, 𝐵⟩}
2 relcnv 6055 . 2 Rel {⟨𝐵, 𝐴⟩}
3 vex 3440 . . . 4 𝑥 ∈ V
4 vex 3440 . . . 4 𝑦 ∈ V
53, 4opelcnv 5824 . . 3 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩})
6 ancom 460 . . . . . 6 ((𝑥 = 𝐴𝑦 = 𝐵) ↔ (𝑦 = 𝐵𝑥 = 𝐴))
73, 4opth 5419 . . . . . 6 (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝑥 = 𝐴𝑦 = 𝐵))
84, 3opth 5419 . . . . . 6 (⟨𝑦, 𝑥⟩ = ⟨𝐵, 𝐴⟩ ↔ (𝑦 = 𝐵𝑥 = 𝐴))
96, 7, 83bitr4i 303 . . . . 5 (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ ↔ ⟨𝑦, 𝑥⟩ = ⟨𝐵, 𝐴⟩)
10 opex 5407 . . . . . 6 𝑥, 𝑦⟩ ∈ V
1110elsn 4592 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
12 opex 5407 . . . . . 6 𝑦, 𝑥⟩ ∈ V
1312elsn 4592 . . . . 5 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐵, 𝐴⟩} ↔ ⟨𝑦, 𝑥⟩ = ⟨𝐵, 𝐴⟩)
149, 11, 133bitr4i 303 . . . 4 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐵, 𝐴⟩})
154, 3opelcnv 5824 . . . 4 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩})
163, 4opelcnv 5824 . . . 4 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐵, 𝐴⟩} ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐵, 𝐴⟩})
1714, 15, 163bitr4i 303 . . 3 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐵, 𝐴⟩})
185, 17bitri 275 . 2 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐵, 𝐴⟩})
191, 2, 18eqrelriiv 5733 1 {⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩}
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1540  wcel 2109  {csn 4577  cop 4583  ccnv 5618
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701  ax-sep 5235  ax-nul 5245  ax-pr 5371
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-rab 3395  df-v 3438  df-dif 3906  df-un 3908  df-ss 3920  df-nul 4285  df-if 4477  df-sn 4578  df-pr 4580  df-op 4584  df-br 5093  df-opab 5155  df-xp 5625  df-rel 5626  df-cnv 5627
This theorem is referenced by:  rnsnopg  6170  cnvsng  6172
  Copyright terms: Public domain W3C validator