ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  poeq1 GIF version

Theorem poeq1 4284
Description: Equality theorem for partial ordering predicate. (Contributed by NM, 27-Mar-1997.)
Assertion
Ref Expression
poeq1 (𝑅 = 𝑆 → (𝑅 Po 𝐴𝑆 Po 𝐴))

Proof of Theorem poeq1
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq 3991 . . . . . 6 (𝑅 = 𝑆 → (𝑥𝑅𝑥𝑥𝑆𝑥))
21notbid 662 . . . . 5 (𝑅 = 𝑆 → (¬ 𝑥𝑅𝑥 ↔ ¬ 𝑥𝑆𝑥))
3 breq 3991 . . . . . . 7 (𝑅 = 𝑆 → (𝑥𝑅𝑦𝑥𝑆𝑦))
4 breq 3991 . . . . . . 7 (𝑅 = 𝑆 → (𝑦𝑅𝑧𝑦𝑆𝑧))
53, 4anbi12d 470 . . . . . 6 (𝑅 = 𝑆 → ((𝑥𝑅𝑦𝑦𝑅𝑧) ↔ (𝑥𝑆𝑦𝑦𝑆𝑧)))
6 breq 3991 . . . . . 6 (𝑅 = 𝑆 → (𝑥𝑅𝑧𝑥𝑆𝑧))
75, 6imbi12d 233 . . . . 5 (𝑅 = 𝑆 → (((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧) ↔ ((𝑥𝑆𝑦𝑦𝑆𝑧) → 𝑥𝑆𝑧)))
82, 7anbi12d 470 . . . 4 (𝑅 = 𝑆 → ((¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ (¬ 𝑥𝑆𝑥 ∧ ((𝑥𝑆𝑦𝑦𝑆𝑧) → 𝑥𝑆𝑧))))
98ralbidv 2470 . . 3 (𝑅 = 𝑆 → (∀𝑧𝐴𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ ∀𝑧𝐴𝑥𝑆𝑥 ∧ ((𝑥𝑆𝑦𝑦𝑆𝑧) → 𝑥𝑆𝑧))))
1092ralbidv 2494 . 2 (𝑅 = 𝑆 → (∀𝑥𝐴𝑦𝐴𝑧𝐴𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ ∀𝑥𝐴𝑦𝐴𝑧𝐴𝑥𝑆𝑥 ∧ ((𝑥𝑆𝑦𝑦𝑆𝑧) → 𝑥𝑆𝑧))))
11 df-po 4281 . 2 (𝑅 Po 𝐴 ↔ ∀𝑥𝐴𝑦𝐴𝑧𝐴𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
12 df-po 4281 . 2 (𝑆 Po 𝐴 ↔ ∀𝑥𝐴𝑦𝐴𝑧𝐴𝑥𝑆𝑥 ∧ ((𝑥𝑆𝑦𝑦𝑆𝑧) → 𝑥𝑆𝑧)))
1310, 11, 123bitr4g 222 1 (𝑅 = 𝑆 → (𝑅 Po 𝐴𝑆 Po 𝐴))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103  wb 104   = wceq 1348  wral 2448   class class class wbr 3989   Po wpo 4279
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-5 1440  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-4 1503  ax-17 1519  ax-ial 1527  ax-ext 2152
This theorem depends on definitions:  df-bi 116  df-nf 1454  df-cleq 2163  df-clel 2166  df-ral 2453  df-br 3990  df-po 4281
This theorem is referenced by:  soeq1  4300
  Copyright terms: Public domain W3C validator