Theorem pm13.181OLD 3023

Description: Obsolete version of pm13.181 3022 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 2743	. 2 ⊢ (𝐴 = 𝐵 ↔ 𝐵 = 𝐴)
2		pm13.18 3021	. 2 ⊢ ((𝐵 = 𝐴 ∧ 𝐵 ≠ 𝐶) → 𝐴 ≠ 𝐶)
3	1, 2	sylanb 581	1 ⊢ ((𝐴 = 𝐵 ∧ 𝐵 ≠ 𝐶) → 𝐴 ≠ 𝐶)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1539   ≠ wne 2939

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-9 2117  ax-ext 2707

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1779  df-cleq 2728  df-ne 2940

This theorem is referenced by: (None)