Theorem altopeq2 35965

Description: Equality for alternate ordered pairs. (Contributed by Scott Fenton, 22-Mar-2012.)

Assertion

Ref	Expression
altopeq2	⊢ (𝐴 = 𝐵 → ⟪𝐶, 𝐴⟫ = ⟪𝐶, 𝐵⟫)

Proof of Theorem altopeq2

Step	Hyp	Ref	Expression
1		eqid 2737	. 2 ⊢ 𝐶 = 𝐶
2		altopeq12 35963	. 2 ⊢ ((𝐶 = 𝐶 ∧ 𝐴 = 𝐵) → ⟪𝐶, 𝐴⟫ = ⟪𝐶, 𝐵⟫)
3	1, 2	mpan 690	1 ⊢ (𝐴 = 𝐵 → ⟪𝐶, 𝐴⟫ = ⟪𝐶, 𝐵⟫)

Syntax hints:   → wi 4   = wceq 1540  ⟪caltop 35957

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-v 3482  df-dif 3954  df-un 3956  df-ss 3968  df-nul 4334  df-sn 4627  df-pr 4629  df-altop 35959

This theorem is referenced by:  sbcaltop  35982