MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  relsng Structured version   Visualization version   GIF version

Theorem relsng 5775
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
StepHypRef Expression
1 df-rel 5654 . 2 (Rel {𝐴} ↔ {𝐴} ⊆ (V × V))
2 snssg 4743 . 2 (𝐴 ∈ 𝑉 → (𝐴 ∈ (V × V) ↔ {𝐴} ⊆ (V × V)))
31, 2bitr4id 293 1 (𝐴 ∈ 𝑉 → (Rel {𝐴} ↔ 𝐴 ∈ (V × V)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∈ wcel 2145  Vcvv 3450   ⊆ wss 3898  {csn 4583   × cxp 5645  Rel wrel 5652
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-ss 3915  df-sn 4584  df-rel 5654
This theorem is used by:  relsnb  5776  relsnopg  5777  relsn  5778  relsn2  6202
  Copyright terms: Public domain W3C validator