Theorem caucvgprprlemupu 7004

Description: Lemma for caucvgprpr 7016. The upper cut of the putative limit is upper. (Contributed by Jim Kingdon, 21-Dec-2020.)

Hypotheses

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

Assertion

Ref	Expression
caucvgprprlemupu	|- ( ( ph /\ s <Q t /\ s e. ( 2nd ` L ) ) -> t e. ( 2nd ` L ) )

Distinct variable groups:   A, m   m, F   F, l, r, s   u, F, r, s   L, s   p, l, q, t, r, s   u, p, q, t   ph, r, s

Allowed substitution hints:   ph( u, t, k, m, n, q, p, l)   A( u, t, k, n, s, r, q, p, l)   F( t, k, n, q, p)   L( u, t, k, m, n, r, q, p, l)

Proof of Theorem caucvgprprlemupu

Dummy variable b is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ltrelnq 6669	. . . . 5 |- <Q C_ ( Q. X. Q. )
2	1	brel 4438	. . . 4 |- ( s <Q t -> ( s e. Q. /\ t e. Q. ) )
3	2	simprd 112	. . 3 |- ( s <Q t -> t e. Q. )
4	3	3ad2ant2 961	. 2 |- ( ( ph /\ s <Q t /\ s e. ( 2nd ` L ) ) -> t e. Q. )
5		caucvgprpr.lim	. . . . . 6 |- L = <. { l e. Q. | E. r e. N. <. { p | p <Q ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) } , { u e. Q. | E. r e. N. ( ( F ` r ) +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q u } , { q | u <Q q } >. } >.
6	5	caucvgprprlemelu 6990	. . . . 5 |- ( s e. ( 2nd ` L ) <-> ( s e. Q. /\ E. b e. N. ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q s } , { q | s <Q q } >. ) )
7	6	simprbi 269	. . . 4 |- ( s e. ( 2nd ` L ) -> E. b e. N. ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q s } , { q | s <Q q } >. )
8	7	3ad2ant3 962	. . 3 |- ( ( ph /\ s <Q t /\ s e. ( 2nd ` L ) ) -> E. b e. N. ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q s } , { q | s <Q q } >. )
9		ltnqpri 6898	. . . . . 6 |- ( s <Q t -> <. { p | p <Q s } , { q | s <Q q } >. <P <. { p | p <Q t } , { q | t <Q q } >. )
10	9	3ad2ant2 961	. . . . 5 |- ( ( ph /\ s <Q t /\ s e. ( 2nd ` L ) ) -> <. { p | p <Q s } , { q | s <Q q } >. <P <. { p | p <Q t } , { q | t <Q q } >. )
11		ltsopr 6900	. . . . . . 7 |- <P Or P.
12		ltrelpr 6809	. . . . . . 7 |- <P C_ ( P. X. P. )
13	11, 12	sotri 4770	. . . . . 6 |- ( ( ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q s } , { q | s <Q q } >. /\ <. { p | p <Q s } , { q | s <Q q } >. <P <. { p | p <Q t } , { q | t <Q q } >. ) -> ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q t } , { q | t <Q q } >. )
14	13	expcom 114	. . . . 5 |- ( <. { p | p <Q s } , { q | s <Q q } >. <P <. { p | p <Q t } , { q | t <Q q } >. -> ( ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q s } , { q | s <Q q } >. -> ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q t } , { q | t <Q q } >. ) )
15	10, 14	syl 14	. . . 4 |- ( ( ph /\ s <Q t /\ s e. ( 2nd ` L ) ) -> ( ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q s } , { q | s <Q q } >. -> ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q t } , { q | t <Q q } >. ) )
16	15	reximdv 2467	. . 3 |- ( ( ph /\ s <Q t /\ s e. ( 2nd ` L ) ) -> ( E. b e. N. ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q s } , { q | s <Q q } >. -> E. b e. N. ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q t } , { q | t <Q q } >. ) )
17	8, 16	mpd 13	. 2 |- ( ( ph /\ s <Q t /\ s e. ( 2nd ` L ) ) -> E. b e. N. ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q t } , { q | t <Q q } >. )
18	5	caucvgprprlemelu 6990	. 2 |- ( t e. ( 2nd ` L ) <-> ( t e. Q. /\ E. b e. N. ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q t } , { q | t <Q q } >. ) )
19	4, 17, 18	sylanbrc 408	1 |- ( ( ph /\ s <Q t /\ s e. ( 2nd ` L ) ) -> t e. ( 2nd ` L ) )

Syntax hints:   -> wi 4   /\ wa 102   /\ w3a 920   = wceq 1285   e. wcel 1434   {cab 2069   A.wral 2353   E.wrex 2354   {crab 2357   <.cop 3419   class class class wbr 3805   -->wf 4948   ` cfv 4952  (class class class)co 5563   2ndc2nd 5817   1oc1o 6078   [cec 6191   N.cnpi 6576   <N clti 6579   ~Q ceq 6583   Q.cnq 6584   +Q cplq 6586   *Qcrq 6588   <Q cltq 6589   P.cnp 6595   +P. cpp 6597   <P cltp 6599

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 577  ax-in2 578  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-13 1445  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065  ax-coll 3913  ax-sep 3916  ax-nul 3924  ax-pow 3968  ax-pr 3992  ax-un 4216  ax-setind 4308  ax-iinf 4357

This theorem depends on definitions:  df-bi 115  df-dc 777  df-3or 921  df-3an 922  df-tru 1288  df-fal 1291  df-nf 1391  df-sb 1688  df-eu 1946  df-mo 1947  df-clab 2070  df-cleq 2076  df-clel 2079  df-nfc 2212  df-ne 2250  df-ral 2358  df-rex 2359  df-reu 2360  df-rab 2362  df-v 2612  df-sbc 2825  df-csb 2918  df-dif 2984  df-un 2986  df-in 2988  df-ss 2995  df-nul 3268  df-pw 3402  df-sn 3422  df-pr 3423  df-op 3425  df-uni 3622  df-int 3657  df-iun 3700  df-br 3806  df-opab 3860  df-mpt 3861  df-tr 3896  df-eprel 4072  df-id 4076  df-po 4079  df-iso 4080  df-iord 4149  df-on 4151  df-suc 4154  df-iom 4360  df-xp 4397  df-rel 4398  df-cnv 4399  df-co 4400  df-dm 4401  df-rn 4402  df-res 4403  df-ima 4404  df-iota 4917  df-fun 4954  df-fn 4955  df-f 4956  df-f1 4957  df-fo 4958  df-f1o 4959  df-fv 4960  df-ov 5566  df-oprab 5567  df-mpt2 5568  df-1st 5818  df-2nd 5819  df-recs 5974  df-irdg 6039  df-1o 6085  df-oadd 6089  df-omul 6090  df-er 6193  df-ec 6195  df-qs 6199  df-ni 6608  df-pli 6609  df-mi 6610  df-lti 6611  df-plpq 6648  df-mpq 6649  df-enq 6651  df-nqqs 6652  df-plqqs 6653  df-mqqs 6654  df-1nqqs 6655  df-rq 6656  df-ltnqqs 6657  df-inp 6770  df-iltp 6774

This theorem is referenced by:  caucvgprprlemrnd  7005