Theorem nelaneqOLD 9579

Description: Obsolete version of nelaneq 9578 as of 22-Apr-2026. (Proposed by BJ, 18-Jun-2022.) (Contributed by AV, 18-Jun-2022.) (Proof shortened by TM, 31-Dec-2025.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
nelaneqOLD	⊢ ¬ (𝐴 ∈ 𝐵 ∧ 𝐴 = 𝐵)

Proof of Theorem nelaneqOLD

Step	Hyp	Ref	Expression
1		elirr 9576	. . . 4 ⊢ ¬ 𝐴 ∈ 𝐴
2		eleq2 2851	. . . 4 ⊢ (𝐴 = 𝐵 → (𝐴 ∈ 𝐴 ↔ 𝐴 ∈ 𝐵))
3	1, 2	mtbii 329	. . 3 ⊢ (𝐴 = 𝐵 → ¬ 𝐴 ∈ 𝐵)
4	3	con2i 140	. 2 ⊢ (𝐴 ∈ 𝐵 → ¬ 𝐴 = 𝐵)
5		imnan 405	. 2 ⊢ ((𝐴 ∈ 𝐵 → ¬ 𝐴 = 𝐵) ↔ ¬ (𝐴 ∈ 𝐵 ∧ 𝐴 = 𝐵))
6	4, 5	mpbi 233	1 ⊢ ¬ (𝐴 ∈ 𝐵 ∧ 𝐴 = 𝐵)

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

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734  ax-sep 5255  ax-reg 9568

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837

This theorem is used by: (None)