| 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 5671 | . 2 ⊢ (Rel {𝐴} ↔ {𝐴} ⊆ (V × V)) | |
| 2 | snssg 4752 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ (V × V) ↔ {𝐴} ⊆ (V × V))) | |
| 3 | 1, 2 | bitr4id 293 | 1 ⊢ (𝐴 ∈ 𝑉 → (Rel {𝐴} ↔ 𝐴 ∈ (V × V))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∈ wcel 2146 Vcvv 3458 ⊆ wss 3908 {csn 4592 × cxp 5662 Rel wrel 5669 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2745 df-cleq 2758 df-clel 2841 df-v 3460 df-ss 3925 df-sn 4593 df-rel 5671 |
| This theorem is used by: relsnb 5792 relsnopg 5793 relsn 5794 relsn2 6216 |
| Copyright terms: Public domain | W3C validator |