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

Theorem poltletr 5339
Description: Transitive law for general strict orders. (Contributed by Stefan O'Rear, 17-Jan-2015.)
Assertion
Ref Expression
poltletr  |-  ( ( R  Po  X  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X
) )  ->  (
( A R B  /\  B ( R  u.  _I  ) C )  ->  A R C ) )

Proof of Theorem poltletr
StepHypRef Expression
1 poleloe 5338 . . . . 5  |-  ( C  e.  X  ->  ( B ( R  u.  _I  ) C  <->  ( B R C  \/  B  =  C ) ) )
213ad2ant3 1018 . . . 4  |-  ( ( A  e.  X  /\  B  e.  X  /\  C  e.  X )  ->  ( B ( R  u.  _I  ) C  <-> 
( B R C  \/  B  =  C ) ) )
32adantl 464 . . 3  |-  ( ( R  Po  X  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X
) )  ->  ( B ( R  u.  _I  ) C  <->  ( B R C  \/  B  =  C ) ) )
43anbi2d 702 . 2  |-  ( ( R  Po  X  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X
) )  ->  (
( A R B  /\  B ( R  u.  _I  ) C )  <->  ( A R B  /\  ( B R C  \/  B  =  C ) ) ) )
5 potr 4753 . . . . 5  |-  ( ( R  Po  X  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X
) )  ->  (
( A R B  /\  B R C )  ->  A R C ) )
65com12 29 . . . 4  |-  ( ( A R B  /\  B R C )  -> 
( ( R  Po  X  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X ) )  ->  A R C ) )
7 breq2 4396 . . . . . 6  |-  ( B  =  C  ->  ( A R B  <->  A R C ) )
87biimpac 484 . . . . 5  |-  ( ( A R B  /\  B  =  C )  ->  A R C )
98a1d 25 . . . 4  |-  ( ( A R B  /\  B  =  C )  ->  ( ( R  Po  X  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X ) )  ->  A R C ) )
106, 9jaodan 784 . . 3  |-  ( ( A R B  /\  ( B R C  \/  B  =  C )
)  ->  ( ( R  Po  X  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X
) )  ->  A R C ) )
1110com12 29 . 2  |-  ( ( R  Po  X  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X
) )  ->  (
( A R B  /\  ( B R C  \/  B  =  C ) )  ->  A R C ) )
124, 11sylbid 215 1  |-  ( ( R  Po  X  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X
) )  ->  (
( A R B  /\  B ( R  u.  _I  ) C )  ->  A R C ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    \/ wo 366    /\ wa 367    /\ w3a 972    = wceq 1403    e. wcel 1840    u. cun 3409   class class class wbr 4392    _I cid 4730    Po wpo 4739
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1637  ax-4 1650  ax-5 1723  ax-6 1769  ax-7 1812  ax-9 1844  ax-10 1859  ax-11 1864  ax-12 1876  ax-13 2024  ax-ext 2378  ax-sep 4514  ax-nul 4522  ax-pr 4627
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3an 974  df-tru 1406  df-ex 1632  df-nf 1636  df-sb 1762  df-eu 2240  df-mo 2241  df-clab 2386  df-cleq 2392  df-clel 2395  df-nfc 2550  df-ne 2598  df-ral 2756  df-rex 2757  df-rab 2760  df-v 3058  df-dif 3414  df-un 3416  df-in 3418  df-ss 3425  df-nul 3736  df-if 3883  df-sn 3970  df-pr 3972  df-op 3976  df-br 4393  df-opab 4451  df-id 4735  df-po 4741  df-xp 4946  df-rel 4947
This theorem is referenced by:  soltmin  5343
  Copyright terms: Public domain W3C validator