Theorem sotr 4441

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

Step	Hyp	Ref	Expression
1		sopo 4436	. 2 |- ( R Or A -> R Po A )
2		potr 4431	. 2 |- ( ( R Po A /\ ( B e. A /\ C e. A /\ D e. A ) ) -> ( ( B R C /\ C R D ) -> B R D ) )
3	1, 2	sylan 283	1 |- ( ( R Or A /\ ( B e. A /\ C e. A /\ D e. A ) ) -> ( ( B R C /\ C R D ) -> B R D ) )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1005   e. wcel 2205   class class class wbr 4111   Po wpo 4417   Or wor 4418

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-v 2817  df-un 3217  df-sn 3697  df-pr 3698  df-op 3700  df-br 4112  df-po 4419  df-iso 4420

This theorem is referenced by:  sotri  5160  cauappcvgprlemdisj  7968  suplocexprlemru  8036