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

Theorem cnvsn 5838
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 5835 . 2 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩})
41, 2, 3mp2an 675 1 {⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩}
Colors of variables: wff setvar class
Syntax hints:   = wceq 1637  wcel 2157  Vcvv 3398  {csn 4377  cop 4383  ccnv 5317
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1877  ax-4 1894  ax-5 2001  ax-6 2069  ax-7 2105  ax-9 2166  ax-10 2186  ax-11 2202  ax-12 2215  ax-13 2422  ax-ext 2791  ax-sep 4982  ax-nul 4990  ax-pr 5103
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-3an 1102  df-tru 1641  df-ex 1860  df-nf 1864  df-sb 2062  df-mo 2635  df-eu 2638  df-clab 2800  df-cleq 2806  df-clel 2809  df-nfc 2944  df-ral 3108  df-rex 3109  df-rab 3112  df-v 3400  df-dif 3779  df-un 3781  df-in 3783  df-ss 3790  df-nul 4124  df-if 4287  df-sn 4378  df-pr 4380  df-op 4384  df-br 4852  df-opab 4914  df-xp 5324  df-rel 5325  df-cnv 5326
This theorem is referenced by:  op2ndb  5840  cnvsngOLD  5842  f1osn  6395  1sdom  8405  ex-cnv  27631
  Copyright terms: Public domain W3C validator