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

Theorem ltaddnq 7626
Description: The sum of two fractions is greater than one of them. (Contributed by NM, 14-Mar-1996.) (Revised by Mario Carneiro, 10-May-2013.)
Assertion
Ref Expression
ltaddnq  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  A  <Q  ( A  +Q  B ) )

Proof of Theorem ltaddnq
Dummy variables  r  s  t are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 1lt2nq 7625 . . . . . . 7  |-  1Q  <Q  ( 1Q  +Q  1Q )
2 1nq 7585 . . . . . . . 8  |-  1Q  e.  Q.
3 addclnq 7594 . . . . . . . . 9  |-  ( ( 1Q  e.  Q.  /\  1Q  e.  Q. )  -> 
( 1Q  +Q  1Q )  e.  Q. )
42, 2, 3mp2an 426 . . . . . . . 8  |-  ( 1Q 
+Q  1Q )  e. 
Q.
5 ltmnqg 7620 . . . . . . . 8  |-  ( ( 1Q  e.  Q.  /\  ( 1Q  +Q  1Q )  e.  Q.  /\  B  e.  Q. )  ->  ( 1Q  <Q  ( 1Q  +Q  1Q )  <->  ( B  .Q  1Q )  <Q  ( B  .Q  ( 1Q  +Q  1Q ) ) ) )
62, 4, 5mp3an12 1363 . . . . . . 7  |-  ( B  e.  Q.  ->  ( 1Q  <Q  ( 1Q  +Q  1Q )  <->  ( B  .Q  1Q )  <Q  ( B  .Q  ( 1Q  +Q  1Q ) ) ) )
71, 6mpbii 148 . . . . . 6  |-  ( B  e.  Q.  ->  ( B  .Q  1Q )  <Q 
( B  .Q  ( 1Q  +Q  1Q ) ) )
8 mulidnq 7608 . . . . . 6  |-  ( B  e.  Q.  ->  ( B  .Q  1Q )  =  B )
9 distrnqg 7606 . . . . . . . 8  |-  ( ( B  e.  Q.  /\  1Q  e.  Q.  /\  1Q  e.  Q. )  ->  ( B  .Q  ( 1Q  +Q  1Q ) )  =  ( ( B  .Q  1Q )  +Q  ( B  .Q  1Q ) ) )
102, 2, 9mp3an23 1365 . . . . . . 7  |-  ( B  e.  Q.  ->  ( B  .Q  ( 1Q  +Q  1Q ) )  =  ( ( B  .Q  1Q )  +Q  ( B  .Q  1Q ) ) )
118, 8oveq12d 6035 . . . . . . 7  |-  ( B  e.  Q.  ->  (
( B  .Q  1Q )  +Q  ( B  .Q  1Q ) )  =  ( B  +Q  B ) )
1210, 11eqtrd 2264 . . . . . 6  |-  ( B  e.  Q.  ->  ( B  .Q  ( 1Q  +Q  1Q ) )  =  ( B  +Q  B ) )
137, 8, 123brtr3d 4119 . . . . 5  |-  ( B  e.  Q.  ->  B  <Q  ( B  +Q  B
) )
1413adantl 277 . . . 4  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  B  <Q  ( B  +Q  B ) )
15 simpr 110 . . . . 5  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  B  e.  Q. )
16 addclnq 7594 . . . . . . 7  |-  ( ( B  e.  Q.  /\  B  e.  Q. )  ->  ( B  +Q  B
)  e.  Q. )
1716anidms 397 . . . . . 6  |-  ( B  e.  Q.  ->  ( B  +Q  B )  e. 
Q. )
1817adantl 277 . . . . 5  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( B  +Q  B
)  e.  Q. )
19 simpl 109 . . . . 5  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  A  e.  Q. )
20 ltanqg 7619 . . . . 5  |-  ( ( B  e.  Q.  /\  ( B  +Q  B
)  e.  Q.  /\  A  e.  Q. )  ->  ( B  <Q  ( B  +Q  B )  <->  ( A  +Q  B )  <Q  ( A  +Q  ( B  +Q  B ) ) ) )
2115, 18, 19, 20syl3anc 1273 . . . 4  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( B  <Q  ( B  +Q  B )  <->  ( A  +Q  B )  <Q  ( A  +Q  ( B  +Q  B ) ) ) )
2214, 21mpbid 147 . . 3  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( A  +Q  B
)  <Q  ( A  +Q  ( B  +Q  B
) ) )
23 addcomnqg 7600 . . 3  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( A  +Q  B
)  =  ( B  +Q  A ) )
24 addcomnqg 7600 . . . . 5  |-  ( ( r  e.  Q.  /\  s  e.  Q. )  ->  ( r  +Q  s
)  =  ( s  +Q  r ) )
2524adantl 277 . . . 4  |-  ( ( ( A  e.  Q.  /\  B  e.  Q. )  /\  ( r  e.  Q.  /\  s  e.  Q. )
)  ->  ( r  +Q  s )  =  ( s  +Q  r ) )
26 addassnqg 7601 . . . . 5  |-  ( ( r  e.  Q.  /\  s  e.  Q.  /\  t  e.  Q. )  ->  (
( r  +Q  s
)  +Q  t )  =  ( r  +Q  ( s  +Q  t
) ) )
2726adantl 277 . . . 4  |-  ( ( ( A  e.  Q.  /\  B  e.  Q. )  /\  ( r  e.  Q.  /\  s  e.  Q.  /\  t  e.  Q. )
)  ->  ( (
r  +Q  s )  +Q  t )  =  ( r  +Q  (
s  +Q  t ) ) )
2819, 15, 15, 25, 27caov12d 6203 . . 3  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( A  +Q  ( B  +Q  B ) )  =  ( B  +Q  ( A  +Q  B
) ) )
2922, 23, 283brtr3d 4119 . 2  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( B  +Q  A
)  <Q  ( B  +Q  ( A  +Q  B
) ) )
30 addclnq 7594 . . 3  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( A  +Q  B
)  e.  Q. )
31 ltanqg 7619 . . 3  |-  ( ( A  e.  Q.  /\  ( A  +Q  B
)  e.  Q.  /\  B  e.  Q. )  ->  ( A  <Q  ( A  +Q  B )  <->  ( B  +Q  A )  <Q  ( B  +Q  ( A  +Q  B ) ) ) )
3219, 30, 15, 31syl3anc 1273 . 2  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( A  <Q  ( A  +Q  B )  <->  ( B  +Q  A )  <Q  ( B  +Q  ( A  +Q  B ) ) ) )
3329, 32mpbird 167 1  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  A  <Q  ( A  +Q  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1004    = wceq 1397    e. wcel 2202   class class class wbr 4088  (class class class)co 6017   Q.cnq 7499   1Qc1q 7500    +Q cplq 7501    .Q cmq 7502    <Q cltq 7504
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-eprel 4386  df-id 4390  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-irdg 6535  df-1o 6581  df-oadd 6585  df-omul 6586  df-er 6701  df-ec 6703  df-qs 6707  df-ni 7523  df-pli 7524  df-mi 7525  df-lti 7526  df-plpq 7563  df-mpq 7564  df-enq 7566  df-nqqs 7567  df-plqqs 7568  df-mqqs 7569  df-1nqqs 7570  df-ltnqqs 7572
This theorem is referenced by:  ltexnqq  7627  nsmallnqq  7631  subhalfnqq  7633  ltbtwnnqq  7634  prarloclemarch2  7638  ltexprlemm  7819  ltexprlemopl  7820  addcanprleml  7833  addcanprlemu  7834  recexprlemm  7843  cauappcvgprlemm  7864  cauappcvgprlemopl  7865  cauappcvgprlem2  7879  caucvgprlemnkj  7885  caucvgprlemnbj  7886  caucvgprlemm  7887  caucvgprlemopl  7888  caucvgprprlemnjltk  7910  caucvgprprlemopl  7916  suplocexprlemmu  7937
  Copyright terms: Public domain W3C validator