Theorem 0nelrel0 5715

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

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∈ wcel 2145  Vcvv 3450   ⊆ wss 3899  ∅c0 4279   × cxp 5653  Rel wrel 5660

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-sep 5251  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 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-opab 5168  df-xp 5661  df-rel 5662

This theorem is used by:  0nelrel  5716  nrelv  5780  reldmtpos  8233  bj-0nelopab  37813  bj-brrelex12ALT  37814  tposrescnv  49808  tposres3  49810  tposres  49811  idfurcl  50027  oppfrcllem  50056  2oppf  50061  fucofvalne  50254