Theorem cnvsn 6190

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 6187	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ◡{⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩})
4	1, 2, 3	mp2an 693	1 ⊢ ◡{⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩}

Syntax hints:   = wceq 1542   ∈ wcel 2114  Vcvv 3429  {csn 4567  ⟨cop 4573  ^◡ccnv 5630

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2708  ax-sep 5231  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-br 5086  df-opab 5148  df-xp 5637  df-rel 5638  df-cnv 5639

This theorem is referenced by:  op2ndb  6191  f1osn  6821  cnvfi  9110  ex-cnv  30507