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

Theorem potr 5076
Description: A partial order relation is a transitive relation. (Contributed by NM, 27-Mar-1997.)
Assertion
Ref Expression
potr ((𝑅 Po 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐷𝐴)) → ((𝐵𝑅𝐶𝐶𝑅𝐷) → 𝐵𝑅𝐷))

Proof of Theorem potr
StepHypRef Expression
1 pocl 5071 . . 3 (𝑅 Po 𝐴 → ((𝐵𝐴𝐶𝐴𝐷𝐴) → (¬ 𝐵𝑅𝐵 ∧ ((𝐵𝑅𝐶𝐶𝑅𝐷) → 𝐵𝑅𝐷))))
21imp 444 . 2 ((𝑅 Po 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐷𝐴)) → (¬ 𝐵𝑅𝐵 ∧ ((𝐵𝑅𝐶𝐶𝑅𝐷) → 𝐵𝑅𝐷)))
32simprd 478 1 ((𝑅 Po 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐷𝐴)) → ((𝐵𝑅𝐶𝐶𝑅𝐷) → 𝐵𝑅𝐷))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 383  w3a 1054  wcel 2030   class class class wbr 4685   Po wpo 5062
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ral 2946  df-rab 2950  df-v 3233  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217  df-br 4686  df-po 5064
This theorem is referenced by:  po2nr  5077  po3nr  5078  pofun  5080  sotr  5086  poltletr  5563  predpo  5736  poxp  7334  frfi  8246  wemaplem2  8493  sornom  9137  zorn2lem7  9362  pospo  17020  pocnv  31779  frpomin  31863  poseq  31878  seqpo  33673
  Copyright terms: Public domain W3C validator