Theorem eldifsnbd 4753

Description: Membership in a set with an element removed implies non-equality with that element. (Contributed by Thierry Arnoux, 13-Jul-2026.)

Hypothesis

Ref	Expression
eldifsnbd.1	⊢ (𝜑 → 𝐴 ∈ (𝐵 ∖ {𝐶}))

Assertion

Ref	Expression
eldifsnbd	⊢ (𝜑 → 𝐴 ≠ 𝐶)

Proof of Theorem eldifsnbd

Step	Hyp	Ref	Expression
1		eldifsnbd.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ (𝐵 ∖ {𝐶}))
2		eldifsn 4752	. . 3 ⊢ (𝐴 ∈ (𝐵 ∖ {𝐶}) ↔ (𝐴 ∈ 𝐵 ∧ 𝐴 ≠ 𝐶))
3	1, 2	sylib 221	. 2 ⊢ (𝜑 → (𝐴 ∈ 𝐵 ∧ 𝐴 ≠ 𝐶))
4	3	simprd 500	1 ⊢ (𝜑 → 𝐴 ≠ 𝐶)

Syntax hints:   → wi 4   ∧ wa 400   ∈ wcel 2141   ≠ wne 2956   ∖ cdif 3901  {csn 4588

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-ext 2733

This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1571  df-ex 1808  df-sb 2095  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-v 3455  df-dif 3907  df-sn 4589

This theorem is referenced by:  ragsupplcgra  29121  dfprlng2  29170