ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  caucvgprprlemlim Unicode version

Theorem caucvgprprlemlim 8084
Description: Lemma for caucvgprpr 8085. The putative limit is a limit. (Contributed by Jim Kingdon, 21-Nov-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
caucvgprprlemlim  |-  ( ph  ->  A. x  e.  P.  E. j  e.  N.  A. k  e.  N.  (
j  <N  k  ->  (
( F `  k
)  <P  ( L  +P.  x )  /\  L  <P  ( ( F `  k )  +P.  x
) ) ) )
Distinct variable groups:    A, m    m, F    A, r, j    u, F, r, l, k, n    ph, k, r    k, L   
j, k, ph, x    k, l, u, p, q, r    j, r, x   
q, l, r    u, p, q, r    m, r   
k, n, u, l   
j, l, u    n, r
Allowed substitution hints:    ph( u,  m,  n,  q,  p,  l)    A( x,  u,  k,  n,  q,  p,  l)    F( x,  j,  q,  p)    L( x,  u,  j,  m,  n,  r,  q,  p,  l)

Proof of Theorem caucvgprprlemlim
StepHypRef Expression
1 archrecpr 8037 . . . 4  |-  ( x  e.  P.  ->  E. j  e.  N.  <. { l  |  l  <Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  u } >.  <P  x )
21adantl 277 . . 3  |-  ( (
ph  /\  x  e.  P. )  ->  E. j  e.  N.  <. { l  |  l  <Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  u } >.  <P  x )
3 caucvgprpr.f . . . . . . . . . 10  |-  ( ph  ->  F : N. --> P. )
43ad5antr 500 . . . . . . . . 9  |-  ( ( ( ( ( (
ph  /\  x  e.  P. )  /\  j  e.  N. )  /\  <. { l  |  l  <Q 
( *Q `  [ <. j ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  u } >.  <P  x
)  /\  k  e.  N. )  /\  j  <N  k )  ->  F : N. --> P. )
5 caucvgprpr.cau . . . . . . . . . 10  |-  ( 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 } >. )
) ) )
65ad5antr 500 . . . . . . . . 9  |-  ( ( ( ( ( (
ph  /\  x  e.  P. )  /\  j  e.  N. )  /\  <. { l  |  l  <Q 
( *Q `  [ <. j ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  u } >.  <P  x
)  /\  k  e.  N. )  /\  j  <N  k )  ->  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 } >. )
) ) )
7 caucvgprpr.bnd . . . . . . . . . 10  |-  ( ph  ->  A. m  e.  N.  A  <P  ( F `  m ) )
87ad5antr 500 . . . . . . . . 9  |-  ( ( ( ( ( (
ph  /\  x  e.  P. )  /\  j  e.  N. )  /\  <. { l  |  l  <Q 
( *Q `  [ <. j ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  u } >.  <P  x
)  /\  k  e.  N. )  /\  j  <N  k )  ->  A. m  e.  N.  A  <P  ( F `  m )
)
9 caucvgprpr.lim . . . . . . . . 9  |-  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 } >. } >.
10 simpr 110 . . . . . . . . . 10  |-  ( (
ph  /\  x  e.  P. )  ->  x  e. 
P. )
1110ad4antr 498 . . . . . . . . 9  |-  ( ( ( ( ( (
ph  /\  x  e.  P. )  /\  j  e.  N. )  /\  <. { l  |  l  <Q 
( *Q `  [ <. j ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  u } >.  <P  x
)  /\  k  e.  N. )  /\  j  <N  k )  ->  x  e.  P. )
12 simpr 110 . . . . . . . . 9  |-  ( ( ( ( ( (
ph  /\  x  e.  P. )  /\  j  e.  N. )  /\  <. { l  |  l  <Q 
( *Q `  [ <. j ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  u } >.  <P  x
)  /\  k  e.  N. )  /\  j  <N  k )  ->  j  <N  k )
13 simpllr 540 . . . . . . . . 9  |-  ( ( ( ( ( (
ph  /\  x  e.  P. )  /\  j  e.  N. )  /\  <. { l  |  l  <Q 
( *Q `  [ <. j ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  u } >.  <P  x
)  /\  k  e.  N. )  /\  j  <N  k )  ->  <. { l  |  l  <Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  u } >.  <P  x )
144, 6, 8, 9, 11, 12, 13caucvgprprlem1 8082 . . . . . . . 8  |-  ( ( ( ( ( (
ph  /\  x  e.  P. )  /\  j  e.  N. )  /\  <. { l  |  l  <Q 
( *Q `  [ <. j ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  u } >.  <P  x
)  /\  k  e.  N. )  /\  j  <N  k )  ->  ( F `  k )  <P  ( L  +P.  x
) )
154, 6, 8, 9, 11, 12, 13caucvgprprlem2 8083 . . . . . . . 8  |-  ( ( ( ( ( (
ph  /\  x  e.  P. )  /\  j  e.  N. )  /\  <. { l  |  l  <Q 
( *Q `  [ <. j ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  u } >.  <P  x
)  /\  k  e.  N. )  /\  j  <N  k )  ->  L  <P  ( ( F `  k )  +P.  x
) )
1614, 15jca 306 . . . . . . 7  |-  ( ( ( ( ( (
ph  /\  x  e.  P. )  /\  j  e.  N. )  /\  <. { l  |  l  <Q 
( *Q `  [ <. j ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  u } >.  <P  x
)  /\  k  e.  N. )  /\  j  <N  k )  ->  (
( F `  k
)  <P  ( L  +P.  x )  /\  L  <P  ( ( F `  k )  +P.  x
) ) )
1716ex 115 . . . . . 6  |-  ( ( ( ( ( ph  /\  x  e.  P. )  /\  j  e.  N. )  /\  <. { l  |  l  <Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  u } >.  <P  x )  /\  k  e.  N. )  ->  ( j  <N  k  ->  ( ( F `  k )  <P  ( L  +P.  x )  /\  L  <P  ( ( F `
 k )  +P.  x ) ) ) )
1817ralrimiva 2623 . . . . 5  |-  ( ( ( ( ph  /\  x  e.  P. )  /\  j  e.  N. )  /\  <. { l  |  l  <Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  u } >.  <P  x )  ->  A. k  e.  N.  ( j  <N  k  ->  ( ( F `  k )  <P  ( L  +P.  x )  /\  L  <P  ( ( F `
 k )  +P.  x ) ) ) )
1918ex 115 . . . 4  |-  ( ( ( ph  /\  x  e.  P. )  /\  j  e.  N. )  ->  ( <. { l  |  l 
<Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  u } >.  <P  x  ->  A. k  e.  N.  ( j  <N  k  ->  ( ( F `  k )  <P  ( L  +P.  x )  /\  L  <P  ( ( F `
 k )  +P.  x ) ) ) ) )
2019reximdva 2652 . . 3  |-  ( (
ph  /\  x  e.  P. )  ->  ( E. j  e.  N.  <. { l  |  l  <Q 
( *Q `  [ <. j ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  u } >.  <P  x  ->  E. j  e.  N.  A. k  e.  N.  (
j  <N  k  ->  (
( F `  k
)  <P  ( L  +P.  x )  /\  L  <P  ( ( F `  k )  +P.  x
) ) ) ) )
212, 20mpd 13 . 2  |-  ( (
ph  /\  x  e.  P. )  ->  E. j  e.  N.  A. k  e. 
N.  ( j  <N 
k  ->  ( ( F `  k )  <P  ( L  +P.  x
)  /\  L  <P  ( ( F `  k
)  +P.  x )
) ) )
2221ralrimiva 2623 1  |-  ( ph  ->  A. x  e.  P.  E. j  e.  N.  A. k  e.  N.  (
j  <N  k  ->  (
( F `  k
)  <P  ( L  +P.  x )  /\  L  <P  ( ( F `  k )  +P.  x
) ) ) )
Colors of variables:    wff set class
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.cnp 7664    +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:  caucvgprpr  8085
  Copyright terms: Public domain W3C validator