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

Theorem sotritrieq 4373
Description: A trichotomy relationship, given a trichotomous order. (Contributed by Jim Kingdon, 13-Dec-2019.)
Hypotheses
Ref Expression
sotritric.or  |-  R  Or  A
sotritric.tri  |-  ( ( B  e.  A  /\  C  e.  A )  ->  ( B R C  \/  B  =  C  \/  C R B ) )
Assertion
Ref Expression
sotritrieq  |-  ( ( B  e.  A  /\  C  e.  A )  ->  ( B  =  C  <->  -.  ( B R C  \/  C R B ) ) )

Proof of Theorem sotritrieq
StepHypRef Expression
1 sotritric.or . . . . . . 7  |-  R  Or  A
2 sonr 4365 . . . . . . 7  |-  ( ( R  Or  A  /\  B  e.  A )  ->  -.  B R B )
31, 2mpan 424 . . . . . 6  |-  ( B  e.  A  ->  -.  B R B )
4 breq2 4049 . . . . . . 7  |-  ( B  =  C  ->  ( B R B  <->  B R C ) )
54notbid 669 . . . . . 6  |-  ( B  =  C  ->  ( -.  B R B  <->  -.  B R C ) )
63, 5syl5ibcom 155 . . . . 5  |-  ( B  e.  A  ->  ( B  =  C  ->  -.  B R C ) )
7 breq1 4048 . . . . . . 7  |-  ( B  =  C  ->  ( B R B  <->  C R B ) )
87notbid 669 . . . . . 6  |-  ( B  =  C  ->  ( -.  B R B  <->  -.  C R B ) )
93, 8syl5ibcom 155 . . . . 5  |-  ( B  e.  A  ->  ( B  =  C  ->  -.  C R B ) )
106, 9jcad 307 . . . 4  |-  ( B  e.  A  ->  ( B  =  C  ->  ( -.  B R C  /\  -.  C R B ) ) )
11 ioran 754 . . . 4  |-  ( -.  ( B R C  \/  C R B )  <->  ( -.  B R C  /\  -.  C R B ) )
1210, 11imbitrrdi 162 . . 3  |-  ( B  e.  A  ->  ( B  =  C  ->  -.  ( B R C  \/  C R B ) ) )
1312adantr 276 . 2  |-  ( ( B  e.  A  /\  C  e.  A )  ->  ( B  =  C  ->  -.  ( B R C  \/  C R B ) ) )
14 sotritric.tri . . 3  |-  ( ( B  e.  A  /\  C  e.  A )  ->  ( B R C  \/  B  =  C  \/  C R B ) )
15 3orrot 987 . . . . . . 7  |-  ( ( B R C  \/  B  =  C  \/  C R B )  <->  ( B  =  C  \/  C R B  \/  B R C ) )
16 3orcomb 990 . . . . . . 7  |-  ( ( B  =  C  \/  C R B  \/  B R C )  <->  ( B  =  C  \/  B R C  \/  C R B ) )
17 3orass 984 . . . . . . 7  |-  ( ( B  =  C  \/  B R C  \/  C R B )  <->  ( B  =  C  \/  ( B R C  \/  C R B ) ) )
1815, 16, 173bitri 206 . . . . . 6  |-  ( ( B R C  \/  B  =  C  \/  C R B )  <->  ( B  =  C  \/  ( B R C  \/  C R B ) ) )
1918biimpi 120 . . . . 5  |-  ( ( B R C  \/  B  =  C  \/  C R B )  -> 
( B  =  C  \/  ( B R C  \/  C R B ) ) )
2019orcomd 731 . . . 4  |-  ( ( B R C  \/  B  =  C  \/  C R B )  -> 
( ( B R C  \/  C R B )  \/  B  =  C ) )
2120ord 726 . . 3  |-  ( ( B R C  \/  B  =  C  \/  C R B )  -> 
( -.  ( B R C  \/  C R B )  ->  B  =  C ) )
2214, 21syl 14 . 2  |-  ( ( B  e.  A  /\  C  e.  A )  ->  ( -.  ( B R C  \/  C R B )  ->  B  =  C ) )
2313, 22impbid 129 1  |-  ( ( 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    /\ wa 104    <-> wb 105    \/ wo 710    \/ w3o 980    = wceq 1373    e. wcel 2176   class class class wbr 4045    Or wor 4343
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 615  ax-in2 616  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-ext 2187
This theorem depends on definitions:  df-bi 117  df-3or 982  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-v 2774  df-un 3170  df-sn 3639  df-pr 3640  df-op 3642  df-br 4046  df-po 4344  df-iso 4345
This theorem is referenced by:  distrlem4prl  7699  distrlem4pru  7700
  Copyright terms: Public domain W3C validator