Theorem caucvgprlemrnd 6863

Description: Lemma for caucvgpr 6872. The putative limit is rounded. (Contributed by Jim Kingdon, 27-Sep-2020.)

Hypotheses

Ref	Expression
caucvgpr.f	|- ( ph -> F : N. --> Q. )
caucvgpr.cau	|- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <Q ( ( F ` k ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) /\ ( F ` k ) <Q ( ( F ` n ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) ) ) )
caucvgpr.bnd	|- ( ph -> A. j e. N. A <Q ( F ` j ) )
caucvgpr.lim	|- L = <. { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) } , { u e. Q. | E. j e. N. ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q u } >.

Assertion

Ref	Expression
caucvgprlemrnd	|- ( ph -> ( A. s e. Q. ( s e. ( 1st ` L ) <-> E. r e. Q. ( s <Q r /\ r e. ( 1st ` L ) ) ) /\ A. r e. Q. ( r e. ( 2nd ` L ) <-> E. s e. Q. ( s <Q r /\ s e. ( 2nd ` L ) ) ) ) )

Distinct variable groups:   A, j   L, r, s   ph, r, s   F, l, r, s   u, F, s   j, L, r   j, l, s   ph, j   u, j, r

Allowed substitution hints:   ph( u, k, n, l)   A( u, k, n, s, r, l)   F( j, k, n)   L( u, k, n, l)

Proof of Theorem caucvgprlemrnd

Step	Hyp	Ref	Expression
1		caucvgpr.f	. . . . . 6 |- ( ph -> F : N. --> Q. )
2		caucvgpr.cau	. . . . . 6 |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <Q ( ( F ` k ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) /\ ( F ` k ) <Q ( ( F ` n ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) ) ) )
3		caucvgpr.bnd	. . . . . 6 |- ( ph -> A. j e. N. A <Q ( F ` j ) )
4		caucvgpr.lim	. . . . . 6 |- L = <. { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) } , { u e. Q. | E. j e. N. ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q u } >.
5	1, 2, 3, 4	caucvgprlemopl 6859	. . . . 5 |- ( ( ph /\ s e. ( 1st ` L ) ) -> E. r e. Q. ( s <Q r /\ r e. ( 1st ` L ) ) )
6	5	ex 113	. . . 4 |- ( ph -> ( s e. ( 1st ` L ) -> E. r e. Q. ( s <Q r /\ r e. ( 1st ` L ) ) ) )
7	1, 2, 3, 4	caucvgprlemlol 6860	. . . . . 6 |- ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) -> s e. ( 1st ` L ) )
8	7	3expib 1141	. . . . 5 |- ( ph -> ( ( s <Q r /\ r e. ( 1st ` L ) ) -> s e. ( 1st ` L ) ) )
9	8	rexlimdvw 2480	. . . 4 |- ( ph -> ( E. r e. Q. ( s <Q r /\ r e. ( 1st ` L ) ) -> s e. ( 1st ` L ) ) )
10	6, 9	impbid 127	. . 3 |- ( ph -> ( s e. ( 1st ` L ) <-> E. r e. Q. ( s <Q r /\ r e. ( 1st ` L ) ) ) )
11	10	ralrimivw 2435	. 2 |- ( ph -> A. s e. Q. ( s e. ( 1st ` L ) <-> E. r e. Q. ( s <Q r /\ r e. ( 1st ` L ) ) ) )
12	1, 2, 3, 4	caucvgprlemopu 6861	. . . . 5 |- ( ( ph /\ r e. ( 2nd ` L ) ) -> E. s e. Q. ( s <Q r /\ s e. ( 2nd ` L ) ) )
13	12	ex 113	. . . 4 |- ( ph -> ( r e. ( 2nd ` L ) -> E. s e. Q. ( s <Q r /\ s e. ( 2nd ` L ) ) ) )
14	1, 2, 3, 4	caucvgprlemupu 6862	. . . . . 6 |- ( ( ph /\ s <Q r /\ s e. ( 2nd ` L ) ) -> r e. ( 2nd ` L ) )
15	14	3expib 1141	. . . . 5 |- ( ph -> ( ( s <Q r /\ s e. ( 2nd ` L ) ) -> r e. ( 2nd ` L ) ) )
16	15	rexlimdvw 2480	. . . 4 |- ( ph -> ( E. s e. Q. ( s <Q r /\ s e. ( 2nd ` L ) ) -> r e. ( 2nd ` L ) ) )
17	13, 16	impbid 127	. . 3 |- ( ph -> ( r e. ( 2nd ` L ) <-> E. s e. Q. ( s <Q r /\ s e. ( 2nd ` L ) ) ) )
18	17	ralrimivw 2435	. 2 |- ( ph -> A. r e. Q. ( r e. ( 2nd ` L ) <-> E. s e. Q. ( s <Q r /\ s e. ( 2nd ` L ) ) ) )
19	11, 18	jca 300	1 |- ( ph -> ( A. s e. Q. ( s e. ( 1st ` L ) <-> E. r e. Q. ( s <Q r /\ r e. ( 1st ` L ) ) ) /\ A. r e. Q. ( r e. ( 2nd ` L ) <-> E. s e. Q. ( s <Q r /\ s e. ( 2nd ` L ) ) ) ) )

Syntax hints:   -> wi 4   /\ wa 102   <-> wb 103   = wceq 1284   e. wcel 1433   A.wral 2348   E.wrex 2349   {crab 2352   <.cop 3401   class class class wbr 3785   -->wf 4918   ` cfv 4922  (class class class)co 5532   1stc1st 5785   2ndc2nd 5786   1oc1o 6017   [cec 6127   N.cnpi 6462   <N clti 6465   ~Q ceq 6469   Q.cnq 6470   +Q cplq 6472   *Qcrq 6474   <Q cltq 6475

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-coll 3893  ax-sep 3896  ax-nul 3904  ax-pow 3948  ax-pr 3964  ax-un 4188  ax-setind 4280  ax-iinf 4329

This theorem depends on definitions:  df-bi 115  df-dc 776  df-3or 920  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-ral 2353  df-rex 2354  df-reu 2355  df-rab 2357  df-v 2603  df-sbc 2816  df-csb 2909  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-nul 3252  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-int 3637  df-iun 3680  df-br 3786  df-opab 3840  df-mpt 3841  df-tr 3876  df-eprel 4044  df-id 4048  df-po 4051  df-iso 4052  df-iord 4121  df-on 4123  df-suc 4126  df-iom 4332  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-1st 5787  df-2nd 5788  df-recs 5943  df-irdg 5980  df-1o 6024  df-oadd 6028  df-omul 6029  df-er 6129  df-ec 6131  df-qs 6135  df-ni 6494  df-pli 6495  df-mi 6496  df-lti 6497  df-plpq 6534  df-mpq 6535  df-enq 6537  df-nqqs 6538  df-plqqs 6539  df-mqqs 6540  df-1nqqs 6541  df-rq 6542  df-ltnqqs 6543

This theorem is referenced by:  caucvgprlemcl  6866