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 5606 | . 2 ⊢ (Rel 𝑅 → ¬ ∅ ∈ 𝑅) | |
2 | df-nel 3124 | . 2 ⊢ (∅ ∉ 𝑅 ↔ ¬ ∅ ∈ 𝑅) | |
3 | 1, 2 | sylibr 236 | 1 ⊢ (Rel 𝑅 → ∅ ∉ 𝑅) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∈ wcel 2110 ∉ wnel 3123 ∅c0 4290 Rel wrel 5554 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pr 5321 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-v 3496 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-sn 4561 df-pr 4563 df-op 4567 df-opab 5121 df-xp 5555 df-rel 5556 |
This theorem is referenced by: 0nelfun 6367 |
Copyright terms: Public domain | W3C validator |