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

Theorem so3nr 4351
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 4342 . 2 (𝑅 Or 𝐴𝑅 Po 𝐴)
2 po3nr 4339 . 2 ((𝑅 Po 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐷𝐴)) → ¬ (𝐵𝑅𝐶𝐶𝑅𝐷𝐷𝑅𝐵))
31, 2sylan 283 1 ((𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐷𝐴)) → ¬ (𝐵𝑅𝐶𝐶𝑅𝐷𝐷𝑅𝐵))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  w3a 980  wcel 2164   class class class wbr 4029   Po wpo 4323   Or wor 4324
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-v 2762  df-un 3157  df-sn 3624  df-pr 3625  df-op 3627  df-br 4030  df-po 4325  df-iso 4326
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator