Theorem pm13.18 3018

Description: Theorem *13.18 in [WhiteheadRussell] p. 178. (Contributed by Andrew Salmon, 3-Jun-2011.) (Proof shortened by Wolf Lammen, 29-Oct-2024.)

Assertion

Ref	Expression
pm13.18	⊢ ((𝐴 = 𝐵 ∧ 𝐴 ≠ 𝐶) → 𝐵 ≠ 𝐶)

Proof of Theorem pm13.18

Step	Hyp	Ref	Expression
1		neeq1 2999	. 2 ⊢ (𝐴 = 𝐵 → (𝐴 ≠ 𝐶 ↔ 𝐵 ≠ 𝐶))
2	1	biimpa 475	1 ⊢ ((𝐴 = 𝐵 ∧ 𝐴 ≠ 𝐶) → 𝐵 ≠ 𝐶)

Syntax hints:   → wi 4   ∧ wa 394   = wceq 1533   ≠ wne 2936

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-9 2108  ax-ext 2698

This theorem depends on definitions:  df-bi 206  df-an 395  df-ex 1774  df-cleq 2719  df-ne 2937

This theorem is referenced by:  pm13.181OLD  3020  iotan0  6541  frgrwopreglem5a  30139  4atexlemex4  39550  cncfiooicclem1  45283