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

Theorem cnvsn 5779
 Description: Converse of a singleton of an ordered pair. (Contributed by NM, 11-May-1998.) (Revised by Mario Carneiro, 26-Apr-2015.) (Proof shortened by BJ, 12-Feb-2022.)
Hypotheses
Ref Expression
cnvsn.1 𝐴 ∈ V
cnvsn.2 𝐵 ∈ V
Assertion
Ref Expression
cnvsn {⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩}

Proof of Theorem cnvsn
StepHypRef Expression
1 cnvsn.1 . 2 𝐴 ∈ V
2 cnvsn.2 . 2 𝐵 ∈ V
3 cnvsng 5776 . 2 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩})
41, 2, 3mp2an 710 1 {⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩}
 Colors of variables: wff setvar class Syntax hints:   = wceq 1632   ∈ wcel 2140  Vcvv 3341  {csn 4322  ⟨cop 4328  ◡ccnv 5266 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1989  ax-6 2055  ax-7 2091  ax-9 2149  ax-10 2169  ax-11 2184  ax-12 2197  ax-13 2392  ax-ext 2741  ax-sep 4934  ax-nul 4942  ax-pr 5056 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2048  df-eu 2612  df-mo 2613  df-clab 2748  df-cleq 2754  df-clel 2757  df-nfc 2892  df-ral 3056  df-rex 3057  df-rab 3060  df-v 3343  df-dif 3719  df-un 3721  df-in 3723  df-ss 3730  df-nul 4060  df-if 4232  df-sn 4323  df-pr 4325  df-op 4329  df-br 4806  df-opab 4866  df-xp 5273  df-rel 5274  df-cnv 5275 This theorem is referenced by:  op2ndb  5781  cnvsngOLD  5783  f1osn  6339  1sdom  8331  ex-cnv  27627
 Copyright terms: Public domain W3C validator