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

Theorem sotr 4981
Description: A strict order relation is a transitive relation. (Contributed by NM, 21-Jan-1996.)
Assertion
Ref Expression
sotr ((𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐷𝐴)) → ((𝐵𝑅𝐶𝐶𝑅𝐷) → 𝐵𝑅𝐷))

Proof of Theorem sotr
StepHypRef Expression
1 sopo 4976 . 2 (𝑅 Or 𝐴𝑅 Po 𝐴)
2 potr 4971 . 2 ((𝑅 Po 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐷𝐴)) → ((𝐵𝑅𝐶𝐶𝑅𝐷) → 𝐵𝑅𝐷))
31, 2sylan 487 1 ((𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐷𝐴)) → ((𝐵𝑅𝐶𝐶𝑅𝐷) → 𝐵𝑅𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383  w3a 1031  wcel 1977   class class class wbr 4583   Po wpo 4957   Or wor 4958
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-br 4584  df-po 4959  df-so 4960
This theorem is referenced by:  sotr2  4988  wetrep  5031  wereu2  5035  sotri  5442  suplub2  8250  slttr  31070  fin2solem  32565
  Copyright terms: Public domain W3C validator