| 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 5877 | . 2 ⊢ (Rel 𝐴 → (𝐴 = ∅ ↔ dom 𝐴 = ∅)) | |
| 2 | dm0rn0 5873 | . 2 ⊢ (dom 𝐴 = ∅ ↔ ran 𝐴 = ∅) | |
| 3 | 1, 2 | bitrdi 287 | 1 ⊢ (Rel 𝐴 → (𝐴 = ∅ ↔ ran 𝐴 = ∅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1541 ∅c0 4285 dom cdm 5624 ran crn 5625 Rel wrel 5629 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-br 5099 df-opab 5161 df-xp 5630 df-rel 5631 df-cnv 5632 df-dm 5634 df-rn 5635 |
| This theorem is referenced by: cnvsn0 6168 coeq0 6214 foconst 6761 fconst5 7152 cnvfi 9102 edg0iedg0 29130 edg0usgr 29328 usgr1v0edg 29332 tocyccntz 33228 1arithidom 33620 heicant 37858 tfsconcat00 43610 |
| Copyright terms: Public domain | W3C validator |