Theorem relrn0 5963

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

Syntax hints:   → wi 4   ↔ wb 209   = wceq 1570  ∅c0 4286  dom cdm 5661  ran crn 5662  Rel wrel 5666

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257  ax-pr 5404

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-br 5110  df-opab 5174  df-xp 5667  df-rel 5668  df-cnv 5669  df-dm 5671  df-rn 5672

This theorem is referenced by:  cnvsn0  6211  coeq0  6257  foconst  6807  fconst5  7204  cnvfi  9156  edg0iedg0  29405  edg0usgr  29603  usgr1v0edg  29607  tocyccntz  33464  1arithidom  33827  heicant  38326  tfsconcat00  44094