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

Theorem sotr 4409
Description: A strict order relation is a transitive relation. (Contributed by NM, 21-Jan-1996.)
Assertion
Ref Expression
sotr  |-  ( ( R  Or  A  /\  ( B  e.  A  /\  C  e.  A  /\  D  e.  A
) )  ->  (
( B R C  /\  C R D )  ->  B R D ) )

Proof of Theorem sotr
StepHypRef Expression
1 sopo 4404 . 2  |-  ( R  Or  A  ->  R  Po  A )
2 potr 4399 . 2  |-  ( ( R  Po  A  /\  ( B  e.  A  /\  C  e.  A  /\  D  e.  A
) )  ->  (
( B R C  /\  C R D )  ->  B R D ) )
31, 2sylan 283 1  |-  ( ( R  Or  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:    -> wi 4    /\ wa 104    /\ w3a 1002    e. wcel 2200   class class class wbr 4083    Po wpo 4385    Or wor 4386
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-v 2801  df-un 3201  df-sn 3672  df-pr 3673  df-op 3675  df-br 4084  df-po 4387  df-iso 4388
This theorem is referenced by:  sotri  5124  cauappcvgprlemdisj  7838  suplocexprlemru  7906
  Copyright terms: Public domain W3C validator