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 5595 | . 2 ⊢ (Rel {𝐴} ↔ {𝐴} ⊆ (V × V)) | |
2 | snssg 4723 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ (V × V) ↔ {𝐴} ⊆ (V × V))) | |
3 | 1, 2 | bitr4id 289 | 1 ⊢ (𝐴 ∈ 𝑉 → (Rel {𝐴} ↔ 𝐴 ∈ (V × V))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∈ wcel 2109 Vcvv 3430 ⊆ wss 3891 {csn 4566 × cxp 5586 Rel wrel 5593 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1801 ax-4 1815 ax-5 1916 ax-6 1974 ax-7 2014 ax-8 2111 ax-9 2119 ax-ext 2710 |
This theorem depends on definitions: df-bi 206 df-an 396 df-tru 1544 df-ex 1786 df-sb 2071 df-clab 2717 df-cleq 2731 df-clel 2817 df-v 3432 df-in 3898 df-ss 3908 df-sn 4567 df-rel 5595 |
This theorem is referenced by: relsnb 5709 relsnopg 5710 relsn 5711 relsn2 6112 |
Copyright terms: Public domain | W3C validator |