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

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

Proof of Theorem so3nr
StepHypRef Expression
1 sopo 4325 . 2  |-  ( R  Or  A  ->  R  Po  A )
2 po3nr 4322 . 2  |-  ( ( R  Po  A  /\  ( B  e.  A  /\  C  e.  A  /\  D  e.  A
) )  ->  -.  ( B R C  /\  C R D  /\  D R B ) )
31, 2sylan 283 1  |-  ( ( R  Or  A  /\  ( B  e.  A  /\  C  e.  A  /\  D  e.  A
) )  ->  -.  ( B R C  /\  C R D  /\  D R B ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    /\ w3a 979    e. wcel 2158   class class class wbr 4015    Po wpo 4306    Or wor 4307
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 615  ax-in2 616  ax-io 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-ext 2169
This theorem depends on definitions:  df-bi 117  df-3an 981  df-tru 1366  df-nf 1471  df-sb 1773  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ral 2470  df-v 2751  df-un 3145  df-sn 3610  df-pr 3611  df-op 3613  df-br 4016  df-po 4308  df-iso 4309
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator