| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elnelne1 | Structured version Visualization version GIF version | ||
| Description: Two classes are different if they don't contain the same element. (Contributed by AV, 28-Jan-2020.) |
| Ref | Expression |
|---|---|
| elnelne1 | ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∉ 𝐶) → 𝐵 ≠ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-nel 3065 | . 2 ⊢ (𝐴 ∉ 𝐶 ↔ ¬ 𝐴 ∈ 𝐶) | |
| 2 | nelne1 3055 | . 2 ⊢ ((𝐴 ∈ 𝐵 ∧ ¬ 𝐴 ∈ 𝐶) → 𝐵 ≠ 𝐶) | |
| 3 | 1, 2 | sylan2b 605 | 1 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∉ 𝐶) → 𝐵 ≠ 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 400 ∈ wcel 2143 ≠ wne 2958 ∉ wnel 3064 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 401 df-ex 1810 df-cleq 2755 df-clel 2838 df-ne 2959 df-nel 3065 |
| This theorem is used by: sticksstones1 42941 |
| Copyright terms: Public domain | W3C validator |