Theorem soeq12d 5591

Description: Equality deduction for total orderings. (Contributed by Stefan O'Rear, 19-Jan-2015.) (Proof shortened by Matthew House, 10-Sep-2025.)

Hypotheses

Ref	Expression
soeq12d.1	⊢ (𝜑 → 𝑅 = 𝑆)
soeq12d.2	⊢ (𝜑 → 𝐴 = 𝐵)

Assertion

Ref	Expression
soeq12d	⊢ (𝜑 → (𝑅 Or 𝐴 ↔ 𝑆 Or 𝐵))

Proof of Theorem soeq12d

Step	Hyp	Ref	Expression
1		soeq12d.1	. 2 ⊢ (𝜑 → 𝑅 = 𝑆)
2		soeq12d.2	. 2 ⊢ (𝜑 → 𝐴 = 𝐵)
3		soeq1 5589	. . 3 ⊢ (𝑅 = 𝑆 → (𝑅 Or 𝐴 ↔ 𝑆 Or 𝐴))
4		soeq2 5590	. . 3 ⊢ (𝐴 = 𝐵 → (𝑆 Or 𝐴 ↔ 𝑆 Or 𝐵))
5	3, 4	sylan9bb 518	. 2 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → (𝑅 Or 𝐴 ↔ 𝑆 Or 𝐵))
6	1, 2, 5	syl2anc 595	1 ⊢ (𝜑 → (𝑅 Or 𝐴 ↔ 𝑆 Or 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569   Or wor 5567

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-ex 1809  df-cleq 2754  df-clel 2837  df-ral 3079  df-ss 3921  df-br 5109  df-po 5568  df-so 5569

This theorem is used by:  opsrtoslem2  22218  weiunso  37005