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

Theorem po3nr 5456
Description: A partial order relation has no 3-cycle loops. (Contributed by NM, 27-Mar-1997.)
Assertion
Ref Expression
po3nr ((𝑅 Po 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐷𝐴)) → ¬ (𝐵𝑅𝐶𝐶𝑅𝐷𝐷𝑅𝐵))

Proof of Theorem po3nr
StepHypRef Expression
1 po2nr 5455 . . 3 ((𝑅 Po 𝐴 ∧ (𝐵𝐴𝐷𝐴)) → ¬ (𝐵𝑅𝐷𝐷𝑅𝐵))
213adantr2 1167 . 2 ((𝑅 Po 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐷𝐴)) → ¬ (𝐵𝑅𝐷𝐷𝑅𝐵))
3 df-3an 1086 . . 3 ((𝐵𝑅𝐶𝐶𝑅𝐷𝐷𝑅𝐵) ↔ ((𝐵𝑅𝐶𝐶𝑅𝐷) ∧ 𝐷𝑅𝐵))
4 potr 5454 . . . 4 ((𝑅 Po 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐷𝐴)) → ((𝐵𝑅𝐶𝐶𝑅𝐷) → 𝐵𝑅𝐷))
54anim1d 613 . . 3 ((𝑅 Po 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐷𝐴)) → (((𝐵𝑅𝐶𝐶𝑅𝐷) ∧ 𝐷𝑅𝐵) → (𝐵𝑅𝐷𝐷𝑅𝐵)))
63, 5syl5bi 245 . 2 ((𝑅 Po 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐷𝐴)) → ((𝐵𝑅𝐶𝐶𝑅𝐷𝐷𝑅𝐵) → (𝐵𝑅𝐷𝐷𝑅𝐵)))
72, 6mtod 201 1 ((𝑅 Po 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐷𝐴)) → ¬ (𝐵𝑅𝐶𝐶𝑅𝐷𝐷𝑅𝐵))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 399  w3a 1084  wcel 2112   class class class wbr 5033   Po wpo 5440
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-ral 3114  df-v 3446  df-un 3889  df-sn 4529  df-pr 4531  df-op 4535  df-br 5034  df-po 5442
This theorem is referenced by:  so3nr  5468
  Copyright terms: Public domain W3C validator