MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  soeq1 Structured version   Visualization version   GIF version

Theorem soeq1 5019
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.
StepHypRef Expression
1 poeq1 5003 . . 3 (𝑅 = 𝑆 → (𝑅 Po 𝐴𝑆 Po 𝐴))
2 breq 4620 . . . . 5 (𝑅 = 𝑆 → (𝑥𝑅𝑦𝑥𝑆𝑦))
3 biidd 252 . . . . 5 (𝑅 = 𝑆 → (𝑥 = 𝑦𝑥 = 𝑦))
4 breq 4620 . . . . 5 (𝑅 = 𝑆 → (𝑦𝑅𝑥𝑦𝑆𝑥))
52, 3, 43orbi123d 1395 . . . 4 (𝑅 = 𝑆 → ((𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) ↔ (𝑥𝑆𝑦𝑥 = 𝑦𝑦𝑆𝑥)))
652ralbidv 2984 . . 3 (𝑅 = 𝑆 → (∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) ↔ ∀𝑥𝐴𝑦𝐴 (𝑥𝑆𝑦𝑥 = 𝑦𝑦𝑆𝑥)))
71, 6anbi12d 746 . 2 (𝑅 = 𝑆 → ((𝑅 Po 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥)) ↔ (𝑆 Po 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑆𝑦𝑥 = 𝑦𝑦𝑆𝑥))))
8 df-so 5001 . 2 (𝑅 Or 𝐴 ↔ (𝑅 Po 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥)))
9 df-so 5001 . 2 (𝑆 Or 𝐴 ↔ (𝑆 Po 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑆𝑦𝑥 = 𝑦𝑦𝑆𝑥)))
107, 8, 93bitr4g 303 1 (𝑅 = 𝑆 → (𝑅 Or 𝐴𝑆 Or 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384  w3o 1035   = wceq 1480  wral 2907   class class class wbr 4618   Po wpo 4998   Or wor 4999
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-ext 2601
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-ex 1702  df-cleq 2614  df-clel 2617  df-ral 2912  df-br 4619  df-po 5000  df-so 5001
This theorem is referenced by:  weeq1  5067  ltsopi  9661  cnso  14908  opsrtoslem2  19413  sltgtso  31596  soeq12d  37115
  Copyright terms: Public domain W3C validator