Theorem relrn0 5044

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

This proof depends on syntax axioms:   → wi 4   ↔ wb 105   = wceq 1402  ∅c0 3520  dom cdm 4774  ran crn 4775  Rel wrel 4779

This proof depends on 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 4249  ax-pow 4311  ax-pr 4346

This proof 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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-xp 4780  df-rel 4781  df-cnv 4782  df-dm 4784  df-rn 4785

This theorem is used by:  cnvsn0  5256  edg0iedg0g  16307  edg0usgr  16488