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

Theorem gt0add 7564
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 906 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  0  <  ( A  +  B
) )  ->  0  <  ( A  +  B
) )
2 0red 7028 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  0  <  ( A  +  B
) )  ->  0  e.  RR )
3 simp1 904 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  0  <  ( A  +  B
) )  ->  A  e.  RR )
4 simp2 905 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  0  <  ( A  +  B
) )  ->  B  e.  RR )
53, 4readdcld 7055 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  0  <  ( A  +  B
) )  ->  ( A  +  B )  e.  RR )
6 axltwlin 7087 . . . 4  |-  ( ( 0  e.  RR  /\  ( A  +  B
)  e.  RR  /\  A  e.  RR )  ->  ( 0  <  ( A  +  B )  ->  ( 0  <  A  \/  A  <  ( A  +  B ) ) ) )
72, 5, 3, 6syl3anc 1135 . . 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 7520 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  0  <  ( A  +  B
) )  ->  (
0  <  B  <->  A  <  ( A  +  B ) ) )
109orbi2d 704 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  0  <  ( A  +  B
) )  ->  (
( 0  <  A  \/  0  <  B )  <-> 
( 0  <  A  \/  A  <  ( A  +  B ) ) ) )
118, 10mpbird 156 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 629    /\ w3a 885    e. wcel 1393   class class class wbr 3764  (class class class)co 5512   RRcr 6888   0cc0 6889    + caddc 6892    < clt 7060
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944  ax-un 4170  ax-setind 4262  ax-cnex 6975  ax-resscn 6976  ax-1cn 6977  ax-1re 6978  ax-icn 6979  ax-addcl 6980  ax-addrcl 6981  ax-mulcl 6982  ax-addcom 6984  ax-addass 6986  ax-i2m1 6989  ax-0id 6992  ax-rnegex 6993  ax-pre-ltwlin 6997  ax-pre-ltadd 7000
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-fal 1249  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ne 2206  df-nel 2207  df-ral 2311  df-rex 2312  df-rab 2315  df-v 2559  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-opab 3819  df-xp 4351  df-iota 4867  df-fv 4910  df-ov 5515  df-pnf 7062  df-mnf 7063  df-ltxr 7065
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator