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

Theorem son2lpi 3436
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 3434 . 2 |- -. ARA
5 son2lpi.4 . . 3 |- B e. V
61, 2, 3, 5, 1sotri 3435 . 2 |- ((ARB /\ BRA) -> ARA)
74, 6mto 106 1 |- -. (ARB /\ BRA)
Colors of variables: wff set class
Syntax hints:  -. wn 2   /\ wa 223   e. wcel 956  Vcvv 1807   (_ wss 2043   class class class wbr 2614   Or wor 2834   X. cxp 3163
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-10 964  ax-11 965  ax-12 966  ax-13 967  ax-14 968  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216  ax-ext 1457  ax-sep 2698  ax-pow 2737  ax-pr 2774
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3an 776  df-ex 979  df-sb 1170  df-eu 1380  df-mo 1381  df-clab 1462  df-cleq 1467  df-clel 1470  df-ne 1584  df-ral 1646  df-v 1808  df-dif 2045  df-un 2046  df-in 2047  df-ss 2049  df-nul 2277  df-pw 2398  df-sn 2408  df-pr 2409  df-op 2412  df-br 2615  df-opab 2662  df-po 2835  df-so 2845  df-xp 3179
Copyright terms: Public domain