| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > brne0 | Structured version Visualization version GIF version | ||
| Description: If two sets are in a binary relation, the relation cannot be empty. (Contributed by Alexander van der Vekens, 7-Jul-2018.) |
| Ref | Expression |
|---|---|
| brne0 | ⊢ (𝐴𝑅𝐵 → 𝑅 ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-br 5109 | . 2 ⊢ (𝐴𝑅𝐵 ↔ 〈𝐴, 𝐵〉 ∈ 𝑅) | |
| 2 | ne0i 4290 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ 𝑅 → 𝑅 ≠ ∅) | |
| 3 | 1, 2 | sylbi 220 | 1 ⊢ (𝐴𝑅𝐵 → 𝑅 ≠ ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2147 ≠ wne 2959 ∅c0 4281 〈cop 4840 class class class wbr 5108 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-dif 4050 df-nul 4282 df-br 5109 |
| This theorem is used by: epn0 5563 brfvopabrbr 7021 bropfvvvvlem 8137 brfvimex 45348 brovmptimex 45349 clsneibex 45424 neicvgbex 45434 |
| Copyright terms: Public domain | W3C validator |