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

Theorem po3nr 4819
Description: A partial order relation has no 3-cycle loops. (Contributed by NM, 27-Mar-1997.)
Assertion
Ref Expression
po3nr

Proof of Theorem po3nr
StepHypRef Expression
1 po2nr 4818 . . 3
213adantr2 1156 . 2
3 df-3an 975 . . 3
4 potr 4817 . . . 4
54anim1d 564 . . 3
63, 5syl5bi 217 . 2
72, 6mtod 177 1
Colors of variables: wff setvar class
Syntax hints:  -.wn 3  ->wi 4  /\wa 369  /\w3a 973  e.wcel 1818   class class class wbr 4452  Powpo 4803
This theorem is referenced by:  so3nr  4830
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1618  ax-4 1631  ax-5 1704  ax-6 1747  ax-7 1790  ax-10 1837  ax-11 1842  ax-12 1854  ax-13 1999  ax-ext 2435
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1398  df-ex 1613  df-nf 1617  df-sb 1740  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ral 2812  df-rab 2816  df-v 3111  df-dif 3478  df-un 3480  df-in 3482  df-ss 3489  df-nul 3785  df-if 3942  df-sn 4030  df-pr 4032  df-op 4036  df-br 4453  df-po 4805
  Copyright terms: Public domain W3C validator