Theorem pm13.181OLD 3024

Description: Obsolete version of pm13.181 3023 as of 30-Oct-2024. (Contributed by Andrew Salmon, 3-Jun-2011.) (New usage is discouraged.) (Proof modification is discouraged.)

Assertion

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

Proof of Theorem pm13.181OLD

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

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1541   ≠ wne 2940

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-9 2116  ax-ext 2703

This theorem depends on definitions:  df-bi 206  df-an 397  df-ex 1782  df-cleq 2724  df-ne 2941

This theorem is referenced by: (None)