Theorem relrn0 4888

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 4844	. 2 |- ( Rel A -> ( A = (/) <-> dom A = (/) ) )
2		dm0rn0 4843	. 2 |- ( dom A = (/) <-> ran A = (/) )
3	1, 2	bitrdi 196	1 |- ( Rel A -> ( A = (/) <-> ran A = (/) ) )

Syntax hints:   -> wi 4   <-> wb 105   = wceq 1353   (/)c0 3422   dom cdm 4625   ran crn 4626   Rel wrel 4630

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4120  ax-pow 4173  ax-pr 4208

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-v 2739  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-br 4003  df-opab 4064  df-xp 4631  df-rel 4632  df-cnv 4633  df-dm 4635  df-rn 4636

This theorem is referenced by:  cnvsn0  5096