| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0nelrel0 | Structured version Visualization version GIF version | ||
| Description: A binary relation does not contain the empty set. (Contributed by AV, 15-Nov-2021.) (Revised by BJ, 14-Jul-2023.) |
| Ref | Expression |
|---|---|
| 0nelrel0 | ⊢ (Rel 𝑅 → ¬ ∅ ∈ 𝑅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-rel 5632 | . . 3 ⊢ (Rel 𝑅 ↔ 𝑅 ⊆ (V × V)) | |
| 2 | 1 | biimpi 216 | . 2 ⊢ (Rel 𝑅 → 𝑅 ⊆ (V × V)) |
| 3 | 0nelxp 5659 | . . 3 ⊢ ¬ ∅ ∈ (V × V) | |
| 4 | 3 | a1i 11 | . 2 ⊢ (Rel 𝑅 → ¬ ∅ ∈ (V × V)) |
| 5 | 2, 4 | ssneldd 3925 | 1 ⊢ (Rel 𝑅 → ¬ ∅ ∈ 𝑅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∈ wcel 2114 Vcvv 3430 ⊆ wss 3890 ∅c0 4274 × cxp 5623 Rel wrel 5630 |
| 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 2709 ax-sep 5232 ax-pr 5371 |
| 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 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-opab 5149 df-xp 5631 df-rel 5632 |
| This theorem is referenced by: 0nelrel 5686 reldmtpos 8178 bj-0nelopab 37392 bj-brrelex12ALT 37393 tposrescnv 49369 tposres3 49371 tposres 49372 idfurcl 49588 oppfrcllem 49617 2oppf 49622 fucofvalne 49815 |
| Copyright terms: Public domain | W3C validator |