| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > relrn0 | Structured version Visualization version GIF version | ||
| Description: A relation is empty iff its range is empty. (Contributed by NM, 15-Sep-2004.) |
| Ref | Expression |
|---|---|
| relrn0 | ⊢ (Rel 𝐴 → (𝐴 = ∅ ↔ ran 𝐴 = ∅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | reldm0 5922 | . 2 ⊢ (Rel 𝐴 → (𝐴 = ∅ ↔ dom 𝐴 = ∅)) | |
| 2 | dm0rn0 5918 | . 2 ⊢ (dom 𝐴 = ∅ ↔ ran 𝐴 = ∅) | |
| 3 | 1, 2 | bitrdi 290 | 1 ⊢ (Rel 𝐴 → (𝐴 = ∅ ↔ ran 𝐴 = ∅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∅c0 4281 dom cdm 5658 ran crn 5659 Rel wrel 5663 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5255 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-br 5109 df-opab 5174 df-xp 5664 df-rel 5665 df-cnv 5666 df-dm 5668 df-rn 5669 |
| This theorem is used by: cnvsn0 6230 coeq0 6276 foconst 6841 fconst5 7243 cnvfi 9229 edg0iedg0 29690 edg0usgr 29891 usgr1v0edg 29895 tocyccntz 33804 1arithidom 34173 heicant 38841 tfsconcat00 44671 |
| Copyright terms: Public domain | W3C validator |