MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  sotrieq Unicode version

Theorem sotrieq 4341
Description: Trichotomy law for strict order relation. (Contributed by NM, 9-Apr-1996.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
Assertion
Ref Expression
sotrieq  |-  ( ( R  Or  A  /\  ( B  e.  A  /\  C  e.  A
) )  ->  ( B  =  C  <->  -.  ( B R C  \/  C R B ) ) )

Proof of Theorem sotrieq
StepHypRef Expression
1 sonr 4335 . . . . . . 7  |-  ( ( R  Or  A  /\  B  e.  A )  ->  -.  B R B )
21adantrr 697 . . . . . 6  |-  ( ( R  Or  A  /\  ( B  e.  A  /\  C  e.  A
) )  ->  -.  B R B )
3 pm1.2 499 . . . . . 6  |-  ( ( B R B  \/  B R B )  ->  B R B )
42, 3nsyl 113 . . . . 5  |-  ( ( R  Or  A  /\  ( B  e.  A  /\  C  e.  A
) )  ->  -.  ( B R B  \/  B R B ) )
5 breq2 4027 . . . . . . 7  |-  ( B  =  C  ->  ( B R B  <->  B R C ) )
6 breq1 4026 . . . . . . 7  |-  ( B  =  C  ->  ( B R B  <->  C R B ) )
75, 6orbi12d 690 . . . . . 6  |-  ( B  =  C  ->  (
( B R B  \/  B R B )  <->  ( B R C  \/  C R B ) ) )
87notbid 285 . . . . 5  |-  ( B  =  C  ->  ( -.  ( B R B  \/  B R B )  <->  -.  ( B R C  \/  C R B ) ) )
94, 8syl5ibcom 211 . . . 4  |-  ( ( R  Or  A  /\  ( B  e.  A  /\  C  e.  A
) )  ->  ( B  =  C  ->  -.  ( B R C  \/  C R B ) ) )
109con2d 107 . . 3  |-  ( ( R  Or  A  /\  ( B  e.  A  /\  C  e.  A
) )  ->  (
( B R C  \/  C R B )  ->  -.  B  =  C ) )
11 solin 4337 . . . 4  |-  ( ( R  Or  A  /\  ( B  e.  A  /\  C  e.  A
) )  ->  ( B R C  \/  B  =  C  \/  C R B ) )
12 3orass 937 . . . . 5  |-  ( ( B R C  \/  B  =  C  \/  C R B )  <->  ( B R C  \/  ( B  =  C  \/  C R B ) ) )
13 or12 509 . . . . 5  |-  ( ( B R C  \/  ( B  =  C  \/  C R B ) )  <->  ( B  =  C  \/  ( B R C  \/  C R B ) ) )
14 df-or 359 . . . . 5  |-  ( ( B  =  C  \/  ( B R C  \/  C R B ) )  <-> 
( -.  B  =  C  ->  ( B R C  \/  C R B ) ) )
1512, 13, 143bitri 262 . . . 4  |-  ( ( B R C  \/  B  =  C  \/  C R B )  <->  ( -.  B  =  C  ->  ( B R C  \/  C R B ) ) )
1611, 15sylib 188 . . 3  |-  ( ( R  Or  A  /\  ( B  e.  A  /\  C  e.  A
) )  ->  ( -.  B  =  C  ->  ( B R C  \/  C R B ) ) )
1710, 16impbid 183 . 2  |-  ( ( R  Or  A  /\  ( B  e.  A  /\  C  e.  A
) )  ->  (
( B R C  \/  C R B )  <->  -.  B  =  C ) )
1817con2bid 319 1  |-  ( ( R  Or  A  /\  ( B  e.  A  /\  C  e.  A
) )  ->  ( B  =  C  <->  -.  ( B R C  \/  C R B ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 176    \/ wo 357    /\ wa 358    \/ w3o 933    = wceq 1623    e. wcel 1684   class class class wbr 4023    Or wor 4313
This theorem is referenced by:  sotrieq2  4342  sossfld  5120  soisores  5824  soisoi  5825  weniso  5852  wemapso2lem  7265  distrlem4pr  8650  addcanpr  8670  sqgt0sr  8728  lttri2  8904  xrlttri2  10476  xrltne  10494  soseq  24254
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ral 2548  df-rab 2552  df-v 2790  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-op 3649  df-br 4024  df-po 4314  df-so 4315
  Copyright terms: Public domain W3C validator