Theorem caucvgprlemlim 8054

Description: Lemma for caucvgpr 8055. The putative limit is a limit. (Contributed by Jim Kingdon, 1-Oct-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
caucvgprlemlim	|- ( ph -> A. x e. Q. E. j e. N. A. k e. N. ( j <N k -> ( <. { l | l <Q ( F ` k ) } , { u | ( F ` k ) <Q u } >. <P ( L +P. <. { l | l <Q x } , { u | x <Q u } >. ) /\ L <P <. { l | l <Q ( ( F ` k ) +Q x ) } , { u | ( ( F ` k ) +Q x ) <Q u } >. ) ) )

Distinct variable groups:   A, j   j, F, u, l, k   n, F, k   j, k, ph, x   k, l, u, x, j   j, L, k

Allowed substitution hints:   ph( u, n, l)   A( x, u, k, n, l)   F( x)   L( x, u, n, l)

Proof of Theorem caucvgprlemlim

Step	Hyp	Ref	Expression
1		archrecnq 8036	. . . 4 |- ( x e. Q. -> E. j e. N. ( *Q ` [ <. j , 1o >. ] ~Q ) <Q x )
2	1	adantl 277	. . 3 |- ( ( ph /\ x e. Q. ) -> E. j e. N. ( *Q ` [ <. j , 1o >. ] ~Q ) <Q x )
3		caucvgpr.f	. . . . . . . . . 10 |- ( ph -> F : N. --> Q. )
4	3	ad5antr 500	. . . . . . . . 9 |- ( ( ( ( ( ( ph /\ x e. Q. ) /\ j e. N. ) /\ ( *Q ` [ <. j , 1o >. ] ~Q ) <Q x ) /\ k e. N. ) /\ j <N k ) -> F : N. --> Q. )
5		caucvgpr.cau	. . . . . . . . . 10 |- ( 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 ) ) ) ) )
6	5	ad5antr 500	. . . . . . . . 9 |- ( ( ( ( ( ( ph /\ x e. Q. ) /\ j e. N. ) /\ ( *Q ` [ <. j , 1o >. ] ~Q ) <Q x ) /\ k e. N. ) /\ j <N k ) -> 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 ) ) ) ) )
7		caucvgpr.bnd	. . . . . . . . . 10 |- ( ph -> A. j e. N. A <Q ( F ` j ) )
8	7	ad5antr 500	. . . . . . . . 9 |- ( ( ( ( ( ( ph /\ x e. Q. ) /\ j e. N. ) /\ ( *Q ` [ <. j , 1o >. ] ~Q ) <Q x ) /\ k e. N. ) /\ j <N k ) -> A. j e. N. A <Q ( F ` j ) )
9		caucvgpr.lim	. . . . . . . . 9 |- 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 } >.
10		simpr 110	. . . . . . . . . 10 |- ( ( ph /\ x e. Q. ) -> x e. Q. )
11	10	ad4antr 498	. . . . . . . . 9 |- ( ( ( ( ( ( ph /\ x e. Q. ) /\ j e. N. ) /\ ( *Q ` [ <. j , 1o >. ] ~Q ) <Q x ) /\ k e. N. ) /\ j <N k ) -> x e. Q. )
12		simpr 110	. . . . . . . . 9 |- ( ( ( ( ( ( ph /\ x e. Q. ) /\ j e. N. ) /\ ( *Q ` [ <. j , 1o >. ] ~Q ) <Q x ) /\ k e. N. ) /\ j <N k ) -> j <N k )
13		simpllr 540	. . . . . . . . 9 |- ( ( ( ( ( ( ph /\ x e. Q. ) /\ j e. N. ) /\ ( *Q ` [ <. j , 1o >. ] ~Q ) <Q x ) /\ k e. N. ) /\ j <N k ) -> ( *Q ` [ <. j , 1o >. ] ~Q ) <Q x )
14	4, 6, 8, 9, 11, 12, 13	caucvgprlem1 8052	. . . . . . . 8 |- ( ( ( ( ( ( ph /\ x e. Q. ) /\ j e. N. ) /\ ( *Q ` [ <. j , 1o >. ] ~Q ) <Q x ) /\ k e. N. ) /\ j <N k ) -> <. { l | l <Q ( F ` k ) } , { u | ( F ` k ) <Q u } >. <P ( L +P. <. { l | l <Q x } , { u | x <Q u } >. ) )
15	4, 6, 8, 9, 11, 12, 13	caucvgprlem2 8053	. . . . . . . 8 |- ( ( ( ( ( ( ph /\ x e. Q. ) /\ j e. N. ) /\ ( *Q ` [ <. j , 1o >. ] ~Q ) <Q x ) /\ k e. N. ) /\ j <N k ) -> L <P <. { l | l <Q ( ( F ` k ) +Q x ) } , { u | ( ( F ` k ) +Q x ) <Q u } >. )
16	14, 15	jca 306	. . . . . . 7 |- ( ( ( ( ( ( ph /\ x e. Q. ) /\ j e. N. ) /\ ( *Q ` [ <. j , 1o >. ] ~Q ) <Q x ) /\ k e. N. ) /\ j <N k ) -> ( <. { l | l <Q ( F ` k ) } , { u | ( F ` k ) <Q u } >. <P ( L +P. <. { l | l <Q x } , { u | x <Q u } >. ) /\ L <P <. { l | l <Q ( ( F ` k ) +Q x ) } , { u | ( ( F ` k ) +Q x ) <Q u } >. ) )
17	16	ex 115	. . . . . 6 |- ( ( ( ( ( ph /\ x e. Q. ) /\ j e. N. ) /\ ( *Q ` [ <. j , 1o >. ] ~Q ) <Q x ) /\ k e. N. ) -> ( j <N k -> ( <. { l | l <Q ( F ` k ) } , { u | ( F ` k ) <Q u } >. <P ( L +P. <. { l | l <Q x } , { u | x <Q u } >. ) /\ L <P <. { l | l <Q ( ( F ` k ) +Q x ) } , { u | ( ( F ` k ) +Q x ) <Q u } >. ) ) )
18	17	ralrimiva 2623	. . . . 5 |- ( ( ( ( ph /\ x e. Q. ) /\ j e. N. ) /\ ( *Q ` [ <. j , 1o >. ] ~Q ) <Q x ) -> A. k e. N. ( j <N k -> ( <. { l | l <Q ( F ` k ) } , { u | ( F ` k ) <Q u } >. <P ( L +P. <. { l | l <Q x } , { u | x <Q u } >. ) /\ L <P <. { l | l <Q ( ( F ` k ) +Q x ) } , { u | ( ( F ` k ) +Q x ) <Q u } >. ) ) )
19	18	ex 115	. . . 4 |- ( ( ( ph /\ x e. Q. ) /\ j e. N. ) -> ( ( *Q ` [ <. j , 1o >. ] ~Q ) <Q x -> A. k e. N. ( j <N k -> ( <. { l | l <Q ( F ` k ) } , { u | ( F ` k ) <Q u } >. <P ( L +P. <. { l | l <Q x } , { u | x <Q u } >. ) /\ L <P <. { l | l <Q ( ( F ` k ) +Q x ) } , { u | ( ( F ` k ) +Q x ) <Q u } >. ) ) ) )
20	19	reximdva 2652	. . 3 |- ( ( ph /\ x e. Q. ) -> ( E. j e. N. ( *Q ` [ <. j , 1o >. ] ~Q ) <Q x -> E. j e. N. A. k e. N. ( j <N k -> ( <. { l | l <Q ( F ` k ) } , { u | ( F ` k ) <Q u } >. <P ( L +P. <. { l | l <Q x } , { u | x <Q u } >. ) /\ L <P <. { l | l <Q ( ( F ` k ) +Q x ) } , { u | ( ( F ` k ) +Q x ) <Q u } >. ) ) ) )
21	2, 20	mpd 13	. 2 |- ( ( ph /\ x e. Q. ) -> E. j e. N. A. k e. N. ( j <N k -> ( <. { l | l <Q ( F ` k ) } , { u | ( F ` k ) <Q u } >. <P ( L +P. <. { l | l <Q x } , { u | x <Q u } >. ) /\ L <P <. { l | l <Q ( ( F ` k ) +Q x ) } , { u | ( ( F ` k ) +Q x ) <Q u } >. ) ) )
22	21	ralrimiva 2623	1 |- ( ph -> A. x e. Q. E. j e. N. A. k e. N. ( j <N k -> ( <. { l | l <Q ( F ` k ) } , { u | ( F ` k ) <Q u } >. <P ( L +P. <. { l | l <Q x } , { u | x <Q u } >. ) /\ L <P <. { l | l <Q ( ( F ` k ) +Q x ) } , { u | ( ( F ` k ) +Q x ) <Q u } >. ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   {cab 2224   A.wral 2528   E.wrex 2529   {crab 2532   <.cop 3712   class class class wbr 4131   -->wf 5376   ` cfv 5380  (class class class)co 6088   1oc1o 6684   [cec 6809   N.cnpi 7645   <N clti 7648   ~Q ceq 7652   Q.cnq 7653   +Q cplq 7655   *Qcrq 7657   <Q cltq 7658   +P. cpp 7666   <P cltp 7668

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-eprel 4436  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-1o 6691  df-2o 6692  df-oadd 6695  df-omul 6696  df-er 6811  df-ec 6813  df-qs 6817  df-ni 7677  df-pli 7678  df-mi 7679  df-lti 7680  df-plpq 7717  df-mpq 7718  df-enq 7720  df-nqqs 7721  df-plqqs 7722  df-mqqs 7723  df-1nqqs 7724  df-rq 7725  df-ltnqqs 7726  df-enq0 7797  df-nq0 7798  df-0nq0 7799  df-plq0 7800  df-mq0 7801  df-inp 7839  df-iplp 7841  df-iltp 7843

This theorem is used by:  caucvgpr  8055