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

Theorem so2nr 4556
Description: A strict order relation has no 2-cycle loops. (Contributed by NM, 21-Jan-1996.)
Assertion
Ref Expression
so2nr  |-  ( ( R  Or  A  /\  ( B  e.  A  /\  C  e.  A
) )  ->  -.  ( B R C  /\  C R B ) )

Proof of Theorem so2nr
StepHypRef Expression
1 sopo 4549 . 2  |-  ( R  Or  A  ->  R  Po  A )
2 po2nr 4545 . 2  |-  ( ( R  Po  A  /\  ( B  e.  A  /\  C  e.  A
) )  ->  -.  ( B R C  /\  C R B ) )
31, 2sylan 459 1  |-  ( ( R  Or  A  /\  ( B  e.  A  /\  C  e.  A
) )  ->  -.  ( B R C  /\  C R B ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 360    e. wcel 1727   class class class wbr 4237    Po wpo 4530    Or wor 4531
This theorem is referenced by:  sotric  4558  somincom  5300  fisupg  7384  suppr  7502  genpnnp  8913  ltnsym2  9204
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1668  ax-8 1689  ax-6 1746  ax-7 1751  ax-11 1763  ax-12 1953  ax-ext 2423
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-clab 2429  df-cleq 2435  df-clel 2438  df-nfc 2567  df-ral 2716  df-rab 2720  df-v 2964  df-dif 3309  df-un 3311  df-in 3313  df-ss 3320  df-nul 3614  df-if 3764  df-sn 3844  df-pr 3845  df-op 3847  df-br 4238  df-po 4532  df-so 4533
  Copyright terms: Public domain W3C validator