Theorem pm13.181 2458

Description: Theorem *13.181 in [WhiteheadRussell] p. 178. (Contributed by Andrew Salmon, 3-Jun-2011.)

Assertion

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

Proof of Theorem pm13.181

Step	Hyp	Ref	Expression
1		eqcom 2207	. 2 ⊢ (𝐴 = 𝐵 ↔ 𝐵 = 𝐴)
2		pm13.18 2457	. 2 ⊢ ((𝐵 = 𝐴 ∧ 𝐵 ≠ 𝐶) → 𝐴 ≠ 𝐶)
3	1, 2	sylanb 284	1 ⊢ ((𝐴 = 𝐵 ∧ 𝐵 ≠ 𝐶) → 𝐴 ≠ 𝐶)

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1373   ≠ wne 2376

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-5 1470  ax-gen 1472  ax-4 1533  ax-17 1549  ax-ext 2187

This theorem depends on definitions:  df-bi 117  df-cleq 2198  df-ne 2377

This theorem is referenced by:  nninfisollemne  7233  fzprval  10204  mod2eq1n2dvds  12190