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

Theorem cnvcnvsn 6232
Description: Double converse of a singleton of an ordered pair. (Unlike cnvsn 6239, 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 6111 . 2 Rel ◡◡{⟨𝐴, 𝐵⟩}
2 relcnv 6111 . 2 Rel ◡{⟨𝐵, 𝐴⟩}
3 vex 3458 . . . 4 𝑥 ∈ V
4 vex 3458 . . . 4 𝑦 ∈ V
53, 4opelcnv 5865 . . 3 (⟨𝑥, 𝑦⟩ ∈ ◡◡{⟨𝐴, 𝐵⟩} ↔ ⟨𝑦, 𝑥⟩ ∈ ◡{⟨𝐴, 𝐵⟩})
6 ancom 466 . . . . . 6 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝑦 = 𝐵 ∧ 𝑥 = 𝐴))
73, 4opth 5449 . . . . . 6 (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵))
84, 3opth 5449 . . . . . 6 (⟨𝑦, 𝑥⟩ = ⟨𝐵, 𝐴⟩ ↔ (𝑦 = 𝐵 ∧ 𝑥 = 𝐴))
96, 7, 83bitr4i 306 . . . . 5 (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ ↔ ⟨𝑦, 𝑥⟩ = ⟨𝐵, 𝐴⟩)
10 opex 5436 . . . . . 6 ⟨𝑥, 𝑦⟩ ∈ V
1110elsn 4599 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
12 opex 5436 . . . . . 6 ⟨𝑦, 𝑥⟩ ∈ V
1312elsn 4599 . . . . 5 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐵, 𝐴⟩} ↔ ⟨𝑦, 𝑥⟩ = ⟨𝐵, 𝐴⟩)
149, 11, 133bitr4i 306 . . . 4 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐵, 𝐴⟩})
154, 3opelcnv 5865 . . . 4 (⟨𝑦, 𝑥⟩ ∈ ◡{⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩})
163, 4opelcnv 5865 . . . 4 (⟨𝑥, 𝑦⟩ ∈ ◡{⟨𝐵, 𝐴⟩} ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐵, 𝐴⟩})
1714, 15, 163bitr4i 306 . . 3 (⟨𝑦, 𝑥⟩ ∈ ◡{⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ ∈ ◡{⟨𝐵, 𝐴⟩})
185, 17bitri 278 . 2 (⟨𝑥, 𝑦⟩ ∈ ◡◡{⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ ∈ ◡{⟨𝐵, 𝐴⟩})
191, 2, 18eqrelriiv 5771 1 ◡◡{⟨𝐴, 𝐵⟩} = ◡{⟨𝐵, 𝐴⟩}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {csn 4588  ⟨cop 4838  ◡ccnv 5654
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5171  df-xp 5661  df-rel 5662  df-cnv 5663
This theorem is used by:  rnsnopg  6234  cnvsng  6236
  Copyright terms: Public domain W3C validator