Theorem relrn0 5923

Description: A relation is empty iff its range is empty. (Contributed by NM, 15-Sep-2004.)

Assertion

Ref	Expression
relrn0	⊢ (Rel 𝐴 → (𝐴 = ∅ ↔ ran 𝐴 = ∅))

Proof of Theorem relrn0

Step	Hyp	Ref	Expression
1		reldm0 5878	. 2 ⊢ (Rel 𝐴 → (𝐴 = ∅ ↔ dom 𝐴 = ∅))
2		dm0rn0 5874	. 2 ⊢ (dom 𝐴 = ∅ ↔ ran 𝐴 = ∅)
3	1, 2	bitrdi 287	1 ⊢ (Rel 𝐴 → (𝐴 = ∅ ↔ ran 𝐴 = ∅))

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1542  ∅c0 4274  dom cdm 5625  ran crn 5626  Rel wrel 5630

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 5232  ax-pr 5371

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 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-br 5087  df-opab 5149  df-xp 5631  df-rel 5632  df-cnv 5633  df-dm 5635  df-rn 5636

This theorem is referenced by:  cnvsn0  6169  coeq0  6215  foconst  6762  fconst5  7155  cnvfi  9104  edg0iedg0  29141  edg0usgr  29339  usgr1v0edg  29343  tocyccntz  33223  1arithidom  33615  heicant  37993  tfsconcat00  43796