| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nelneq | Structured version Visualization version GIF version | ||
| Description: A way of showing two classes are not equal. (Contributed by NM, 1-Apr-1997.) |
| Ref | Expression |
|---|---|
| nelneq | ⊢ ((𝐴 ∈ 𝐶 ∧ ¬ 𝐵 ∈ 𝐶) → ¬ 𝐴 = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq1 2824 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐴 ∈ 𝐶 ↔ 𝐵 ∈ 𝐶)) | |
| 2 | 1 | biimpcd 249 | . 2 ⊢ (𝐴 ∈ 𝐶 → (𝐴 = 𝐵 → 𝐵 ∈ 𝐶)) |
| 3 | 2 | con3dimp 408 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ ¬ 𝐵 ∈ 𝐶) → ¬ 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1782 df-cleq 2728 df-clel 2811 |
| This theorem is referenced by: nelne2 3030 onfununi 8281 suc11reg 9540 cantnfp1lem3 9601 oemapvali 9605 mreexmrid 17609 supxrnemnf 32841 elrgspnlem4 33306 elrspunsn 33489 onint1 36631 bj-fvmptunsn2 37572 maxidln0 38366 rencldnfilem 43248 climlimsupcex 46197 icccncfext 46315 |
| Copyright terms: Public domain | W3C validator |