ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  relrn0 Unicode version

Theorem relrn0 4801
Description: A relation is empty iff its range is empty. (Contributed by NM, 15-Sep-2004.)
Assertion
Ref Expression
relrn0  |-  ( Rel 
A  ->  ( A  =  (/)  <->  ran  A  =  (/) ) )

Proof of Theorem relrn0
StepHypRef Expression
1 reldm0 4757 . 2  |-  ( Rel 
A  ->  ( A  =  (/)  <->  dom  A  =  (/) ) )
2 dm0rn0 4756 . 2  |-  ( dom 
A  =  (/)  <->  ran  A  =  (/) )
31, 2syl6bb 195 1  |-  ( Rel 
A  ->  ( A  =  (/)  <->  ran  A  =  (/) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104    = wceq 1331   (/)c0 3363   dom cdm 4539   ran crn 4540   Rel wrel 4544
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-v 2688  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-br 3930  df-opab 3990  df-xp 4545  df-rel 4546  df-cnv 4547  df-dm 4549  df-rn 4550
This theorem is referenced by:  cnvsn0  5007
  Copyright terms: Public domain W3C validator