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

Theorem ltaddpr 7598
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 7476 . . . 4  |-  ( B  e.  P.  ->  <. ( 1st `  B ) ,  ( 2nd `  B
) >.  e.  P. )
2 prml 7478 . . . 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 277 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  E. p  e.  Q.  p  e.  ( 1st `  B ) )
5 prop 7476 . . . . 5  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )
6 prarloc 7504 . . . . 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 283 . . . 4  |-  ( ( A  e.  P.  /\  p  e.  Q. )  ->  E. r  e.  ( 1st `  A ) E. q  e.  ( 2nd `  A ) q  <Q  ( r  +Q  p ) )
87ad2ant2r 509 . . 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 7483 . . . . . . . . . . 11  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  q  e.  ( 2nd `  A ) )  -> 
q  e.  Q. )
105, 9sylan 283 . . . . . . . . . 10  |-  ( ( A  e.  P.  /\  q  e.  ( 2nd `  A ) )  -> 
q  e.  Q. )
1110adantlr 477 . . . . . . . . 9  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  q  e.  ( 2nd `  A ) )  ->  q  e.  Q. )
1211ad2ant2rl 511 . . . . . . . 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 276 . . . . . . 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 536 . . . . . . 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 529 . . . . . . . . . . . . 13  |-  ( ( ( p  e.  Q.  /\  p  e.  ( 1st `  B ) )  /\  ( r  e.  ( 1st `  A )  /\  q  e.  ( 2nd `  A ) ) )  ->  r  e.  ( 1st `  A
) )
16 simplr 528 . . . . . . . . . . . . 13  |-  ( ( ( p  e.  Q.  /\  p  e.  ( 1st `  B ) )  /\  ( r  e.  ( 1st `  A )  /\  q  e.  ( 2nd `  A ) ) )  ->  p  e.  ( 1st `  B
) )
1715, 16jca 306 . . . . . . . . . . . 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 7469 . . . . . . . . . . . . 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 7376 . . . . . . . . . . . . 13  |-  ( ( g  e.  Q.  /\  h  e.  Q. )  ->  ( g  +Q  h
)  e.  Q. )
2018, 19genpprecll 7515 . . . . . . . . . . . 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 445 . . . . . . . . . 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 7538 . . . . . . . . . . 11  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A  +P.  B
)  e.  P. )
24 prop 7476 . . . . . . . . . . . 12  |-  ( ( A  +P.  B )  e.  P.  ->  <. ( 1st `  ( A  +P.  B ) ) ,  ( 2nd `  ( A  +P.  B ) )
>.  e.  P. )
25 prcdnql 7485 . . . . . . . . . . . 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 283 . . . . . . . . . . 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 283 . . . . . . . . . 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 400 . . . . . . . 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 124 . . . . . . 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 2526 . . . . . . 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 1236 . . . . . 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 7507 . . . . . . . 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 282 . . . . . . 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 492 . . . . . 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 167 . . . . 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 115 . . . 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 2602 . . 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 2599 1  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  A  <P  ( A  +P.  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    e. wcel 2148   E.wrex 2456   <.cop 3597   class class class wbr 4005   ` cfv 5218  (class class class)co 5877   1stc1st 6141   2ndc2nd 6142   Q.cnq 7281    +Q cplq 7283    <Q cltq 7286   P.cnp 7292    +P. cpp 7294    <P cltp 7296
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4120  ax-sep 4123  ax-nul 4131  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-iinf 4589
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-tr 4104  df-eprel 4291  df-id 4295  df-po 4298  df-iso 4299  df-iord 4368  df-on 4370  df-suc 4373  df-iom 4592  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-ov 5880  df-oprab 5881  df-mpo 5882  df-1st 6143  df-2nd 6144  df-recs 6308  df-irdg 6373  df-1o 6419  df-2o 6420  df-oadd 6423  df-omul 6424  df-er 6537  df-ec 6539  df-qs 6543  df-ni 7305  df-pli 7306  df-mi 7307  df-lti 7308  df-plpq 7345  df-mpq 7346  df-enq 7348  df-nqqs 7349  df-plqqs 7350  df-mqqs 7351  df-1nqqs 7352  df-rq 7353  df-ltnqqs 7354  df-enq0 7425  df-nq0 7426  df-0nq0 7427  df-plq0 7428  df-mq0 7429  df-inp 7467  df-iplp 7469  df-iltp 7471
This theorem is referenced by:  ltexprlemrl  7611  ltaprlem  7619  ltaprg  7620  prplnqu  7621  ltmprr  7643  caucvgprprlemnkltj  7690  caucvgprprlemnkeqj  7691  caucvgprprlemnbj  7694  0lt1sr  7766  recexgt0sr  7774  mulgt0sr  7779  archsr  7783  prsrpos  7786  mappsrprg  7805  pitoregt0  7850
  Copyright terms: Public domain W3C validator