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

Theorem ltaddpr 6787
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 6665 . . . 4  |-  ( B  e.  P.  ->  <. ( 1st `  B ) ,  ( 2nd `  B
) >.  e.  P. )
2 prml 6667 . . . 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 271 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  E. p  e.  Q.  p  e.  ( 1st `  B ) )
5 prop 6665 . . . . 5  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )
6 prarloc 6693 . . . . 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 277 . . . 4  |-  ( ( A  e.  P.  /\  p  e.  Q. )  ->  E. r  e.  ( 1st `  A ) E. q  e.  ( 2nd `  A ) q  <Q  ( r  +Q  p ) )
87ad2ant2r 492 . . 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 6672 . . . . . . . . . . 11  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  q  e.  ( 2nd `  A ) )  -> 
q  e.  Q. )
105, 9sylan 277 . . . . . . . . . 10  |-  ( ( A  e.  P.  /\  q  e.  ( 2nd `  A ) )  -> 
q  e.  Q. )
1110adantlr 460 . . . . . . . . 9  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  q  e.  ( 2nd `  A ) )  ->  q  e.  Q. )
1211ad2ant2rl 494 . . . . . . . 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 270 . . . . . . 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 502 . . . . . . 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 497 . . . . . . . . . . . . 13  |-  ( ( ( p  e.  Q.  /\  p  e.  ( 1st `  B ) )  /\  ( r  e.  ( 1st `  A )  /\  q  e.  ( 2nd `  A ) ) )  ->  r  e.  ( 1st `  A
) )
16 simplr 496 . . . . . . . . . . . . 13  |-  ( ( ( p  e.  Q.  /\  p  e.  ( 1st `  B ) )  /\  ( r  e.  ( 1st `  A )  /\  q  e.  ( 2nd `  A ) ) )  ->  p  e.  ( 1st `  B
) )
1715, 16jca 300 . . . . . . . . . . . 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 6658 . . . . . . . . . . . . 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 6565 . . . . . . . . . . . . 13  |-  ( ( g  e.  Q.  /\  h  e.  Q. )  ->  ( g  +Q  h
)  e.  Q. )
2018, 19genpprecll 6704 . . . . . . . . . . . 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 433 . . . . . . . . . 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 6727 . . . . . . . . . . 11  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A  +P.  B
)  e.  P. )
24 prop 6665 . . . . . . . . . . . 12  |-  ( ( A  +P.  B )  e.  P.  ->  <. ( 1st `  ( A  +P.  B ) ) ,  ( 2nd `  ( A  +P.  B ) )
>.  e.  P. )
25 prcdnql 6674 . . . . . . . . . . . 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 277 . . . . . . . . . . 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 277 . . . . . . . . . 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 392 . . . . . . . 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 122 . . . . . . 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 2412 . . . . . . 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 1167 . . . . . 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 6696 . . . . . . . 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 276 . . . . . . 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 475 . . . . . 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 165 . . . . 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 113 . . . 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 2484 . . 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 2481 1  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  A  <P  ( A  +P.  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    <-> wb 103    e. wcel 1433   E.wrex 2349   <.cop 3401   class class class wbr 3785   ` cfv 4922  (class class class)co 5532   1stc1st 5785   2ndc2nd 5786   Q.cnq 6470    +Q cplq 6472    <Q cltq 6475   P.cnp 6481    +P. cpp 6483    <P cltp 6485
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-coll 3893  ax-sep 3896  ax-nul 3904  ax-pow 3948  ax-pr 3964  ax-un 4188  ax-setind 4280  ax-iinf 4329
This theorem depends on definitions:  df-bi 115  df-dc 776  df-3or 920  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-ral 2353  df-rex 2354  df-reu 2355  df-rab 2357  df-v 2603  df-sbc 2816  df-csb 2909  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-nul 3252  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-int 3637  df-iun 3680  df-br 3786  df-opab 3840  df-mpt 3841  df-tr 3876  df-eprel 4044  df-id 4048  df-po 4051  df-iso 4052  df-iord 4121  df-on 4123  df-suc 4126  df-iom 4332  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-1st 5787  df-2nd 5788  df-recs 5943  df-irdg 5980  df-1o 6024  df-2o 6025  df-oadd 6028  df-omul 6029  df-er 6129  df-ec 6131  df-qs 6135  df-ni 6494  df-pli 6495  df-mi 6496  df-lti 6497  df-plpq 6534  df-mpq 6535  df-enq 6537  df-nqqs 6538  df-plqqs 6539  df-mqqs 6540  df-1nqqs 6541  df-rq 6542  df-ltnqqs 6543  df-enq0 6614  df-nq0 6615  df-0nq0 6616  df-plq0 6617  df-mq0 6618  df-inp 6656  df-iplp 6658  df-iltp 6660
This theorem is referenced by:  ltexprlemrl  6800  ltaprlem  6808  ltaprg  6809  prplnqu  6810  ltmprr  6832  caucvgprprlemnkltj  6879  caucvgprprlemnkeqj  6880  caucvgprprlemnbj  6883  0lt1sr  6942  recexgt0sr  6950  mulgt0sr  6954  archsr  6958  prsrpos  6961  pitoregt0  7017
  Copyright terms: Public domain W3C validator