Theorem soeq1 5571

Description: Equality theorem for the strict ordering predicate. (Contributed by NM, 16-Mar-1997.)

Assertion

Ref	Expression
soeq1	⊢ (𝑅 = 𝑆 → (𝑅 Or 𝐴 ↔ 𝑆 Or 𝐴))

Proof of Theorem soeq1

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		poeq1 5553	. . 3 ⊢ (𝑅 = 𝑆 → (𝑅 Po 𝐴 ↔ 𝑆 Po 𝐴))
2		breq 5112	. . . . 5 ⊢ (𝑅 = 𝑆 → (𝑥𝑅𝑦 ↔ 𝑥𝑆𝑦))
3		biidd 261	. . . . 5 ⊢ (𝑅 = 𝑆 → (𝑥 = 𝑦 ↔ 𝑥 = 𝑦))
4		breq 5112	. . . . 5 ⊢ (𝑅 = 𝑆 → (𝑦𝑅𝑥 ↔ 𝑦𝑆𝑥))
5	2, 3, 4	3orbi123d 1435	. . . 4 ⊢ (𝑅 = 𝑆 → ((𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) ↔ (𝑥𝑆𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑆𝑥)))
6	5	2ralbidv 3208	. . 3 ⊢ (𝑅 = 𝑆 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑆𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑆𝑥)))
7	1, 6	anbi12d 631	. 2 ⊢ (𝑅 = 𝑆 → ((𝑅 Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)) ↔ (𝑆 Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑆𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑆𝑥))))
8		df-so 5551	. 2 ⊢ (𝑅 Or 𝐴 ↔ (𝑅 Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))
9		df-so 5551	. 2 ⊢ (𝑆 Or 𝐴 ↔ (𝑆 Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑆𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑆𝑥)))
10	7, 8, 9	3bitr4g 313	1 ⊢ (𝑅 = 𝑆 → (𝑅 Or 𝐴 ↔ 𝑆 Or 𝐴))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∨ w3o 1086   = wceq 1541  ∀wral 3060   class class class wbr 5110   Po wpo 5548   Or wor 5549

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-8 2108  ax-9 2116  ax-ext 2702

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-ex 1782  df-cleq 2723  df-clel 2809  df-ral 3061  df-br 5111  df-po 5550  df-so 5551

This theorem is referenced by:  weeq1  5626  ltsopi  10833  cnso  16140  opsrtoslem2  21500  soeq12d  41423