Theorem relsng 5767

Description: A singleton is a relation iff it is a singleton on an ordered pair. (Contributed by NM, 24-Sep-2013.) (Revised by BJ, 12-Feb-2022.)

Assertion

Ref	Expression
relsng	⊢ (𝐴 ∈ 𝑉 → (Rel {𝐴} ↔ 𝐴 ∈ (V × V)))

Proof of Theorem relsng

Step	Hyp	Ref	Expression
1		df-rel 5647	. 2 ⊢ (Rel {𝐴} ↔ {𝐴} ⊆ (V × V))
2		snssg 4736	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ (V × V) ↔ {𝐴} ⊆ (V × V)))
3	1, 2	bitr4id 292	1 ⊢ (𝐴 ∈ 𝑉 → (Rel {𝐴} ↔ 𝐴 ∈ (V × V)))

Syntax hints:   → wi 4   ↔ wb 208   ∈ wcel 2136  Vcvv 3448   ⊆ wss 3899  {csn 4576   × cxp 5638  Rel wrel 5645

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1809  ax-4 1823  ax-5 1924  ax-6 1981  ax-7 2022  ax-8 2138  ax-9 2146  ax-ext 2728

This theorem depends on definitions:  df-bi 209  df-an 399  df-tru 1557  df-ex 1794  df-sb 2085  df-clab 2735  df-cleq 2748  df-clel 2831  df-v 3450  df-ss 3916  df-sn 4577  df-rel 5647

This theorem is referenced by:  relsnb  5768  relsnopg  5769  relsn  5770  relsn2  6188