HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem son2lpi 2631
Description: A strict order relation has no 2-cycle loops.
Hypotheses
Ref Expression
soi.1 |- A e. V
soi.2 |- R Or S
soi.3 |- R (_ (S X. S)
son2lpi.4 |- B e. V
Assertion
Ref Expression
son2lpi |- -. (ARB /\ BRA)

Proof of Theorem son2lpi
StepHypRef Expression
1 soi.1 . . 3 |- A e. V
2 soi.2 . . 3 |- R Or S
3 soi.3 . . 3 |- R (_ (S X. S)
41, 2, 3soirri 2629 . 2 |- -. ARA
5 son2lpi.4 . . 3 |- B e. V
61, 2, 3, 5, 1sotri 2630 . 2 |- ((ARB /\ BRA) -> ARA)
74, 6mto 93 1 |- -. (ARB /\ BRA)
Colors of variables: wff set class
Syntax hints:  -. wn 1   /\ wa 196   e. wcel 1092  Vcvv 1348   (_ wss 1487   class class class wbr 2054   Or wor 2059   X. cxp 2408
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-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-pow 1077
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-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815  df-br 2063  df-opab 2098  df-po 2128  df-so 2138  df-xp 2424
metamath.org