| 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 5885 | . 2 ⊢ (Rel 𝐴 → (𝐴 = ∅ ↔ dom 𝐴 = ∅)) | |
| 2 | dm0rn0 5881 | . 2 ⊢ (dom 𝐴 = ∅ ↔ ran 𝐴 = ∅) | |
| 3 | 1, 2 | bitrdi 287 | 1 ⊢ (Rel 𝐴 → (𝐴 = ∅ ↔ ran 𝐴 = ∅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1542 ∅c0 4287 dom cdm 5632 ran crn 5633 Rel wrel 5637 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5243 ax-pr 5379 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-xp 5638 df-rel 5639 df-cnv 5640 df-dm 5642 df-rn 5643 |
| This theorem is referenced by: cnvsn0 6176 coeq0 6222 foconst 6769 fconst5 7162 cnvfi 9112 edg0iedg0 29144 edg0usgr 29342 usgr1v0edg 29346 tocyccntz 33242 1arithidom 33634 heicant 37910 tfsconcat00 43708 |
| Copyright terms: Public domain | W3C validator |