Theorem neldifpr1 32561

Description: The first element of a pair is not an element of a difference with this pair. (Contributed by Thierry Arnoux, 20-Nov-2023.)

Assertion

Ref	Expression
neldifpr1	⊢ ¬ 𝐴 ∈ (𝐶 ∖ {𝐴, 𝐵})

Proof of Theorem neldifpr1

Step	Hyp	Ref	Expression
1		neirr 2955	. 2 ⊢ ¬ 𝐴 ≠ 𝐴
2		eldifpr 4680	. . 3 ⊢ (𝐴 ∈ (𝐶 ∖ {𝐴, 𝐵}) ↔ (𝐴 ∈ 𝐶 ∧ 𝐴 ≠ 𝐴 ∧ 𝐴 ≠ 𝐵))
3	2	simp2bi 1146	. 2 ⊢ (𝐴 ∈ (𝐶 ∖ {𝐴, 𝐵}) → 𝐴 ≠ 𝐴)
4	1, 3	mto 197	1 ⊢ ¬ 𝐴 ∈ (𝐶 ∖ {𝐴, 𝐵})

Syntax hints:  ¬ wn 3   ∈ wcel 2108   ≠ wne 2946   ∖ cdif 3973  {cpr 4650

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-v 3490  df-dif 3979  df-un 3981  df-sn 4649  df-pr 4651

This theorem is referenced by: (None)