Theorem so3nr 4160

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

Step	Hyp	Ref	Expression
1		sopo 4151	. 2 |- ( R Or A -> R Po A )
2		po3nr 4148	. 2 |- ( ( R Po A /\ ( B e. A /\ C e. A /\ D e. A ) ) -> -. ( B R C /\ C R D /\ D R B ) )
3	1, 2	sylan 278	1 |- ( ( R Or A /\ ( B e. A /\ C e. A /\ D e. A ) ) -> -. ( B R C /\ C R D /\ D R B ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 103   /\ w3a 925   e. wcel 1439   class class class wbr 3853   Po wpo 4132   Or wor 4133

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 580  ax-in2 581  ax-io 666  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-8 1441  ax-10 1442  ax-11 1443  ax-i12 1444  ax-bndl 1445  ax-4 1446  ax-17 1465  ax-i9 1469  ax-ial 1473  ax-i5r 1474  ax-ext 2071

This theorem depends on definitions:  df-bi 116  df-3an 927  df-tru 1293  df-nf 1396  df-sb 1694  df-clab 2076  df-cleq 2082  df-clel 2085  df-nfc 2218  df-ral 2365  df-v 2624  df-un 3006  df-sn 3458  df-pr 3459  df-op 3461  df-br 3854  df-po 4134  df-iso 4135

This theorem is referenced by: (None)