Theorem relsn 5787

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 5784	. 2 ⊢ (𝐴 ∈ V → (Rel {𝐴} ↔ 𝐴 ∈ (V × V)))
3	1, 2	ax-mp 5	1 ⊢ (Rel {𝐴} ↔ 𝐴 ∈ (V × V))

This proof depends on syntax axioms:   ↔ wb 209   ∈ wcel 2147  Vcvv 3454  {csn 4588   × cxp 5653  Rel wrel 5660

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-ss 3901  df-sn 4589  df-rel 5662

This theorem is used by:  setscom  17384  setsid  17411