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

Theorem 0nelrel0 5718
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 5665 . . 3 (Rel 𝑅 ↔ 𝑅 ⊆ (V × V))
21biimpi 219 . 2 (Rel 𝑅 → 𝑅 ⊆ (V × V))
3 0nelxp 5692 . . 3 ¬ ∅ ∈ (V × V)
43a1i 11 . 2 (Rel 𝑅 → ¬ ∅ ∈ (V × V))
52, 4ssneldd 3916 1 (Rel 𝑅 → ¬ ∅ ∈ 𝑅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900  ∅c0 4281   × cxp 5656  Rel wrel 5663
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-opab 5174  df-xp 5664  df-rel 5665
This theorem is used by:  0nelrel  5719  nrelv  5786  reldmtpos  8289  bj-0nelopab  38251  bj-brrelex12ALT  38252  tposrescnv  50384  tposres3  50386  tposres  50387  idfurcl  50606  oppfrcllem  50635  2oppf  50640  fucofvalne  50839
  Copyright terms: Public domain W3C validator