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 5648	. 2 ⊢ (Rel {𝐴} ↔ {𝐴} ⊆ (V × V))
2		snssg 4750	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ (V × V) ↔ {𝐴} ⊆ (V × V)))
3	1, 2	bitr4id 290	1 ⊢ (𝐴 ∈ 𝑉 → (Rel {𝐴} ↔ 𝐴 ∈ (V × V)))

Syntax hints:   → wi 4   ↔ wb 206   ∈ wcel 2109  Vcvv 3450   ⊆ wss 3917  {csn 4592   × cxp 5639  Rel wrel 5646

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2702

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1543  df-ex 1780  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-v 3452  df-ss 3934  df-sn 4593  df-rel 5648

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