Theorem caucvgprlemrnd 7823

Description: Lemma for caucvgpr 7832. 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 7819	. . . . 5 |- ( ( ph /\ s e. ( 1st ` L ) ) -> E. r e. Q. ( s <Q r /\ r e. ( 1st ` L ) ) )
6	5	ex 115	. . . 4 |- ( ph -> ( s e. ( 1st ` L ) -> E. r e. Q. ( s <Q r /\ r e. ( 1st ` L ) ) ) )
7	1, 2, 3, 4	caucvgprlemlol 7820	. . . . . 6 |- ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) -> s e. ( 1st ` L ) )
8	7	3expib 1209	. . . . 5 |- ( ph -> ( ( s <Q r /\ r e. ( 1st ` L ) ) -> s e. ( 1st ` L ) ) )
9	8	rexlimdvw 2630	. . . 4 |- ( ph -> ( E. r e. Q. ( s <Q r /\ r e. ( 1st ` L ) ) -> s e. ( 1st ` L ) ) )
10	6, 9	impbid 129	. . 3 |- ( ph -> ( s e. ( 1st ` L ) <-> E. r e. Q. ( s <Q r /\ r e. ( 1st ` L ) ) ) )
11	10	ralrimivw 2582	. 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 7821	. . . . 5 |- ( ( ph /\ r e. ( 2nd ` L ) ) -> E. s e. Q. ( s <Q r /\ s e. ( 2nd ` L ) ) )
13	12	ex 115	. . . 4 |- ( ph -> ( r e. ( 2nd ` L ) -> E. s e. Q. ( s <Q r /\ s e. ( 2nd ` L ) ) ) )
14	1, 2, 3, 4	caucvgprlemupu 7822	. . . . . 6 |- ( ( ph /\ s <Q r /\ s e. ( 2nd ` L ) ) -> r e. ( 2nd ` L ) )
15	14	3expib 1209	. . . . 5 |- ( ph -> ( ( s <Q r /\ s e. ( 2nd ` L ) ) -> r e. ( 2nd ` L ) ) )
16	15	rexlimdvw 2630	. . . 4 |- ( ph -> ( E. s e. Q. ( s <Q r /\ s e. ( 2nd ` L ) ) -> r e. ( 2nd ` L ) ) )
17	13, 16	impbid 129	. . 3 |- ( ph -> ( r e. ( 2nd ` L ) <-> E. s e. Q. ( s <Q r /\ s e. ( 2nd ` L ) ) ) )
18	17	ralrimivw 2582	. 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 306	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 104   <-> wb 105   = wceq 1373   e. wcel 2178   A.wral 2486   E.wrex 2487   {crab 2490   <.cop 3647   class class class wbr 4060   -->wf 5287   ` cfv 5291  (class class class)co 5969   1stc1st 6249   2ndc2nd 6250   1oc1o 6520   [cec 6643   N.cnpi 7422   <N clti 7425   ~Q ceq 7429   Q.cnq 7430   +Q cplq 7432   *Qcrq 7434   <Q cltq 7435

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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4176  ax-sep 4179  ax-nul 4187  ax-pow 4235  ax-pr 4270  ax-un 4499  ax-setind 4604  ax-iinf 4655

This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-reu 2493  df-rab 2495  df-v 2779  df-sbc 3007  df-csb 3103  df-dif 3177  df-un 3179  df-in 3181  df-ss 3188  df-nul 3470  df-pw 3629  df-sn 3650  df-pr 3651  df-op 3653  df-uni 3866  df-int 3901  df-iun 3944  df-br 4061  df-opab 4123  df-mpt 4124  df-tr 4160  df-eprel 4355  df-id 4359  df-po 4362  df-iso 4363  df-iord 4432  df-on 4434  df-suc 4437  df-iom 4658  df-xp 4700  df-rel 4701  df-cnv 4702  df-co 4703  df-dm 4704  df-rn 4705  df-res 4706  df-ima 4707  df-iota 5252  df-fun 5293  df-fn 5294  df-f 5295  df-f1 5296  df-fo 5297  df-f1o 5298  df-fv 5299  df-ov 5972  df-oprab 5973  df-mpo 5974  df-1st 6251  df-2nd 6252  df-recs 6416  df-irdg 6481  df-1o 6527  df-oadd 6531  df-omul 6532  df-er 6645  df-ec 6647  df-qs 6651  df-ni 7454  df-pli 7455  df-mi 7456  df-lti 7457  df-plpq 7494  df-mpq 7495  df-enq 7497  df-nqqs 7498  df-plqqs 7499  df-mqqs 7500  df-1nqqs 7501  df-rq 7502  df-ltnqqs 7503

This theorem is referenced by:  caucvgprlemcl  7826