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

Theorem potr 4363
Description: A partial order relation is a transitive relation. (Contributed by NM, 27-Mar-1997.)
Assertion
Ref Expression
potr  |-  ( ( R  Po  A  /\  ( B  e.  A  /\  C  e.  A  /\  D  e.  A
) )  ->  (
( B R C  /\  C R D )  ->  B R D ) )

Proof of Theorem potr
StepHypRef Expression
1 pocl 4358 . . 3  |-  ( R  Po  A  ->  (
( B  e.  A  /\  C  e.  A  /\  D  e.  A
)  ->  ( -.  B R B  /\  (
( B R C  /\  C R D )  ->  B R D ) ) ) )
21imp 418 . 2  |-  ( ( R  Po  A  /\  ( B  e.  A  /\  C  e.  A  /\  D  e.  A
) )  ->  ( -.  B R B  /\  ( ( B R C  /\  C R D )  ->  B R D ) ) )
32simprd 449 1  |-  ( ( R  Po  A  /\  ( B  e.  A  /\  C  e.  A  /\  D  e.  A
) )  ->  (
( B R C  /\  C R D )  ->  B R D ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 358    /\ w3a 934    e. wcel 1701   class class class wbr 4060    Po wpo 4349
This theorem is referenced by:  po2nr  4364  po3nr  4365  pofun  4367  sotr  4373  poltletr  5115  poxp  6269  frfi  7147  wemaplem2  7307  sornom  7948  zorn2lem7  8174  pospo  14156  predpo  24569  poseq  24638  seqpo  25606
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1537  ax-5 1548  ax-17 1607  ax-9 1645  ax-8 1666  ax-6 1720  ax-7 1725  ax-11 1732  ax-12 1897  ax-ext 2297
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1533  df-nf 1536  df-sb 1640  df-clab 2303  df-cleq 2309  df-clel 2312  df-nfc 2441  df-ral 2582  df-rab 2586  df-v 2824  df-dif 3189  df-un 3191  df-in 3193  df-ss 3200  df-nul 3490  df-if 3600  df-sn 3680  df-pr 3681  df-op 3683  df-br 4061  df-po 4351
  Copyright terms: Public domain W3C validator