Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > relrn0 | GIF version |
Description: A relation is empty iff its range is empty. (Contributed by NM, 15-Sep-2004.) |
Ref | Expression |
---|---|
relrn0 | ⊢ (Rel 𝐴 → (𝐴 = ∅ ↔ ran 𝐴 = ∅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | reldm0 4822 | . 2 ⊢ (Rel 𝐴 → (𝐴 = ∅ ↔ dom 𝐴 = ∅)) | |
2 | dm0rn0 4821 | . 2 ⊢ (dom 𝐴 = ∅ ↔ ran 𝐴 = ∅) | |
3 | 1, 2 | bitrdi 195 | 1 ⊢ (Rel 𝐴 → (𝐴 = ∅ ↔ ran 𝐴 = ∅)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 104 = wceq 1343 ∅c0 3409 dom cdm 4604 ran crn 4605 Rel wrel 4609 |
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 604 ax-in2 605 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-v 2728 df-dif 3118 df-un 3120 df-in 3122 df-ss 3129 df-nul 3410 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-br 3983 df-opab 4044 df-xp 4610 df-rel 4611 df-cnv 4612 df-dm 4614 df-rn 4615 |
This theorem is referenced by: cnvsn0 5072 |
Copyright terms: Public domain | W3C validator |