Theorem relsn 4531

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

Hypothesis

Ref	Expression
relsn.1	|- A e. _V

Assertion

Ref	Expression
relsn	|- ( Rel { A } <-> A e. ( _V X. _V ) )

Proof of Theorem relsn

Step	Hyp	Ref	Expression
1		df-rel 4435	. 2 |- ( Rel { A } <-> { A } C_ ( _V X. _V ) )
2		relsn.1	. . 3 |- A e. _V
3	2	snss 3561	. 2 |- ( A e. ( _V X. _V ) <-> { A } C_ ( _V X. _V ) )
4	1, 3	bitr4i 185	1 |- ( Rel { A } <-> A e. ( _V X. _V ) )

Syntax hints:   <-> wb 103   e. wcel 1438   _Vcvv 2619   C_ wss 2997   {csn 3441   X. cxp 4426   Rel wrel 4433

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070

This theorem depends on definitions:  df-bi 115  df-tru 1292  df-nf 1395  df-sb 1693  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-v 2621  df-in 3003  df-ss 3010  df-sn 3447  df-rel 4435

This theorem is referenced by:  relsnop  4532  relsn2m  4888