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

Theorem sotr 4320
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 4315 . 2  |-  ( R  Or  A  ->  R  Po  A )
2 potr 4310 . 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 978    e. wcel 2148   class class class wbr 4005    Po wpo 4296    Or wor 4297
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-v 2741  df-un 3135  df-sn 3600  df-pr 3601  df-op 3603  df-br 4006  df-po 4298  df-iso 4299
This theorem is referenced by:  sotri  5026  cauappcvgprlemdisj  7652  suplocexprlemru  7720
  Copyright terms: Public domain W3C validator