Theorem relsng 4796

Description: A singleton is a relation iff it is 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 4700	. 2 ⊢ (Rel {𝐴} ↔ {𝐴} ⊆ (V × V))
2		snssg 3778	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ (V × V) ↔ {𝐴} ⊆ (V × V)))
3	1, 2	bitr4id 199	1 ⊢ (𝐴 ∈ 𝑉 → (Rel {𝐴} ↔ 𝐴 ∈ (V × V)))

Syntax hints:   → wi 4   ↔ wb 105   ∈ wcel 2178  Vcvv 2776   ⊆ wss 3174  {csn 3643   × cxp 4691  Rel wrel 4698

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189

This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-v 2778  df-in 3180  df-ss 3187  df-sn 3649  df-rel 4700

This theorem is referenced by:  relsnopg  4797  setscom  12987  setsslid  12998