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

Theorem gt0add 8462
Description: A positive sum must have a positive addend. Part of Definition 11.2.7(vi) of [HoTT], p. (varies). (Contributed by Jim Kingdon, 26-Jan-2020.)
Assertion
Ref Expression
gt0add  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  0  <  ( A  +  B
) )  ->  (
0  <  A  \/  0  <  B ) )

Proof of Theorem gt0add
StepHypRef Expression
1 simp3 988 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  0  <  ( A  +  B
) )  ->  0  <  ( A  +  B
) )
2 0red 7891 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  0  <  ( A  +  B
) )  ->  0  e.  RR )
3 simp1 986 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  0  <  ( A  +  B
) )  ->  A  e.  RR )
4 simp2 987 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  0  <  ( A  +  B
) )  ->  B  e.  RR )
53, 4readdcld 7919 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  0  <  ( A  +  B
) )  ->  ( A  +  B )  e.  RR )
6 axltwlin 7957 . . . 4  |-  ( ( 0  e.  RR  /\  ( A  +  B
)  e.  RR  /\  A  e.  RR )  ->  ( 0  <  ( A  +  B )  ->  ( 0  <  A  \/  A  <  ( A  +  B ) ) ) )
72, 5, 3, 6syl3anc 1227 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  0  <  ( A  +  B
) )  ->  (
0  <  ( A  +  B )  ->  (
0  <  A  \/  A  <  ( A  +  B ) ) ) )
81, 7mpd 13 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  0  <  ( A  +  B
) )  ->  (
0  <  A  \/  A  <  ( A  +  B ) ) )
94, 3ltaddposd 8418 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  0  <  ( A  +  B
) )  ->  (
0  <  B  <->  A  <  ( A  +  B ) ) )
109orbi2d 780 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  0  <  ( A  +  B
) )  ->  (
( 0  <  A  \/  0  <  B )  <-> 
( 0  <  A  \/  A  <  ( A  +  B ) ) ) )
118, 10mpbird 166 1  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  0  <  ( A  +  B
) )  ->  (
0  <  A  \/  0  <  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    \/ wo 698    /\ w3a 967    e. wcel 2135   class class class wbr 3976  (class class class)co 5836   RRcr 7743   0cc0 7744    + caddc 7747    < clt 7924
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-13 2137  ax-14 2138  ax-ext 2146  ax-sep 4094  ax-pow 4147  ax-pr 4181  ax-un 4405  ax-setind 4508  ax-cnex 7835  ax-resscn 7836  ax-1cn 7837  ax-1re 7838  ax-icn 7839  ax-addcl 7840  ax-addrcl 7841  ax-mulcl 7842  ax-addcom 7844  ax-addass 7846  ax-i2m1 7849  ax-0id 7852  ax-rnegex 7853  ax-pre-ltwlin 7857  ax-pre-ltadd 7860
This theorem depends on definitions:  df-bi 116  df-3an 969  df-tru 1345  df-fal 1348  df-nf 1448  df-sb 1750  df-eu 2016  df-mo 2017  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-ne 2335  df-nel 2430  df-ral 2447  df-rex 2448  df-rab 2451  df-v 2723  df-dif 3113  df-un 3115  df-in 3117  df-ss 3124  df-pw 3555  df-sn 3576  df-pr 3577  df-op 3579  df-uni 3784  df-br 3977  df-opab 4038  df-xp 4604  df-iota 5147  df-fv 5190  df-ov 5839  df-pnf 7926  df-mnf 7927  df-ltxr 7929
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator