| 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 5757 | . 2 ⊢ (𝐴 ∈ V → (Rel {𝐴} ↔ 𝐴 ∈ (V × V))) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (Rel {𝐴} ↔ 𝐴 ∈ (V × V)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∈ wcel 2114 Vcvv 3429 {csn 4567 × cxp 5629 Rel wrel 5636 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2715 df-cleq 2728 df-clel 2811 df-v 3431 df-ss 3906 df-sn 4568 df-rel 5638 |
| This theorem is referenced by: setscom 17150 setsid 17177 |
| Copyright terms: Public domain | W3C validator |