Theorem nelneq 2888

Description: A way of showing two classes are not equal. (Contributed by NM, 1-Apr-1997.)

Assertion

Ref	Expression
nelneq	⊢ ((𝐴 ∈ 𝐶 ∧ ¬ 𝐵 ∈ 𝐶) → ¬ 𝐴 = 𝐵)

Proof of Theorem nelneq

Step	Hyp	Ref	Expression
1		eleq1 2852	. . 3 ⊢ (𝐴 = 𝐵 → (𝐴 ∈ 𝐶 ↔ 𝐵 ∈ 𝐶))
2	1	biimpcd 252	. 2 ⊢ (𝐴 ∈ 𝐶 → (𝐴 = 𝐵 → 𝐵 ∈ 𝐶))
3	2	con3dimp 414	1 ⊢ ((𝐴 ∈ 𝐶 ∧ ¬ 𝐵 ∈ 𝐶) → ¬ 𝐴 = 𝐵)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2146

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-cleq 2755  df-clel 2839

This theorem is used by:  nelne2  3057  onfununi  8363  suc11reg  9633  cantnfp1lem3  9694  oemapvali  9698  mreexmrid  17832  supxrnemnf  33416  elrgspnlem4  33862  elrspunsn  34035  onint1  37370  bj-fvmptunsn2  38325  maxidln0  39125  rencldnfilem  43973  climlimsupcex  46924  icccncfext  47042  parswapprop  50922