Theorem 0nelrel0 5721

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

Step	Hyp	Ref	Expression
1		df-rel 5668	. . 3 ⊢ (Rel 𝑅 ↔ 𝑅 ⊆ (V × V))
2	1	biimpi 219	. 2 ⊢ (Rel 𝑅 → 𝑅 ⊆ (V × V))
3		0nelxp 5695	. . 3 ⊢ ¬ ∅ ∈ (V × V)
4	3	a1i 11	. 2 ⊢ (Rel 𝑅 → ¬ ∅ ∈ (V × V))
5	2, 4	ssneldd 3940	1 ⊢ (Rel 𝑅 → ¬ ∅ ∈ 𝑅)

Syntax hints:  ¬ wn 3   → wi 4   ∈ wcel 2143  Vcvv 3455   ⊆ wss 3905  ∅c0 4286   × cxp 5659  Rel wrel 5666

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257  ax-pr 5404

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-opab 5174  df-xp 5667  df-rel 5668

This theorem is referenced by:  0nelrel  5722  nrelv  5786  reldmtpos  8226  bj-0nelopab  37722  bj-brrelex12ALT  37723  tposrescnv  49677  tposres3  49679  tposres  49680  idfurcl  49896  oppfrcllem  49925  2oppf  49930  fucofvalne  50123