Theorem relrn0 5959

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 5914	. 2 ⊢ (Rel 𝐴 → (𝐴 = ∅ ↔ dom 𝐴 = ∅))
2		dm0rn0 5910	. 2 ⊢ (dom 𝐴 = ∅ ↔ ran 𝐴 = ∅)
3	1, 2	bitrdi 290	1 ⊢ (Rel 𝐴 → (𝐴 = ∅ ↔ ran 𝐴 = ∅))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569  ∅c0 4280  dom cdm 5654  ran crn 5655  Rel wrel 5659

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735  ax-sep 5251  ax-pr 5394

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-br 5106  df-opab 5170  df-xp 5660  df-rel 5661  df-cnv 5662  df-dm 5664  df-rn 5665

This theorem is used by:  cnvsn0  6217  coeq0  6263  foconst  6819  fconst5  7219  cnvfi  9202  edg0iedg0  29645  edg0usgr  29846  usgr1v0edg  29850  tocyccntz  33758  1arithidom  34122  heicant  38713  tfsconcat00  44489