![]() |
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 5684 | . 2 ⊢ (Rel {𝐴} ↔ {𝐴} ⊆ (V × V)) | |
2 | snssg 4788 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ (V × V) ↔ {𝐴} ⊆ (V × V))) | |
3 | 1, 2 | bitr4id 290 | 1 ⊢ (𝐴 ∈ 𝑉 → (Rel {𝐴} ↔ 𝐴 ∈ (V × V))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∈ wcel 2107 Vcvv 3475 ⊆ wss 3949 {csn 4629 × cxp 5675 Rel wrel 5682 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-ext 2704 |
This theorem depends on definitions: df-bi 206 df-an 398 df-tru 1545 df-ex 1783 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-v 3477 df-in 3956 df-ss 3966 df-sn 4630 df-rel 5684 |
This theorem is referenced by: relsnb 5803 relsnopg 5804 relsn 5805 relsn2 6212 |
Copyright terms: Public domain | W3C validator |