Theorem 0nelrel0 5746

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 5693	. . 3 ⊢ (Rel 𝑅 ↔ 𝑅 ⊆ (V × V))
2	1	biimpi 215	. 2 ⊢ (Rel 𝑅 → 𝑅 ⊆ (V × V))
3		0nelxp 5720	. . 3 ⊢ ¬ ∅ ∈ (V × V)
4	3	a1i 11	. 2 ⊢ (Rel 𝑅 → ¬ ∅ ∈ (V × V))
5	2, 4	ssneldd 3994	1 ⊢ (Rel 𝑅 → ¬ ∅ ∈ 𝑅)

Syntax hints:  ¬ wn 3   → wi 4   ∈ wcel 2100  Vcvv 3472   ⊆ wss 3959  ∅c0 4335   × cxp 5684  Rel wrel 5691

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2102  ax-9 2110  ax-ext 2700  ax-sep 5307  ax-nul 5314  ax-pr 5437

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1537  df-fal 1547  df-ex 1775  df-sb 2062  df-clab 2707  df-cleq 2721  df-clel 2806  df-ne 2934  df-v 3474  df-dif 3962  df-un 3964  df-ss 3976  df-nul 4336  df-if 4537  df-sn 4637  df-pr 4639  df-op 4643  df-opab 5219  df-xp 5692  df-rel 5693

This theorem is referenced by:  0nelrel  5747  reldmtpos  8257  bj-0nelopab  36820  bj-brrelex12ALT  36821