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

Theorem ltntri 8403
Description: Negative trichotomy property for real numbers. It is well known that we cannot prove real number trichotomy,  A  <  B  \/  A  =  B  \/  B  <  A. Does that mean there is a pair of real numbers where none of those hold (that is, where we can refute each of those three relationships)? Actually, no, as shown here. This is another example of distinguishing between being unable to prove something, or being able to refute it. (Contributed by Jim Kingdon, 13-Aug-2023.)
Assertion
Ref Expression
ltntri  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  -.  ( -.  A  <  B  /\  -.  A  =  B  /\  -.  B  <  A ) )

Proof of Theorem ltntri
StepHypRef Expression
1 simpll 527 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( -.  A  <  B  /\  -.  A  =  B  /\  -.  B  <  A ) )  ->  A  e.  RR )
2 simplr 529 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( -.  A  <  B  /\  -.  A  =  B  /\  -.  B  <  A ) )  ->  B  e.  RR )
3 simpr3 1032 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( -.  A  <  B  /\  -.  A  =  B  /\  -.  B  <  A ) )  ->  -.  B  <  A )
41, 2, 3nltled 8396 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( -.  A  <  B  /\  -.  A  =  B  /\  -.  B  <  A ) )  ->  A  <_  B )
5 simpr1 1030 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( -.  A  <  B  /\  -.  A  =  B  /\  -.  B  <  A ) )  ->  -.  A  <  B )
62, 1, 5nltled 8396 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( -.  A  <  B  /\  -.  A  =  B  /\  -.  B  <  A ) )  ->  B  <_  A )
71, 2letri3d 8391 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( -.  A  <  B  /\  -.  A  =  B  /\  -.  B  <  A ) )  -> 
( A  =  B  <-> 
( A  <_  B  /\  B  <_  A ) ) )
84, 6, 7mpbir2and 953 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( -.  A  <  B  /\  -.  A  =  B  /\  -.  B  <  A ) )  ->  A  =  B )
9 simpr2 1031 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( -.  A  <  B  /\  -.  A  =  B  /\  -.  B  <  A ) )  ->  -.  A  =  B
)
108, 9pm2.65da 667 1  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  -.  ( -.  A  <  B  /\  -.  A  =  B  /\  -.  B  <  A ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    /\ w3a 1005    = wceq 1398    e. wcel 2205   class class class wbr 4111   RRcr 8128    < clt 8310    <_ cle 8311
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-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-cnex 8220  ax-resscn 8221  ax-pre-ltirr 8241  ax-pre-apti 8244
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-br 4112  df-opab 4174  df-xp 4757  df-cnv 4759  df-pnf 8312  df-mnf 8313  df-xr 8314  df-ltxr 8315  df-le 8316
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator