| 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 5747 | . 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 2121 Vcvv 3433 {csn 4558 × cxp 5619 Rel wrel 5626 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-ext 2713 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-tru 1551 df-ex 1788 df-sb 2075 df-clab 2720 df-cleq 2733 df-clel 2816 df-v 3435 df-ss 3902 df-sn 4559 df-rel 5628 |
| This theorem is referenced by: setscom 17145 setsid 17172 |
| Copyright terms: Public domain | W3C validator |