Theorem so3nr 2147

Description: A strict order relation has no 3-cycle loops.

Assertion

Ref	Expression
so3nr	|- ((R Or A /\ (B e. A /\ C e. A /\ D e. A)) -> -. (BRC /\ CRD /\ DRB))

Proof of Theorem so3nr

Step	Hyp	Ref	Expression
1		po3nr 2136	. 2 |- ((R Po A /\ (B e. A /\ C e. A /\ D e. A)) -> -. (BRC /\ CRD /\ DRB))
2		sopo 2139	. 2 |- (R Or A -> R Po A)
3	1, 2	sylan 343	1 |- ((R Or A /\ (B e. A /\ C e. A /\ D e. A)) -> -. (BRC /\ CRD /\ DRB))

Syntax hints:  -. wn 1   -> wi 2   /\ wa 196   /\ w3a 581   e. wcel 1092   class class class wbr 2054   Po wpo 2058   Or wor 2059

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074

This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3an 583  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-v 1349  df-un 1490  df-sn 1811  df-pr 1812  df-op 1815  df-br 2063  df-po 2128  df-so 2138

metamath.org