| 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 2852 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐴 ∈ 𝐶 ↔ 𝐵 ∈ 𝐶)) | |
| 2 | 1 | biimpcd 252 | . 2 ⊢ (𝐴 ∈ 𝐶 → (𝐴 = 𝐵 → 𝐵 ∈ 𝐶)) |
| 3 | 2 | con3dimp 414 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ ¬ 𝐵 ∈ 𝐶) → ¬ 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 |
| 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-ex 1813 df-cleq 2755 df-clel 2839 |
| This theorem is used by: nelne2 3057 onfununi 8387 suc11reg 9657 cantnfp1lem3 9718 oemapvali 9722 mreexmrid 17867 supxrnemnf 33456 elrgspnlem4 33905 elrspunsn 34083 onint1 37452 bj-fvmptunsn2 38447 maxidln0 39245 rencldnfilem 44093 climlimsupcex 47113 icccncfext 47231 parswapprop 51169 |
| Copyright terms: Public domain | W3C validator |