Theorem resqrexlemp1rp 11646

Description: Lemma for resqrex 11666. Applying the recursion rule yields a positive real (expressed in a way that will help apply seqf 10789 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

Step	Hyp	Ref	Expression
1		eqidd 2232	. . 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 6036	. . . . . 6 |- ( y = B -> ( A / y ) = ( A / B ) )
4	2, 3	oveq12d 6046	. . . . 5 |- ( y = B -> ( y + ( A / y ) ) = ( B + ( A / B ) ) )
5	4	oveq1d 6043	. . . 4 |- ( y = B -> ( ( y + ( A / y ) ) / 2 ) = ( ( B + ( A / B ) ) / 2 ) )
6	5	ad2antrl 490	. . 3 |- ( ( ( ph /\ ( B e. RR+ /\ C e. RR+ ) ) /\ ( y = B /\ z = C ) ) -> ( ( y + ( A / y ) ) / 2 ) = ( ( B + ( A / B ) ) / 2 ) )
7		simprl 531	. . 3 |- ( ( ph /\ ( B e. RR+ /\ C e. RR+ ) ) -> B e. RR+ )
8		simprr 533	. . 3 |- ( ( ph /\ ( B e. RR+ /\ C e. RR+ ) ) -> C e. RR+ )
9	7	rpred 9992	. . . . 5 |- ( ( ph /\ ( B e. RR+ /\ C e. RR+ ) ) -> B e. RR )
10		resqrexlem1arp.a	. . . . . . 7 |- ( ph -> A e. RR )
11	10	adantr 276	. . . . . 6 |- ( ( ph /\ ( B e. RR+ /\ C e. RR+ ) ) -> A e. RR )
12	11, 7	rerpdivcld 10024	. . . . 5 |- ( ( ph /\ ( B e. RR+ /\ C e. RR+ ) ) -> ( A / B ) e. RR )
13	9, 12	readdcld 8268	. . . 4 |- ( ( ph /\ ( B e. RR+ /\ C e. RR+ ) ) -> ( B + ( A / B ) ) e. RR )
14	13	rehalfcld 9450	. . 3 |- ( ( ph /\ ( B e. RR+ /\ C e. RR+ ) ) -> ( ( B + ( A / B ) ) / 2 ) e. RR )
15	1, 6, 7, 8, 14	ovmpod 6159	. 2 |- ( ( ph /\ ( B e. RR+ /\ C e. RR+ ) ) -> ( B ( y e. RR+ , z e. RR+ |-> ( ( y + ( A / y ) ) / 2 ) ) C ) = ( ( B + ( A / B ) ) / 2 ) )
16	7	rpgt0d 9995	. . . . 5 |- ( ( ph /\ ( B e. RR+ /\ C e. RR+ ) ) -> 0 < B )
17		resqrexlem1arp.agt0	. . . . . . 7 |- ( ph -> 0 <_ A )
18	17	adantr 276	. . . . . 6 |- ( ( ph /\ ( B e. RR+ /\ C e. RR+ ) ) -> 0 <_ A )
19	11, 7, 18	divge0d 10033	. . . . 5 |- ( ( ph /\ ( B e. RR+ /\ C e. RR+ ) ) -> 0 <_ ( A / B ) )
20		addgtge0 8689	. . . . 5 |- ( ( ( B e. RR /\ ( A / B ) e. RR ) /\ ( 0 < B /\ 0 <_ ( A / B ) ) ) -> 0 < ( B + ( A / B ) ) )
21	9, 12, 16, 19, 20	syl22anc 1275	. . . 4 |- ( ( ph /\ ( B e. RR+ /\ C e. RR+ ) ) -> 0 < ( B + ( A / B ) ) )
22	13, 21	elrpd 9989	. . 3 |- ( ( ph /\ ( B e. RR+ /\ C e. RR+ ) ) -> ( B + ( A / B ) ) e. RR+ )
23	22	rphalfcld 10005	. 2 |- ( ( ph /\ ( B e. RR+ /\ C e. RR+ ) ) -> ( ( B + ( A / B ) ) / 2 ) e. RR+ )
24	15, 23	eqeltrd 2308	1 |- ( ( ph /\ ( B e. RR+ /\ C e. RR+ ) ) -> ( B ( y e. RR+ , z e. RR+ |-> ( ( y + ( A / y ) ) / 2 ) ) C ) e. RR+ )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1398   e. wcel 2202   class class class wbr 4093  (class class class)co 6028   e. cmpo 6030   RRcr 8091   0cc0 8092   + caddc 8095   < clt 8273   <_ cle 8274   / cdiv 8911   2c2 9253   RR+crp 9949

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-mulrcl 8191  ax-addcom 8192  ax-mulcom 8193  ax-addass 8194  ax-mulass 8195  ax-distr 8196  ax-i2m1 8197  ax-0lt1 8198  ax-1rid 8199  ax-0id 8200  ax-rnegex 8201  ax-precex 8202  ax-cnre 8203  ax-pre-ltirr 8204  ax-pre-ltwlin 8205  ax-pre-lttrn 8206  ax-pre-apti 8207  ax-pre-ltadd 8208  ax-pre-mulgt0 8209  ax-pre-mulext 8210

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-id 4396  df-po 4399  df-iso 4400  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-iota 5293  df-fun 5335  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-pnf 8275  df-mnf 8276  df-xr 8277  df-ltxr 8278  df-le 8279  df-sub 8411  df-neg 8412  df-reap 8814  df-ap 8821  df-div 8912  df-2 9261  df-rp 9950

This theorem is referenced by:  resqrexlemf  11647  resqrexlemf1  11648  resqrexlemfp1  11649