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

Theorem ltaddpr 7552
Description: The sum of two positive reals is greater than one of them. Proposition 9-3.5(iii) of [Gleason] p. 123. (Contributed by NM, 26-Mar-1996.) (Revised by Mario Carneiro, 12-Jun-2013.)
Assertion
Ref Expression
ltaddpr  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  A  <P  ( A  +P.  B ) )

Proof of Theorem ltaddpr
Dummy variables  f  g  h  x  y  p  q  r are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prop 7430 . . . 4  |-  ( B  e.  P.  ->  <. ( 1st `  B ) ,  ( 2nd `  B
) >.  e.  P. )
2 prml 7432 . . . 4  |-  ( <.
( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  ->  E. p  e.  Q.  p  e.  ( 1st `  B ) )
31, 2syl 14 . . 3  |-  ( B  e.  P.  ->  E. p  e.  Q.  p  e.  ( 1st `  B ) )
43adantl 275 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  E. p  e.  Q.  p  e.  ( 1st `  B ) )
5 prop 7430 . . . . 5  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )
6 prarloc 7458 . . . . 5  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  p  e.  Q. )  ->  E. r  e.  ( 1st `  A ) E. q  e.  ( 2nd `  A ) q  <Q  ( r  +Q  p ) )
75, 6sylan 281 . . . 4  |-  ( ( A  e.  P.  /\  p  e.  Q. )  ->  E. r  e.  ( 1st `  A ) E. q  e.  ( 2nd `  A ) q  <Q  ( r  +Q  p ) )
87ad2ant2r 506 . . 3  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( p  e.  Q.  /\  p  e.  ( 1st `  B ) ) )  ->  E. r  e.  ( 1st `  A ) E. q  e.  ( 2nd `  A ) q  <Q  ( r  +Q  p ) )
9 elprnqu 7437 . . . . . . . . . . 11  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  q  e.  ( 2nd `  A ) )  -> 
q  e.  Q. )
105, 9sylan 281 . . . . . . . . . 10  |-  ( ( A  e.  P.  /\  q  e.  ( 2nd `  A ) )  -> 
q  e.  Q. )
1110adantlr 474 . . . . . . . . 9  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  q  e.  ( 2nd `  A ) )  ->  q  e.  Q. )
1211ad2ant2rl 508 . . . . . . . 8  |-  ( ( ( ( A  e. 
P.  /\  B  e.  P. )  /\  (
p  e.  Q.  /\  p  e.  ( 1st `  B ) ) )  /\  ( r  e.  ( 1st `  A
)  /\  q  e.  ( 2nd `  A ) ) )  ->  q  e.  Q. )
1312adantr 274 . . . . . . 7  |-  ( ( ( ( ( A  e.  P.  /\  B  e.  P. )  /\  (
p  e.  Q.  /\  p  e.  ( 1st `  B ) ) )  /\  ( r  e.  ( 1st `  A
)  /\  q  e.  ( 2nd `  A ) ) )  /\  q  <Q  ( r  +Q  p
) )  ->  q  e.  Q. )
14 simplrr 531 . . . . . . 7  |-  ( ( ( ( ( A  e.  P.  /\  B  e.  P. )  /\  (
p  e.  Q.  /\  p  e.  ( 1st `  B ) ) )  /\  ( r  e.  ( 1st `  A
)  /\  q  e.  ( 2nd `  A ) ) )  /\  q  <Q  ( r  +Q  p
) )  ->  q  e.  ( 2nd `  A
) )
15 simprl 526 . . . . . . . . . . . . 13  |-  ( ( ( p  e.  Q.  /\  p  e.  ( 1st `  B ) )  /\  ( r  e.  ( 1st `  A )  /\  q  e.  ( 2nd `  A ) ) )  ->  r  e.  ( 1st `  A
) )
16 simplr 525 . . . . . . . . . . . . 13  |-  ( ( ( p  e.  Q.  /\  p  e.  ( 1st `  B ) )  /\  ( r  e.  ( 1st `  A )  /\  q  e.  ( 2nd `  A ) ) )  ->  p  e.  ( 1st `  B
) )
1715, 16jca 304 . . . . . . . . . . . 12  |-  ( ( ( p  e.  Q.  /\  p  e.  ( 1st `  B ) )  /\  ( r  e.  ( 1st `  A )  /\  q  e.  ( 2nd `  A ) ) )  ->  (
r  e.  ( 1st `  A )  /\  p  e.  ( 1st `  B
) ) )
18 df-iplp 7423 . . . . . . . . . . . . 13  |-  +P.  =  ( x  e.  P. ,  y  e.  P.  |->  <. { f  e.  Q.  |  E. g  e.  Q.  E. h  e.  Q.  (
g  e.  ( 1st `  x )  /\  h  e.  ( 1st `  y
)  /\  f  =  ( g  +Q  h
) ) } ,  { f  e.  Q.  |  E. g  e.  Q.  E. h  e.  Q.  (
g  e.  ( 2nd `  x )  /\  h  e.  ( 2nd `  y
)  /\  f  =  ( g  +Q  h
) ) } >. )
19 addclnq 7330 . . . . . . . . . . . . 13  |-  ( ( g  e.  Q.  /\  h  e.  Q. )  ->  ( g  +Q  h
)  e.  Q. )
2018, 19genpprecll 7469 . . . . . . . . . . . 12  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( ( r  e.  ( 1st `  A
)  /\  p  e.  ( 1st `  B ) )  ->  ( r  +Q  p )  e.  ( 1st `  ( A  +P.  B ) ) ) )
2117, 20syl5 32 . . . . . . . . . . 11  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( ( ( p  e.  Q.  /\  p  e.  ( 1st `  B
) )  /\  (
r  e.  ( 1st `  A )  /\  q  e.  ( 2nd `  A
) ) )  -> 
( r  +Q  p
)  e.  ( 1st `  ( A  +P.  B
) ) ) )
2221imdistani 443 . . . . . . . . . 10  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( ( p  e. 
Q.  /\  p  e.  ( 1st `  B ) )  /\  ( r  e.  ( 1st `  A
)  /\  q  e.  ( 2nd `  A ) ) ) )  -> 
( ( A  e. 
P.  /\  B  e.  P. )  /\  (
r  +Q  p )  e.  ( 1st `  ( A  +P.  B ) ) ) )
23 addclpr 7492 . . . . . . . . . . 11  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A  +P.  B
)  e.  P. )
24 prop 7430 . . . . . . . . . . . 12  |-  ( ( A  +P.  B )  e.  P.  ->  <. ( 1st `  ( A  +P.  B ) ) ,  ( 2nd `  ( A  +P.  B ) )
>.  e.  P. )
25 prcdnql 7439 . . . . . . . . . . . 12  |-  ( (
<. ( 1st `  ( A  +P.  B ) ) ,  ( 2nd `  ( A  +P.  B ) )
>.  e.  P.  /\  (
r  +Q  p )  e.  ( 1st `  ( A  +P.  B ) ) )  ->  ( q  <Q  ( r  +Q  p
)  ->  q  e.  ( 1st `  ( A  +P.  B ) ) ) )
2624, 25sylan 281 . . . . . . . . . . 11  |-  ( ( ( A  +P.  B
)  e.  P.  /\  ( r  +Q  p
)  e.  ( 1st `  ( A  +P.  B
) ) )  -> 
( q  <Q  (
r  +Q  p )  ->  q  e.  ( 1st `  ( A  +P.  B ) ) ) )
2723, 26sylan 281 . . . . . . . . . 10  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( r  +Q  p
)  e.  ( 1st `  ( A  +P.  B
) ) )  -> 
( q  <Q  (
r  +Q  p )  ->  q  e.  ( 1st `  ( A  +P.  B ) ) ) )
2822, 27syl 14 . . . . . . . . 9  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( ( p  e. 
Q.  /\  p  e.  ( 1st `  B ) )  /\  ( r  e.  ( 1st `  A
)  /\  q  e.  ( 2nd `  A ) ) ) )  -> 
( q  <Q  (
r  +Q  p )  ->  q  e.  ( 1st `  ( A  +P.  B ) ) ) )
2928anassrs 398 . . . . . . . 8  |-  ( ( ( ( A  e. 
P.  /\  B  e.  P. )  /\  (
p  e.  Q.  /\  p  e.  ( 1st `  B ) ) )  /\  ( r  e.  ( 1st `  A
)  /\  q  e.  ( 2nd `  A ) ) )  ->  (
q  <Q  ( r  +Q  p )  ->  q  e.  ( 1st `  ( A  +P.  B ) ) ) )
3029imp 123 . . . . . . 7  |-  ( ( ( ( ( A  e.  P.  /\  B  e.  P. )  /\  (
p  e.  Q.  /\  p  e.  ( 1st `  B ) ) )  /\  ( r  e.  ( 1st `  A
)  /\  q  e.  ( 2nd `  A ) ) )  /\  q  <Q  ( r  +Q  p
) )  ->  q  e.  ( 1st `  ( A  +P.  B ) ) )
31 rspe 2519 . . . . . . 7  |-  ( ( q  e.  Q.  /\  ( q  e.  ( 2nd `  A )  /\  q  e.  ( 1st `  ( A  +P.  B ) ) ) )  ->  E. q  e.  Q.  ( q  e.  ( 2nd `  A
)  /\  q  e.  ( 1st `  ( A  +P.  B ) ) ) )
3213, 14, 30, 31syl12anc 1231 . . . . . 6  |-  ( ( ( ( ( A  e.  P.  /\  B  e.  P. )  /\  (
p  e.  Q.  /\  p  e.  ( 1st `  B ) ) )  /\  ( r  e.  ( 1st `  A
)  /\  q  e.  ( 2nd `  A ) ) )  /\  q  <Q  ( r  +Q  p
) )  ->  E. q  e.  Q.  ( q  e.  ( 2nd `  A
)  /\  q  e.  ( 1st `  ( A  +P.  B ) ) ) )
33 ltdfpr 7461 . . . . . . . 8  |-  ( ( A  e.  P.  /\  ( A  +P.  B )  e.  P. )  -> 
( A  <P  ( A  +P.  B )  <->  E. q  e.  Q.  ( q  e.  ( 2nd `  A
)  /\  q  e.  ( 1st `  ( A  +P.  B ) ) ) ) )
3423, 33syldan 280 . . . . . . 7  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A  <P  ( A  +P.  B )  <->  E. q  e.  Q.  ( q  e.  ( 2nd `  A
)  /\  q  e.  ( 1st `  ( A  +P.  B ) ) ) ) )
3534ad3antrrr 489 . . . . . 6  |-  ( ( ( ( ( A  e.  P.  /\  B  e.  P. )  /\  (
p  e.  Q.  /\  p  e.  ( 1st `  B ) ) )  /\  ( r  e.  ( 1st `  A
)  /\  q  e.  ( 2nd `  A ) ) )  /\  q  <Q  ( r  +Q  p
) )  ->  ( A  <P  ( A  +P.  B )  <->  E. q  e.  Q.  ( q  e.  ( 2nd `  A )  /\  q  e.  ( 1st `  ( A  +P.  B ) ) ) ) )
3632, 35mpbird 166 . . . . 5  |-  ( ( ( ( ( A  e.  P.  /\  B  e.  P. )  /\  (
p  e.  Q.  /\  p  e.  ( 1st `  B ) ) )  /\  ( r  e.  ( 1st `  A
)  /\  q  e.  ( 2nd `  A ) ) )  /\  q  <Q  ( r  +Q  p
) )  ->  A  <P  ( A  +P.  B
) )
3736ex 114 . . . 4  |-  ( ( ( ( A  e. 
P.  /\  B  e.  P. )  /\  (
p  e.  Q.  /\  p  e.  ( 1st `  B ) ) )  /\  ( r  e.  ( 1st `  A
)  /\  q  e.  ( 2nd `  A ) ) )  ->  (
q  <Q  ( r  +Q  p )  ->  A  <P  ( A  +P.  B
) ) )
3837rexlimdvva 2595 . . 3  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( p  e.  Q.  /\  p  e.  ( 1st `  B ) ) )  ->  ( E. r  e.  ( 1st `  A
) E. q  e.  ( 2nd `  A
) q  <Q  (
r  +Q  p )  ->  A  <P  ( A  +P.  B ) ) )
398, 38mpd 13 . 2  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( p  e.  Q.  /\  p  e.  ( 1st `  B ) ) )  ->  A  <P  ( A  +P.  B ) )
404, 39rexlimddv 2592 1  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  A  <P  ( A  +P.  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    e. wcel 2141   E.wrex 2449   <.cop 3584   class class class wbr 3987   ` cfv 5196  (class class class)co 5851   1stc1st 6115   2ndc2nd 6116   Q.cnq 7235    +Q cplq 7237    <Q cltq 7240   P.cnp 7246    +P. cpp 7248    <P cltp 7250
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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4102  ax-sep 4105  ax-nul 4113  ax-pow 4158  ax-pr 4192  ax-un 4416  ax-setind 4519  ax-iinf 4570
This theorem depends on definitions:  df-bi 116  df-dc 830  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-ral 2453  df-rex 2454  df-reu 2455  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-pw 3566  df-sn 3587  df-pr 3588  df-op 3590  df-uni 3795  df-int 3830  df-iun 3873  df-br 3988  df-opab 4049  df-mpt 4050  df-tr 4086  df-eprel 4272  df-id 4276  df-po 4279  df-iso 4280  df-iord 4349  df-on 4351  df-suc 4354  df-iom 4573  df-xp 4615  df-rel 4616  df-cnv 4617  df-co 4618  df-dm 4619  df-rn 4620  df-res 4621  df-ima 4622  df-iota 5158  df-fun 5198  df-fn 5199  df-f 5200  df-f1 5201  df-fo 5202  df-f1o 5203  df-fv 5204  df-ov 5854  df-oprab 5855  df-mpo 5856  df-1st 6117  df-2nd 6118  df-recs 6282  df-irdg 6347  df-1o 6393  df-2o 6394  df-oadd 6397  df-omul 6398  df-er 6511  df-ec 6513  df-qs 6517  df-ni 7259  df-pli 7260  df-mi 7261  df-lti 7262  df-plpq 7299  df-mpq 7300  df-enq 7302  df-nqqs 7303  df-plqqs 7304  df-mqqs 7305  df-1nqqs 7306  df-rq 7307  df-ltnqqs 7308  df-enq0 7379  df-nq0 7380  df-0nq0 7381  df-plq0 7382  df-mq0 7383  df-inp 7421  df-iplp 7423  df-iltp 7425
This theorem is referenced by:  ltexprlemrl  7565  ltaprlem  7573  ltaprg  7574  prplnqu  7575  ltmprr  7597  caucvgprprlemnkltj  7644  caucvgprprlemnkeqj  7645  caucvgprprlemnbj  7648  0lt1sr  7720  recexgt0sr  7728  mulgt0sr  7733  archsr  7737  prsrpos  7740  mappsrprg  7759  pitoregt0  7804
  Copyright terms: Public domain W3C validator