Theorem nelneq 2138

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 2100	. . 3 ⊢ (𝐴 = 𝐵 → (𝐴 ∈ 𝐶 ↔ 𝐵 ∈ 𝐶))
2	1	biimpcd 148	. 2 ⊢ (𝐴 ∈ 𝐶 → (𝐴 = 𝐵 → 𝐵 ∈ 𝐶))
3	2	con3and 564	1 ⊢ ((𝐴 ∈ 𝐶 ∧ ¬ 𝐵 ∈ 𝐶) → ¬ 𝐴 = 𝐵)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 97   = wceq 1243   ∈ wcel 1393

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-5 1336  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-4 1400  ax-17 1419  ax-ial 1427  ax-ext 2022

This theorem depends on definitions:  df-bi 110  df-cleq 2033  df-clel 2036

This theorem is referenced by: (None)