| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > relsn2 | Structured version Visualization version GIF version | ||
| Description: A singleton is a relation iff it has a nonempty domain. (Contributed by NM, 25-Sep-2013.) Make hypothesis an antecedent. (Revised by BJ, 12-Feb-2022.) |
| Ref | Expression |
|---|---|
| relsn2 | ⊢ (𝐴 ∈ 𝑉 → (Rel {𝐴} ↔ dom {𝐴} ≠ ∅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relsng 5779 | . 2 ⊢ (𝐴 ∈ 𝑉 → (Rel {𝐴} ↔ 𝐴 ∈ (V × V))) | |
| 2 | dmsnn0 6198 | . 2 ⊢ (𝐴 ∈ (V × V) ↔ dom {𝐴} ≠ ∅) | |
| 3 | 1, 2 | bitrdi 290 | 1 ⊢ (𝐴 ∈ 𝑉 → (Rel {𝐴} ↔ dom {𝐴} ≠ ∅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∈ wcel 2145 ≠ wne 2960 Vcvv 3457 ∅c0 4288 {csn 4585 × cxp 5650 dom cdm 5652 Rel wrel 5657 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 ax-sep 5251 ax-pr 5395 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-rab 3418 df-v 3459 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-sn 4586 df-pr 4588 df-op 4592 df-br 5106 df-opab 5168 df-xp 5658 df-rel 5659 df-dm 5662 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |