Theorem relrn0 5039

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

Step	Hyp	Ref	Expression
1		reldm0 4994	. 2 |- ( Rel A -> ( A = (/) <-> dom A = (/) ) )
2		dm0rn0 4993	. 2 |- ( dom A = (/) <-> ran A = (/) )
3	1, 2	bitrdi 196	1 |- ( Rel A -> ( A = (/) <-> ran A = (/) ) )

Syntax hints:   -> wi 4   <-> wb 105   = wceq 1402   (/)c0 3520   dom cdm 4769   ran crn 4770   Rel wrel 4774

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-br 4126  df-opab 4188  df-xp 4775  df-rel 4776  df-cnv 4777  df-dm 4779  df-rn 4780

This theorem is referenced by:  cnvsn0  5251  edg0iedg0g  16221  edg0usgr  16402