Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nssne1 | Structured version Visualization version GIF version |
Description: Two classes are different if they don't include the same class. (Contributed by NM, 23-Apr-2015.) |
Ref | Expression |
---|---|
nssne1 | ⊢ ((𝐴 ⊆ 𝐵 ∧ ¬ 𝐴 ⊆ 𝐶) → 𝐵 ≠ 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sseq2 3590 | . . . 4 ⊢ (𝐵 = 𝐶 → (𝐴 ⊆ 𝐵 ↔ 𝐴 ⊆ 𝐶)) | |
2 | 1 | biimpcd 238 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (𝐵 = 𝐶 → 𝐴 ⊆ 𝐶)) |
3 | 2 | necon3bd 2796 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (¬ 𝐴 ⊆ 𝐶 → 𝐵 ≠ 𝐶)) |
4 | 3 | imp 444 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∧ ¬ 𝐴 ⊆ 𝐶) → 𝐵 ≠ 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 383 = wceq 1475 ≠ wne 2780 ⊆ wss 3540 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-ne 2782 df-in 3547 df-ss 3554 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |