Theorem 0nelrel0 5684

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

Syntax hints:  ¬ wn 3   → wi 4   ∈ wcel 2113  Vcvv 3440   ⊆ wss 3901  ∅c0 4285   × cxp 5622  Rel wrel 5629

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-v 3442  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-opab 5161  df-xp 5630  df-rel 5631

This theorem is referenced by:  0nelrel  5685  reldmtpos  8176  bj-0nelopab  37269  bj-brrelex12ALT  37270  tposrescnv  49145  tposres3  49147  tposres  49148  idfurcl  49364  oppfrcllem  49393  2oppf  49398  fucofvalne  49591