Theorem brne0 5155

Description: If two sets are in a binary relation, the relation cannot be empty. (Contributed by Alexander van der Vekens, 7-Jul-2018.)

Assertion

Ref	Expression
brne0	⊢ (𝐴𝑅𝐵 → 𝑅 ≠ ∅)

Proof of Theorem brne0

Step	Hyp	Ref	Expression
1		df-br 5104	. 2 ⊢ (𝐴𝑅𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑅)
2		ne0i 4287	. 2 ⊢ (⟨𝐴, 𝐵⟩ ∈ 𝑅 → 𝑅 ≠ ∅)
3	1, 2	sylbi 220	1 ⊢ (𝐴𝑅𝐵 → 𝑅 ≠ ∅)

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2145   ≠ wne 2956  ∅c0 4279  ⟨cop 4590   class class class wbr 5103

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 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-dif 3902  df-nul 4280  df-br 5104

This theorem is used by:  epn0  5556  brfvopabrbr  6990  bropfvvvvlem  8102  brfvimex  45025  brovmptimex  45026  clsneibex  45101  neicvgbex  45111