Theorem caucvgprlemrnd 7635

Description: Lemma for caucvgpr 7644. 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 7631	. . . . 5 |- ( ( ph /\ s e. ( 1st ` L ) ) -> E. r e. Q. ( s <Q r /\ r e. ( 1st ` L ) ) )
6	5	ex 114	. . . 4 |- ( ph -> ( s e. ( 1st ` L ) -> E. r e. Q. ( s <Q r /\ r e. ( 1st ` L ) ) ) )
7	1, 2, 3, 4	caucvgprlemlol 7632	. . . . . 6 |- ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) -> s e. ( 1st ` L ) )
8	7	3expib 1201	. . . . 5 |- ( ph -> ( ( s <Q r /\ r e. ( 1st ` L ) ) -> s e. ( 1st ` L ) ) )
9	8	rexlimdvw 2591	. . . 4 |- ( ph -> ( E. r e. Q. ( s <Q r /\ r e. ( 1st ` L ) ) -> s e. ( 1st ` L ) ) )
10	6, 9	impbid 128	. . 3 |- ( ph -> ( s e. ( 1st ` L ) <-> E. r e. Q. ( s <Q r /\ r e. ( 1st ` L ) ) ) )
11	10	ralrimivw 2544	. 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 7633	. . . . 5 |- ( ( ph /\ r e. ( 2nd ` L ) ) -> E. s e. Q. ( s <Q r /\ s e. ( 2nd ` L ) ) )
13	12	ex 114	. . . 4 |- ( ph -> ( r e. ( 2nd ` L ) -> E. s e. Q. ( s <Q r /\ s e. ( 2nd ` L ) ) ) )
14	1, 2, 3, 4	caucvgprlemupu 7634	. . . . . 6 |- ( ( ph /\ s <Q r /\ s e. ( 2nd ` L ) ) -> r e. ( 2nd ` L ) )
15	14	3expib 1201	. . . . 5 |- ( ph -> ( ( s <Q r /\ s e. ( 2nd ` L ) ) -> r e. ( 2nd ` L ) ) )
16	15	rexlimdvw 2591	. . . 4 |- ( ph -> ( E. s e. Q. ( s <Q r /\ s e. ( 2nd ` L ) ) -> r e. ( 2nd ` L ) ) )
17	13, 16	impbid 128	. . 3 |- ( ph -> ( r e. ( 2nd ` L ) <-> E. s e. Q. ( s <Q r /\ s e. ( 2nd ` L ) ) ) )
18	17	ralrimivw 2544	. 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 304	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 103   <-> wb 104   = wceq 1348   e. wcel 2141   A.wral 2448   E.wrex 2449   {crab 2452   <.cop 3586   class class class wbr 3989   -->wf 5194   ` cfv 5198  (class class class)co 5853   1stc1st 6117   2ndc2nd 6118   1oc1o 6388   [cec 6511   N.cnpi 7234   <N clti 7237   ~Q ceq 7241   Q.cnq 7242   +Q cplq 7244   *Qcrq 7246   <Q cltq 7247

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-coll 4104  ax-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-iinf 4572

This theorem depends on definitions:  df-bi 116  df-dc 830  df-3or 974  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-ral 2453  df-rex 2454  df-reu 2455  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-eprel 4274  df-id 4278  df-po 4281  df-iso 4282  df-iord 4351  df-on 4353  df-suc 4356  df-iom 4575  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-ov 5856  df-oprab 5857  df-mpo 5858  df-1st 6119  df-2nd 6120  df-recs 6284  df-irdg 6349  df-1o 6395  df-oadd 6399  df-omul 6400  df-er 6513  df-ec 6515  df-qs 6519  df-ni 7266  df-pli 7267  df-mi 7268  df-lti 7269  df-plpq 7306  df-mpq 7307  df-enq 7309  df-nqqs 7310  df-plqqs 7311  df-mqqs 7312  df-1nqqs 7313  df-rq 7314  df-ltnqqs 7315

This theorem is referenced by:  caucvgprlemcl  7638