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

Theorem son2lpi 5140
Description: A strict order relation has no 2-cycle loops. (Contributed by NM, 10-Feb-1996.) (Revised by Mario Carneiro, 10-May-2013.)
Hypotheses
Ref Expression
soi.1  |-  R  Or  S
soi.2  |-  R  C_  ( S  X.  S
)
Assertion
Ref Expression
son2lpi  |-  -.  ( A R B  /\  B R A )

Proof of Theorem son2lpi
StepHypRef Expression
1 soi.1 . . 3  |-  R  Or  S
2 soi.2 . . 3  |-  R  C_  ( S  X.  S
)
31, 2soirri 5138 . 2  |-  -.  A R A
41, 2sotri 5139 . 2  |-  ( ( A R B  /\  B R A )  ->  A R A )
53, 4mto 668 1  |-  -.  ( A R B  /\  B R A )
Colors of variables: wff set class
Syntax hints:   -. wn 3    /\ wa 104    C_ wss 3201   class class class wbr 4093    Or wor 4398    X. cxp 4729
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-br 4094  df-opab 4156  df-po 4399  df-iso 4400  df-xp 4737
This theorem is referenced by:  nqprdisj  7807  ltexprlemdisj  7869  recexprlemdisj  7893  caucvgprlemnkj  7929  caucvgprprlemnkltj  7952  caucvgprprlemnkeqj  7953  caucvgprprlemnjltk  7954
  Copyright terms: Public domain W3C validator