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

Theorem so3nr 5256
Description: A strict order relation has no 3-cycle loops. (Contributed by NM, 21-Jan-1996.)
Assertion
Ref Expression
so3nr ((𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐷𝐴)) → ¬ (𝐵𝑅𝐶𝐶𝑅𝐷𝐷𝑅𝐵))

Proof of Theorem so3nr
StepHypRef Expression
1 sopo 5248 . 2 (𝑅 Or 𝐴𝑅 Po 𝐴)
2 po3nr 5245 . 2 ((𝑅 Po 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐷𝐴)) → ¬ (𝐵𝑅𝐶𝐶𝑅𝐷𝐷𝑅𝐵))
31, 2sylan 576 1 ((𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐷𝐴)) → ¬ (𝐵𝑅𝐶𝐶𝑅𝐷𝐷𝑅𝐵))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 385  w3a 1108  wcel 2157   class class class wbr 4841   Po wpo 5229   Or wor 5230
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-9 2166  ax-10 2185  ax-11 2200  ax-12 2213  ax-13 2375  ax-ext 2775
This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-3an 1110  df-tru 1657  df-ex 1876  df-nf 1880  df-sb 2065  df-clab 2784  df-cleq 2790  df-clel 2793  df-nfc 2928  df-ral 3092  df-rab 3096  df-v 3385  df-dif 3770  df-un 3772  df-in 3774  df-ss 3781  df-nul 4114  df-if 4276  df-sn 4367  df-pr 4369  df-op 4373  df-br 4842  df-po 5231  df-so 5232
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator