Theorem nelneq2 2887

Description: A way of showing two classes are not equal. (Contributed by NM, 12-Jan-2002.)

Assertion

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

Proof of Theorem nelneq2

Step	Hyp	Ref	Expression
1		eleq2 2851	. . 3 ⊢ (𝐵 = 𝐶 → (𝐴 ∈ 𝐵 ↔ 𝐴 ∈ 𝐶))
2	1	biimpcd 252	. 2 ⊢ (𝐴 ∈ 𝐵 → (𝐵 = 𝐶 → 𝐴 ∈ 𝐶))
3	2	con3dimp 413	1 ⊢ ((𝐴 ∈ 𝐵 ∧ ¬ 𝐴 ∈ 𝐶) → ¬ 𝐵 = 𝐶)

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

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 401  df-ex 1809  df-cleq 2754  df-clel 2837

This theorem is used by:  nelne1  3054  ssnelpss  4068  opthwiener  5496  ssfin4  10300  pwxpndom2  10656  fzneuz  13643  hauspwpwf1  24155  topdifinffinlem  38021  clsk1indlem1  44799