MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  0nelrel0 Structured version   Visualization version   GIF version

Theorem 0nelrel0 5722
Description: A binary relation does not contain the empty set. (Contributed by AV, 15-Nov-2021.) (Revised by BJ, 14-Jul-2023.)
Assertion
Ref Expression
0nelrel0 (Rel 𝑅 → ¬ ∅ ∈ 𝑅)

Proof of Theorem 0nelrel0
StepHypRef Expression
1 df-rel 5669 . . 3 (Rel 𝑅𝑅 ⊆ (V × V))
21biimpi 219 . 2 (Rel 𝑅𝑅 ⊆ (V × V))
3 0nelxp 5696 . . 3 ¬ ∅ ∈ (V × V)
43a1i 11 . 2 (Rel 𝑅 → ¬ ∅ ∈ (V × V))
52, 4ssneldd 3948 1 (Rel 𝑅 → ¬ ∅ ∈ 𝑅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wcel 2149  Vcvv 3463  wss 3913  c0 4294   × cxp 5660  Rel wrel 5667
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-sep 5261  ax-pr 5405
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ne 2965  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-opab 5178  df-xp 5668  df-rel 5669
This theorem is referenced by:  0nelrel  5723  nrelv  5787  reldmtpos  8230  bj-0nelopab  37624  bj-brrelex12ALT  37625  tposrescnv  49576  tposres3  49578  tposres  49579  idfurcl  49795  oppfrcllem  49824  2oppf  49829  fucofvalne  50022
  Copyright terms: Public domain W3C validator