| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > relsn | Structured version Visualization version GIF version | ||
| Description: A singleton is a relation iff it is an ordered pair. (Contributed by NM, 24-Sep-2013.) |
| Ref | Expression |
|---|---|
| relsn.1 | ⊢ 𝐴 ∈ V |
| Ref | Expression |
|---|---|
| relsn | ⊢ (Rel {𝐴} ↔ 𝐴 ∈ (V × V)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relsn.1 | . 2 ⊢ 𝐴 ∈ V | |
| 2 | relsng 5776 | . 2 ⊢ (𝐴 ∈ V → (Rel {𝐴} ↔ 𝐴 ∈ (V × V))) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (Rel {𝐴} ↔ 𝐴 ∈ (V × V)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 ∈ wcel 2144 Vcvv 3456 {csn 4584 × cxp 5647 Rel wrel 5654 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-ext 2736 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1565 df-ex 1802 df-sb 2093 df-clab 2743 df-cleq 2756 df-clel 2839 df-v 3458 df-ss 3923 df-sn 4585 df-rel 5656 |
| This theorem is referenced by: setscom 17218 setsid 17245 |
| Copyright terms: Public domain | W3C validator |