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

Theorem resqrexlemp1rp 10970
Description: Lemma for resqrex 10990. Applying the recursion rule yields a positive real (expressed in a way that will help apply seqf 10417 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 2171 . . 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 5861 . . . . . 6  |-  ( y  =  B  ->  ( A  /  y )  =  ( A  /  B
) )
42, 3oveq12d 5871 . . . . 5  |-  ( y  =  B  ->  (
y  +  ( A  /  y ) )  =  ( B  +  ( A  /  B
) ) )
54oveq1d 5868 . . . 4  |-  ( y  =  B  ->  (
( y  +  ( A  /  y ) )  /  2 )  =  ( ( B  +  ( A  /  B ) )  / 
2 ) )
65ad2antrl 487 . . 3  |-  ( ( ( ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  /\  ( y  =  B  /\  z  =  C ) )  ->  (
( y  +  ( A  /  y ) )  /  2 )  =  ( ( B  +  ( A  /  B ) )  / 
2 ) )
7 simprl 526 . . 3  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  B  e.  RR+ )
8 simprr 527 . . 3  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  C  e.  RR+ )
97rpred 9653 . . . . 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 9685 . . . . 5  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  ( A  /  B )  e.  RR )
139, 12readdcld 7949 . . . 4  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  ( B  +  ( A  /  B ) )  e.  RR )
1413rehalfcld 9124 . . 3  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  (
( B  +  ( A  /  B ) )  /  2 )  e.  RR )
151, 6, 7, 8, 14ovmpod 5980 . 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 9656 . . . . 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 9694 . . . . 5  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  0  <_  ( A  /  B
) )
20 addgtge0 8369 . . . . 5  |-  ( ( ( B  e.  RR  /\  ( A  /  B
)  e.  RR )  /\  ( 0  < 
B  /\  0  <_  ( A  /  B ) ) )  ->  0  <  ( B  +  ( A  /  B ) ) )
219, 12, 16, 19, 20syl22anc 1234 . . . 4  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  0  <  ( B  +  ( A  /  B ) ) )
2213, 21elrpd 9650 . . 3  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  ( B  +  ( A  /  B ) )  e.  RR+ )
2322rphalfcld 9666 . 2  |-  ( (
ph  /\  ( B  e.  RR+  /\  C  e.  RR+ ) )  ->  (
( B  +  ( A  /  B ) )  /  2 )  e.  RR+ )
2415, 23eqeltrd 2247 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 1348    e. wcel 2141   class class class wbr 3989  (class class class)co 5853    e. cmpo 5855   RRcr 7773   0cc0 7774    + caddc 7777    < clt 7954    <_ cle 7955    / cdiv 8589   2c2 8929   RR+crp 9610
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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-cnex 7865  ax-resscn 7866  ax-1cn 7867  ax-1re 7868  ax-icn 7869  ax-addcl 7870  ax-addrcl 7871  ax-mulcl 7872  ax-mulrcl 7873  ax-addcom 7874  ax-mulcom 7875  ax-addass 7876  ax-mulass 7877  ax-distr 7878  ax-i2m1 7879  ax-0lt1 7880  ax-1rid 7881  ax-0id 7882  ax-rnegex 7883  ax-precex 7884  ax-cnre 7885  ax-pre-ltirr 7886  ax-pre-ltwlin 7887  ax-pre-lttrn 7888  ax-pre-apti 7889  ax-pre-ltadd 7890  ax-pre-mulgt0 7891  ax-pre-mulext 7892
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-reu 2455  df-rmo 2456  df-rab 2457  df-v 2732  df-sbc 2956  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-id 4278  df-po 4281  df-iso 4282  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-iota 5160  df-fun 5200  df-fv 5206  df-riota 5809  df-ov 5856  df-oprab 5857  df-mpo 5858  df-pnf 7956  df-mnf 7957  df-xr 7958  df-ltxr 7959  df-le 7960  df-sub 8092  df-neg 8093  df-reap 8494  df-ap 8501  df-div 8590  df-2 8937  df-rp 9611
This theorem is referenced by:  resqrexlemf  10971  resqrexlemf1  10972  resqrexlemfp1  10973
  Copyright terms: Public domain W3C validator