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

Theorem resqrexlemp1rp 10810
Description: Lemma for resqrex 10830. Applying the recursion rule yields a positive real (expressed in a way that will help apply seqf 10265 and similar theorems). (Contributed by Jim Kingdon, 28-Jul-2021.) (Revised by Jim Kingdon, 16-Oct-2022.)
Hypotheses
Ref Expression
resqrexlem1arp.a  |-  ( ph  ->  A  e.  RR )
resqrexlem1arp.agt0  |-  ( ph  ->  0  <_  A )
Assertion
Ref Expression
resqrexlemp1rp  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  ( B ( y  e.  RR+ ,  z  e.  RR+  |->  ( ( y  +  ( A  /  y
) )  /  2
) ) C )  e.  RR+ )
Distinct variable groups:    y, A, z    ph, y, z    y, B, z    y, C, z

Proof of Theorem resqrexlemp1rp
StepHypRef Expression
1 eqidd 2141 . . 3  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  (
y  e.  RR+ ,  z  e.  RR+  |->  ( ( y  +  ( A  /  y ) )  /  2 ) )  =  ( y  e.  RR+ ,  z  e.  RR+  |->  ( ( y  +  ( A  /  y
) )  /  2
) ) )
2 id 19 . . . . . 6  |-  ( y  =  B  ->  y  =  B )
3 oveq2 5790 . . . . . 6  |-  ( y  =  B  ->  ( A  /  y )  =  ( A  /  B
) )
42, 3oveq12d 5800 . . . . 5  |-  ( y  =  B  ->  (
y  +  ( A  /  y ) )  =  ( B  +  ( A  /  B
) ) )
54oveq1d 5797 . . . 4  |-  ( y  =  B  ->  (
( y  +  ( A  /  y ) )  /  2 )  =  ( ( B  +  ( A  /  B ) )  / 
2 ) )
65ad2antrl 482 . . 3  |-  ( ( ( ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  /\  ( y  =  B  /\  z  =  C ) )  ->  (
( y  +  ( A  /  y ) )  /  2 )  =  ( ( B  +  ( A  /  B ) )  / 
2 ) )
7 simprl 521 . . 3  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  B  e.  RR+ )
8 simprr 522 . . 3  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  C  e.  RR+ )
97rpred 9513 . . . . 5  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  B  e.  RR )
10 resqrexlem1arp.a . . . . . . 7  |-  ( ph  ->  A  e.  RR )
1110adantr 274 . . . . . 6  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  A  e.  RR )
1211, 7rerpdivcld 9545 . . . . 5  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  ( A  /  B )  e.  RR )
139, 12readdcld 7819 . . . 4  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  ( B  +  ( A  /  B ) )  e.  RR )
1413rehalfcld 8990 . . 3  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  (
( B  +  ( A  /  B ) )  /  2 )  e.  RR )
151, 6, 7, 8, 14ovmpod 5906 . 2  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  ( B ( y  e.  RR+ ,  z  e.  RR+  |->  ( ( y  +  ( A  /  y
) )  /  2
) ) C )  =  ( ( B  +  ( A  /  B ) )  / 
2 ) )
167rpgt0d 9516 . . . . 5  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  0  <  B )
17 resqrexlem1arp.agt0 . . . . . . 7  |-  ( ph  ->  0  <_  A )
1817adantr 274 . . . . . 6  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  0  <_  A )
1911, 7, 18divge0d 9554 . . . . 5  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  0  <_  ( A  /  B
) )
20 addgtge0 8236 . . . . 5  |-  ( ( ( B  e.  RR  /\  ( A  /  B
)  e.  RR )  /\  ( 0  < 
B  /\  0  <_  ( A  /  B ) ) )  ->  0  <  ( B  +  ( A  /  B ) ) )
219, 12, 16, 19, 20syl22anc 1218 . . . 4  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  0  <  ( B  +  ( A  /  B ) ) )
2213, 21elrpd 9510 . . 3  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  ( B  +  ( A  /  B ) )  e.  RR+ )
2322rphalfcld 9526 . 2  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  (
( B  +  ( A  /  B ) )  /  2 )  e.  RR+ )
2415, 23eqeltrd 2217 1  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  ( B ( y  e.  RR+ ,  z  e.  RR+  |->  ( ( y  +  ( A  /  y
) )  /  2
) ) C )  e.  RR+ )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1332    e. wcel 1481   class class class wbr 3937  (class class class)co 5782    e. cmpo 5784   RRcr 7643   0cc0 7644    + caddc 7647    < clt 7824    <_ cle 7825    / cdiv 8456   2c2 8795   RR+crp 9470
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 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139  ax-un 4363  ax-setind 4460  ax-cnex 7735  ax-resscn 7736  ax-1cn 7737  ax-1re 7738  ax-icn 7739  ax-addcl 7740  ax-addrcl 7741  ax-mulcl 7742  ax-mulrcl 7743  ax-addcom 7744  ax-mulcom 7745  ax-addass 7746  ax-mulass 7747  ax-distr 7748  ax-i2m1 7749  ax-0lt1 7750  ax-1rid 7751  ax-0id 7752  ax-rnegex 7753  ax-precex 7754  ax-cnre 7755  ax-pre-ltirr 7756  ax-pre-ltwlin 7757  ax-pre-lttrn 7758  ax-pre-apti 7759  ax-pre-ltadd 7760  ax-pre-mulgt0 7761  ax-pre-mulext 7762
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-nel 2405  df-ral 2422  df-rex 2423  df-reu 2424  df-rmo 2425  df-rab 2426  df-v 2691  df-sbc 2914  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-br 3938  df-opab 3998  df-id 4223  df-po 4226  df-iso 4227  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-iota 5096  df-fun 5133  df-fv 5139  df-riota 5738  df-ov 5785  df-oprab 5786  df-mpo 5787  df-pnf 7826  df-mnf 7827  df-xr 7828  df-ltxr 7829  df-le 7830  df-sub 7959  df-neg 7960  df-reap 8361  df-ap 8368  df-div 8457  df-2 8803  df-rp 9471
This theorem is referenced by:  resqrexlemf  10811  resqrexlemf1  10812  resqrexlemfp1  10813
  Copyright terms: Public domain W3C validator