Theorem cnvsn 6225

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

Step	Hyp	Ref	Expression
1		cnvsn.1	. 2 ⊢ 𝐴 ∈ V
2		cnvsn.2	. 2 ⊢ 𝐵 ∈ V
3		cnvsng 6222	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ◡{⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩})
4	1, 2, 3	mp2an 690	1 ⊢ ◡{⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩}

Syntax hints:   = wceq 1541   ∈ wcel 2106  Vcvv 3474  {csn 4628  ⟨cop 4634  ^◡ccnv 5675

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-br 5149  df-opab 5211  df-xp 5682  df-rel 5683  df-cnv 5684

This theorem is referenced by:  op2ndb  6226  f1osn  6873  cnvfi  9179  1sdomOLD  9248  ex-cnv  29687