Theorem relsn 5677

Description: A singleton is a relation iff it is an ordered pair. (Contributed by NM, 24-Sep-2013.)

Hypothesis

Ref	Expression
relsn.1	⊢ 𝐴 ∈ V

Assertion

Ref	Expression
relsn	⊢ (Rel {𝐴} ↔ 𝐴 ∈ (V × V))

Proof of Theorem relsn

Step	Hyp	Ref	Expression
1		relsn.1	. 2 ⊢ 𝐴 ∈ V
2		relsng 5674	. 2 ⊢ (𝐴 ∈ V → (Rel {𝐴} ↔ 𝐴 ∈ (V × V)))
3	1, 2	ax-mp 5	1 ⊢ (Rel {𝐴} ↔ 𝐴 ∈ (V × V))

Syntax hints:   ↔ wb 208   ∈ wcel 2114  Vcvv 3494  {csn 4567   × cxp 5553  Rel wrel 5560

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-v 3496  df-in 3943  df-ss 3952  df-sn 4568  df-rel 5562

This theorem is referenced by:  setscom  16527  setsid  16538