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 5700 | . 2 ⊢ (𝐴 ∈ V → (Rel {𝐴} ↔ 𝐴 ∈ (V × V))) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ (Rel {𝐴} ↔ 𝐴 ∈ (V × V)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∈ wcel 2108 Vcvv 3422 {csn 4558 × cxp 5578 Rel wrel 5585 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 396 df-tru 1542 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-v 3424 df-in 3890 df-ss 3900 df-sn 4559 df-rel 5587 |
This theorem is referenced by: setscom 16809 setsid 16837 |
Copyright terms: Public domain | W3C validator |