| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0nelrel | Structured version Visualization version GIF version | ||
| Description: A binary relation does not contain the empty set. (Contributed by AV, 15-Nov-2021.) |
| Ref | Expression |
|---|---|
| 0nelrel | ⊢ (Rel 𝑅 → ∅ ∉ 𝑅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0nelrel0 5691 | . 2 ⊢ (Rel 𝑅 → ¬ ∅ ∈ 𝑅) | |
| 2 | df-nel 3037 | . 2 ⊢ (∅ ∉ 𝑅 ↔ ¬ ∅ ∈ 𝑅) | |
| 3 | 1, 2 | sylibr 234 | 1 ⊢ (Rel 𝑅 → ∅ ∉ 𝑅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∈ wcel 2114 ∉ wnel 3036 ∅c0 4273 Rel wrel 5636 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2708 ax-sep 5231 ax-pr 5375 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2715 df-cleq 2728 df-clel 2811 df-ne 2933 df-nel 3037 df-rab 3390 df-v 3431 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-sn 4568 df-pr 4570 df-op 4574 df-opab 5148 df-xp 5637 df-rel 5638 |
| This theorem is referenced by: 0nelfun 6516 |
| Copyright terms: Public domain | W3C validator |