MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  recp1lt1 Structured version   Unicode version

Theorem recp1lt1 10218
Description: Construct a number less than 1 from any nonnegative number. (Contributed by NM, 30-Dec-2005.)
Assertion
Ref Expression
recp1lt1  |-  ( ( A  e.  RR  /\  0  <_  A )  -> 
( A  /  (
1  +  A ) )  <  1 )

Proof of Theorem recp1lt1
StepHypRef Expression
1 ltp1 10155 . . . . 5  |-  ( A  e.  RR  ->  A  <  ( A  +  1 ) )
2 recn 9360 . . . . . 6  |-  ( A  e.  RR  ->  A  e.  CC )
3 ax-1cn 9328 . . . . . 6  |-  1  e.  CC
4 addcom 9543 . . . . . 6  |-  ( ( A  e.  CC  /\  1  e.  CC )  ->  ( A  +  1 )  =  ( 1  +  A ) )
52, 3, 4sylancl 655 . . . . 5  |-  ( A  e.  RR  ->  ( A  +  1 )  =  ( 1  +  A ) )
61, 5breqtrd 4304 . . . 4  |-  ( A  e.  RR  ->  A  <  ( 1  +  A
) )
76adantr 462 . . 3  |-  ( ( A  e.  RR  /\  0  <_  A )  ->  A  <  ( 1  +  A ) )
82adantr 462 . . . 4  |-  ( ( A  e.  RR  /\  0  <_  A )  ->  A  e.  CC )
9 1re 9373 . . . . . . 7  |-  1  e.  RR
10 readdcl 9353 . . . . . . 7  |-  ( ( 1  e.  RR  /\  A  e.  RR )  ->  ( 1  +  A
)  e.  RR )
119, 10mpan 663 . . . . . 6  |-  ( A  e.  RR  ->  (
1  +  A )  e.  RR )
1211adantr 462 . . . . 5  |-  ( ( A  e.  RR  /\  0  <_  A )  -> 
( 1  +  A
)  e.  RR )
1312recnd 9400 . . . 4  |-  ( ( A  e.  RR  /\  0  <_  A )  -> 
( 1  +  A
)  e.  CC )
14 0lt1 9850 . . . . . . 7  |-  0  <  1
15 addgtge0 9815 . . . . . . 7  |-  ( ( ( 1  e.  RR  /\  A  e.  RR )  /\  ( 0  <  1  /\  0  <_  A ) )  -> 
0  <  ( 1  +  A ) )
1614, 15mpanr1 676 . . . . . 6  |-  ( ( ( 1  e.  RR  /\  A  e.  RR )  /\  0  <_  A
)  ->  0  <  ( 1  +  A ) )
179, 16mpanl1 673 . . . . 5  |-  ( ( A  e.  RR  /\  0  <_  A )  -> 
0  <  ( 1  +  A ) )
1817gt0ne0d 9892 . . . 4  |-  ( ( A  e.  RR  /\  0  <_  A )  -> 
( 1  +  A
)  =/=  0 )
198, 13, 18divcan1d 10096 . . 3  |-  ( ( A  e.  RR  /\  0  <_  A )  -> 
( ( A  / 
( 1  +  A
) )  x.  (
1  +  A ) )  =  A )
2011recnd 9400 . . . . 5  |-  ( A  e.  RR  ->  (
1  +  A )  e.  CC )
2120mulid2d 9392 . . . 4  |-  ( A  e.  RR  ->  (
1  x.  ( 1  +  A ) )  =  ( 1  +  A ) )
2221adantr 462 . . 3  |-  ( ( A  e.  RR  /\  0  <_  A )  -> 
( 1  x.  (
1  +  A ) )  =  ( 1  +  A ) )
237, 19, 223brtr4d 4310 . 2  |-  ( ( A  e.  RR  /\  0  <_  A )  -> 
( ( A  / 
( 1  +  A
) )  x.  (
1  +  A ) )  <  ( 1  x.  ( 1  +  A ) ) )
24 simpl 454 . . . 4  |-  ( ( A  e.  RR  /\  0  <_  A )  ->  A  e.  RR )
2524, 12, 18redivcld 10147 . . 3  |-  ( ( A  e.  RR  /\  0  <_  A )  -> 
( A  /  (
1  +  A ) )  e.  RR )
26 ltmul1 10167 . . . 4  |-  ( ( ( A  /  (
1  +  A ) )  e.  RR  /\  1  e.  RR  /\  (
( 1  +  A
)  e.  RR  /\  0  <  ( 1  +  A ) ) )  ->  ( ( A  /  ( 1  +  A ) )  <  1  <->  ( ( A  /  ( 1  +  A ) )  x.  ( 1  +  A
) )  <  (
1  x.  ( 1  +  A ) ) ) )
279, 26mp3an2 1295 . . 3  |-  ( ( ( A  /  (
1  +  A ) )  e.  RR  /\  ( ( 1  +  A )  e.  RR  /\  0  <  ( 1  +  A ) ) )  ->  ( ( A  /  ( 1  +  A ) )  <  1  <->  ( ( A  /  ( 1  +  A ) )  x.  ( 1  +  A
) )  <  (
1  x.  ( 1  +  A ) ) ) )
2825, 12, 17, 27syl12anc 1209 . 2  |-  ( ( A  e.  RR  /\  0  <_  A )  -> 
( ( A  / 
( 1  +  A
) )  <  1  <->  ( ( A  /  (
1  +  A ) )  x.  ( 1  +  A ) )  <  ( 1  x.  ( 1  +  A
) ) ) )
2923, 28mpbird 232 1  |-  ( ( A  e.  RR  /\  0  <_  A )  -> 
( A  /  (
1  +  A ) )  <  1 )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    = wceq 1362    e. wcel 1755   class class class wbr 4280  (class class class)co 6080   CCcc 9268   RRcr 9269   0cc0 9270   1c1 9271    + caddc 9273    x. cmul 9275    < clt 9406    <_ cle 9407    / cdiv 9981
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1594  ax-4 1605  ax-5 1669  ax-6 1707  ax-7 1727  ax-8 1757  ax-9 1759  ax-10 1774  ax-11 1779  ax-12 1791  ax-13 1942  ax-ext 2414  ax-sep 4401  ax-nul 4409  ax-pow 4458  ax-pr 4519  ax-un 6361  ax-resscn 9327  ax-1cn 9328  ax-icn 9329  ax-addcl 9330  ax-addrcl 9331  ax-mulcl 9332  ax-mulrcl 9333  ax-mulcom 9334  ax-addass 9335  ax-mulass 9336  ax-distr 9337  ax-i2m1 9338  ax-1ne0 9339  ax-1rid 9340  ax-rnegex 9341  ax-rrecex 9342  ax-cnre 9343  ax-pre-lttri 9344  ax-pre-lttrn 9345  ax-pre-ltadd 9346  ax-pre-mulgt0 9347
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 959  df-3an 960  df-tru 1365  df-ex 1590  df-nf 1593  df-sb 1700  df-eu 2258  df-mo 2259  df-clab 2420  df-cleq 2426  df-clel 2429  df-nfc 2558  df-ne 2598  df-nel 2599  df-ral 2710  df-rex 2711  df-reu 2712  df-rmo 2713  df-rab 2714  df-v 2964  df-sbc 3176  df-csb 3277  df-dif 3319  df-un 3321  df-in 3323  df-ss 3330  df-nul 3626  df-if 3780  df-pw 3850  df-sn 3866  df-pr 3868  df-op 3872  df-uni 4080  df-br 4281  df-opab 4339  df-mpt 4340  df-id 4623  df-po 4628  df-so 4629  df-xp 4833  df-rel 4834  df-cnv 4835  df-co 4836  df-dm 4837  df-rn 4838  df-res 4839  df-ima 4840  df-iota 5369  df-fun 5408  df-fn 5409  df-f 5410  df-f1 5411  df-fo 5412  df-f1o 5413  df-fv 5414  df-riota 6039  df-ov 6083  df-oprab 6084  df-mpt2 6085  df-er 7089  df-en 7299  df-dom 7300  df-sdom 7301  df-pnf 9408  df-mnf 9409  df-xr 9410  df-ltxr 9411  df-le 9412  df-sub 9585  df-neg 9586  df-div 9982
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator