| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > relsng | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| relsng | ⊢ (𝐴 ∈ 𝑉 → (Rel {𝐴} ↔ 𝐴 ∈ (V × V))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-rel 5632 | . 2 ⊢ (Rel {𝐴} ↔ {𝐴} ⊆ (V × V)) | |
| 2 | snssg 4722 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ (V × V) ↔ {𝐴} ⊆ (V × V))) | |
| 3 | 1, 2 | bitr4id 291 | 1 ⊢ (𝐴 ∈ 𝑉 → (Rel {𝐴} ↔ 𝐴 ∈ (V × V))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∈ wcel 2119 Vcvv 3432 ⊆ wss 3890 {csn 4562 × cxp 5623 Rel wrel 5630 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2712 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-tru 1550 df-ex 1787 df-sb 2074 df-clab 2719 df-cleq 2732 df-clel 2815 df-v 3434 df-ss 3907 df-sn 4563 df-rel 5632 |
| This theorem is referenced by: relsnb 5752 relsnopg 5753 relsn 5754 relsn2 6170 |
| Copyright terms: Public domain | W3C validator |