ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cnvcnvsn GIF version

Theorem cnvcnvsn 5211
Description: Double converse of a singleton of an ordered pair. (Unlike cnvsn 5217, 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 5112 . 2 Rel {⟨𝐴, 𝐵⟩}
2 relcnv 5112 . 2 Rel {⟨𝐵, 𝐴⟩}
3 vex 2803 . . . 4 𝑦 ∈ V
4 vex 2803 . . . 4 𝑥 ∈ V
53, 4opelcnv 4910 . . 3 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩})
6 ancom 266 . . . . . 6 ((𝑦 = 𝐴𝑥 = 𝐵) ↔ (𝑥 = 𝐵𝑦 = 𝐴))
73, 4opth 4327 . . . . . 6 (⟨𝑦, 𝑥⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝑦 = 𝐴𝑥 = 𝐵))
84, 3opth 4327 . . . . . 6 (⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐴⟩ ↔ (𝑥 = 𝐵𝑦 = 𝐴))
96, 7, 83bitr4i 212 . . . . 5 (⟨𝑦, 𝑥⟩ = ⟨𝐴, 𝐵⟩ ↔ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐴⟩)
103, 4opex 4319 . . . . . 6 𝑦, 𝑥⟩ ∈ V
1110elsn 3683 . . . . 5 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑦, 𝑥⟩ = ⟨𝐴, 𝐵⟩)
124, 3opex 4319 . . . . . 6 𝑥, 𝑦⟩ ∈ V
1312elsn 3683 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐵, 𝐴⟩} ↔ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐴⟩)
149, 11, 133bitr4i 212 . . . 4 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐵, 𝐴⟩})
154, 3opelcnv 4910 . . . 4 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩})
163, 4opelcnv 4910 . . . 4 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐵, 𝐴⟩} ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐵, 𝐴⟩})
1714, 15, 163bitr4i 212 . . 3 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐵, 𝐴⟩})
185, 17bitri 184 . 2 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐵, 𝐴⟩})
191, 2, 18eqrelriiv 4818 1 {⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩}
Colors of variables: wff set class
Syntax hints:  wa 104   = wceq 1395  wcel 2200  {csn 3667  cop 3670  ccnv 4722
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 4205  ax-pow 4262  ax-pr 4297
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 2802  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-br 4087  df-opab 4149  df-xp 4729  df-rel 4730  df-cnv 4731
This theorem is referenced by:  rnsnopg  5213  cnvsn  5217
  Copyright terms: Public domain W3C validator