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

Theorem cnvcnvsn 5178
Description: Double converse of a singleton of an ordered pair. (Unlike cnvsn 5184, 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 5079 . 2 Rel {⟨𝐴, 𝐵⟩}
2 relcnv 5079 . 2 Rel {⟨𝐵, 𝐴⟩}
3 vex 2779 . . . 4 𝑦 ∈ V
4 vex 2779 . . . 4 𝑥 ∈ V
53, 4opelcnv 4878 . . 3 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩})
6 ancom 266 . . . . . 6 ((𝑦 = 𝐴𝑥 = 𝐵) ↔ (𝑥 = 𝐵𝑦 = 𝐴))
73, 4opth 4299 . . . . . 6 (⟨𝑦, 𝑥⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝑦 = 𝐴𝑥 = 𝐵))
84, 3opth 4299 . . . . . 6 (⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐴⟩ ↔ (𝑥 = 𝐵𝑦 = 𝐴))
96, 7, 83bitr4i 212 . . . . 5 (⟨𝑦, 𝑥⟩ = ⟨𝐴, 𝐵⟩ ↔ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐴⟩)
103, 4opex 4291 . . . . . 6 𝑦, 𝑥⟩ ∈ V
1110elsn 3659 . . . . 5 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑦, 𝑥⟩ = ⟨𝐴, 𝐵⟩)
124, 3opex 4291 . . . . . 6 𝑥, 𝑦⟩ ∈ V
1312elsn 3659 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐵, 𝐴⟩} ↔ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐴⟩)
149, 11, 133bitr4i 212 . . . 4 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐵, 𝐴⟩})
154, 3opelcnv 4878 . . . 4 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩})
163, 4opelcnv 4878 . . . 4 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐵, 𝐴⟩} ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐵, 𝐴⟩})
1714, 15, 163bitr4i 212 . . 3 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐵, 𝐴⟩})
185, 17bitri 184 . 2 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐵, 𝐴⟩})
191, 2, 18eqrelriiv 4787 1 {⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩}
Colors of variables: wff set class
Syntax hints:  wa 104   = wceq 1373  wcel 2178  {csn 3643  cop 3646  ccnv 4692
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-v 2778  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-br 4060  df-opab 4122  df-xp 4699  df-rel 4700  df-cnv 4701
This theorem is referenced by:  rnsnopg  5180  cnvsn  5184
  Copyright terms: Public domain W3C validator