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

Theorem son2lpi 3444
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 3442 . 2 |- -. ARA
5 son2lpi.4 . . 3 |- B e. V
61, 2, 3, 5, 1sotri 3443 . 2 |- ((ARB /\ BRA) -> ARA)
74, 6mto 106 1 |- -. (ARB /\ BRA)
Colors of variables: wff set class
Syntax hints:  -. wn 2   /\ wa 223   e. wcel 958  Vcvv 1811   (_ wss 2047   class class class wbr 2619   Or wor 2839   X. cxp 3168
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-pow 2742  ax-pr 2779
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3an 777  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-ral 1649  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-op 2416  df-br 2620  df-opab 2667  df-po 2840  df-so 2850  df-xp 3184
Copyright terms: Public domain