MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  relrn0 Structured version   Visualization version   GIF version

Theorem relrn0 5983
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
StepHypRef Expression
1 reldm0 5938 . 2 (Rel 𝐴 → (𝐴 = ∅ ↔ dom 𝐴 = ∅))
2 dm0rn0 5935 . 2 (dom 𝐴 = ∅ ↔ ran 𝐴 = ∅)
31, 2bitrdi 287 1 (Rel 𝐴 → (𝐴 = ∅ ↔ ran 𝐴 = ∅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1540  c0 4333  dom cdm 5685  ran crn 5686  Rel wrel 5690
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-ss 3968  df-nul 4334  df-if 4526  df-sn 4627  df-pr 4629  df-op 4633  df-br 5144  df-opab 5206  df-xp 5691  df-rel 5692  df-cnv 5693  df-dm 5695  df-rn 5696
This theorem is referenced by:  cnvsn0  6230  coeq0  6275  foconst  6835  fconst5  7226  cnvfi  9216  edg0iedg0  29072  edg0usgr  29270  usgr1v0edg  29274  tocyccntz  33164  1arithidom  33565  heicant  37662  tfsconcat00  43360
  Copyright terms: Public domain W3C validator