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

Theorem caucvgprlem1 8052
Description: Lemma for caucvgpr 8055. Part of showing the putative limit to be a limit. (Contributed by Jim Kingdon, 3-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 } >.
caucvgprlemlim.q  |-  ( ph  ->  Q  e.  Q. )
caucvgprlemlim.jk  |-  ( ph  ->  J  <N  K )
caucvgprlemlim.jkq  |-  ( ph  ->  ( *Q `  [ <. J ,  1o >. ]  ~Q  )  <Q  Q )
Assertion
Ref Expression
caucvgprlem1  |-  ( ph  -> 
<. { l  |  l 
<Q  ( F `  K
) } ,  {
u  |  ( F `
 K )  <Q  u } >.  <P  ( L  +P.  <. { l  |  l  <Q  Q } ,  { u  |  Q  <Q  u } >. )
)
Distinct variable groups:    A, j    j, F, l, u    j, K, l, u    Q, j, l, u    Q, k   
j, L, k    u, j    k, F, n    j,
k
Allowed substitution hints:    ph( u,  j,  k,  n,  l)    A( u,  k,  n,  l)    Q( n)    J( u,  j,  k,  n,  l)    K( k,  n)    L( u,  n,  l)

Proof of Theorem caucvgprlem1
StepHypRef Expression
1 caucvgprlemlim.jk . . . . . 6  |-  ( ph  ->  J  <N  K )
2 ltrelpi 7697 . . . . . . 7  |-  <N  C_  ( N.  X.  N. )
32brel 4829 . . . . . 6  |-  ( J 
<N  K  ->  ( J  e.  N.  /\  K  e.  N. ) )
41, 3syl 14 . . . . 5  |-  ( ph  ->  ( J  e.  N.  /\  K  e.  N. )
)
54simprd 114 . . . 4  |-  ( ph  ->  K  e.  N. )
6 caucvgprlemlim.jkq . . . . . 6  |-  ( ph  ->  ( *Q `  [ <. J ,  1o >. ]  ~Q  )  <Q  Q )
71, 6caucvgprlemk 8038 . . . . 5  |-  ( ph  ->  ( *Q `  [ <. K ,  1o >. ]  ~Q  )  <Q  Q )
8 caucvgpr.f . . . . . 6  |-  ( ph  ->  F : N. --> Q. )
98, 5ffvelcdmd 5847 . . . . 5  |-  ( ph  ->  ( F `  K
)  e.  Q. )
10 ltanqi 7775 . . . . 5  |-  ( ( ( *Q `  [ <. K ,  1o >. ]  ~Q  )  <Q  Q  /\  ( F `  K )  e.  Q. )  -> 
( ( F `  K )  +Q  ( *Q `  [ <. K ,  1o >. ]  ~Q  )
)  <Q  ( ( F `
 K )  +Q  Q ) )
117, 9, 10syl2anc 415 . . . 4  |-  ( ph  ->  ( ( F `  K )  +Q  ( *Q `  [ <. K ,  1o >. ]  ~Q  )
)  <Q  ( ( F `
 K )  +Q  Q ) )
12 opeq1 3904 . . . . . . . . 9  |-  ( j  =  K  ->  <. j ,  1o >.  =  <. K ,  1o >. )
1312eceq1d 6847 . . . . . . . 8  |-  ( j  =  K  ->  [ <. j ,  1o >. ]  ~Q  =  [ <. K ,  1o >. ]  ~Q  )
1413fveq2d 5702 . . . . . . 7  |-  ( j  =  K  ->  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  =  ( *Q `  [ <. K ,  1o >. ]  ~Q  ) )
1514oveq2d 6104 . . . . . 6  |-  ( j  =  K  ->  (
( F `  K
)  +Q  ( *Q
`  [ <. j ,  1o >. ]  ~Q  )
)  =  ( ( F `  K )  +Q  ( *Q `  [ <. K ,  1o >. ]  ~Q  ) ) )
16 fveq2 5698 . . . . . . 7  |-  ( j  =  K  ->  ( F `  j )  =  ( F `  K ) )
1716oveq1d 6103 . . . . . 6  |-  ( j  =  K  ->  (
( F `  j
)  +Q  Q )  =  ( ( F `
 K )  +Q  Q ) )
1815, 17breq12d 4144 . . . . 5  |-  ( j  =  K  ->  (
( ( F `  K )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  ( ( F `
 j )  +Q  Q )  <->  ( ( F `  K )  +Q  ( *Q `  [ <. K ,  1o >. ]  ~Q  ) )  <Q 
( ( F `  K )  +Q  Q
) ) )
1918rspcev 2929 . . . 4  |-  ( ( K  e.  N.  /\  ( ( F `  K )  +Q  ( *Q `  [ <. K ,  1o >. ]  ~Q  )
)  <Q  ( ( F `
 K )  +Q  Q ) )  ->  E. j  e.  N.  ( ( F `  K )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  ( ( F `
 j )  +Q  Q ) )
205, 11, 19syl2anc 415 . . 3  |-  ( ph  ->  E. j  e.  N.  ( ( F `  K )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  ( ( F `
 j )  +Q  Q ) )
21 oveq1 6095 . . . . . . . 8  |-  ( l  =  ( F `  K )  ->  (
l  +Q  ( *Q
`  [ <. j ,  1o >. ]  ~Q  )
)  =  ( ( F `  K )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) ) )
2221breq1d 4141 . . . . . . 7  |-  ( l  =  ( F `  K )  ->  (
( l  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  ( ( F `
 j )  +Q  Q )  <->  ( ( F `  K )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
( ( F `  j )  +Q  Q
) ) )
2322rexbidv 2551 . . . . . 6  |-  ( l  =  ( F `  K )  ->  ( E. j  e.  N.  ( l  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  ( ( F `
 j )  +Q  Q )  <->  E. j  e.  N.  ( ( F `
 K )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
( ( F `  j )  +Q  Q
) ) )
2423elrab3 2983 . . . . 5  |-  ( ( F `  K )  e.  Q.  ->  (
( F `  K
)  e.  { l  e.  Q.  |  E. j  e.  N.  (
l  +Q  ( *Q
`  [ <. j ,  1o >. ]  ~Q  )
)  <Q  ( ( F `
 j )  +Q  Q ) }  <->  E. j  e.  N.  ( ( F `
 K )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
( ( F `  j )  +Q  Q
) ) )
259, 24syl 14 . . . 4  |-  ( ph  ->  ( ( F `  K )  e.  {
l  e.  Q.  |  E. j  e.  N.  ( l  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  ( ( F `
 j )  +Q  Q ) }  <->  E. j  e.  N.  ( ( F `
 K )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
( ( F `  j )  +Q  Q
) ) )
26 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  )
) ) ) )
27 caucvgpr.bnd . . . . . 6  |-  ( ph  ->  A. j  e.  N.  A  <Q  ( F `  j ) )
28 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 } >.
29 caucvgprlemlim.q . . . . . 6  |-  ( ph  ->  Q  e.  Q. )
308, 26, 27, 28, 29caucvgprlemladdrl 8051 . . . . 5  |-  ( ph  ->  { l  e.  Q.  |  E. j  e.  N.  ( l  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  ( ( F `
 j )  +Q  Q ) }  C_  ( 1st `  ( L  +P.  <. { l  |  l  <Q  Q } ,  { u  |  Q  <Q  u } >. )
) )
3130sseld 3247 . . . 4  |-  ( ph  ->  ( ( F `  K )  e.  {
l  e.  Q.  |  E. j  e.  N.  ( l  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  ( ( F `
 j )  +Q  Q ) }  ->  ( F `  K )  e.  ( 1st `  ( L  +P.  <. { l  |  l  <Q  Q } ,  { u  |  Q  <Q  u } >. )
) ) )
3225, 31sylbird 170 . . 3  |-  ( ph  ->  ( E. j  e. 
N.  ( ( F `
 K )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
( ( F `  j )  +Q  Q
)  ->  ( F `  K )  e.  ( 1st `  ( L  +P.  <. { l  |  l  <Q  Q } ,  { u  |  Q  <Q  u } >. )
) ) )
3320, 32mpd 13 . 2  |-  ( ph  ->  ( F `  K
)  e.  ( 1st `  ( L  +P.  <. { l  |  l  <Q  Q } ,  { u  |  Q  <Q  u } >. ) ) )
348, 26, 27, 28caucvgprlemcl 8049 . . . 4  |-  ( ph  ->  L  e.  P. )
35 nqprlu 7920 . . . . 5  |-  ( Q  e.  Q.  ->  <. { l  |  l  <Q  Q } ,  { u  |  Q  <Q  u } >.  e.  P. )
3629, 35syl 14 . . . 4  |-  ( ph  -> 
<. { l  |  l 
<Q  Q } ,  {
u  |  Q  <Q  u } >.  e.  P. )
37 addclpr 7910 . . . 4  |-  ( ( L  e.  P.  /\  <. { l  |  l 
<Q  Q } ,  {
u  |  Q  <Q  u } >.  e.  P. )  ->  ( L  +P.  <. { l  |  l 
<Q  Q } ,  {
u  |  Q  <Q  u } >. )  e.  P. )
3834, 36, 37syl2anc 415 . . 3  |-  ( ph  ->  ( L  +P.  <. { l  |  l  <Q  Q } ,  { u  |  Q  <Q  u } >. )  e.  P. )
39 nqprl 7924 . . 3  |-  ( ( ( F `  K
)  e.  Q.  /\  ( L  +P.  <. { l  |  l  <Q  Q } ,  { u  |  Q  <Q  u } >. )  e.  P. )  ->  (
( F `  K
)  e.  ( 1st `  ( L  +P.  <. { l  |  l  <Q  Q } ,  { u  |  Q  <Q  u } >. ) )  <->  <. { l  |  l  <Q  ( F `  K ) } ,  { u  |  ( F `  K )  <Q  u } >.  <P  ( L  +P.  <. { l  |  l 
<Q  Q } ,  {
u  |  Q  <Q  u } >. ) ) )
409, 38, 39syl2anc 415 . 2  |-  ( ph  ->  ( ( F `  K )  e.  ( 1st `  ( L  +P.  <. { l  |  l  <Q  Q } ,  { u  |  Q  <Q  u } >. )
)  <->  <. { l  |  l  <Q  ( F `  K ) } ,  { u  |  ( F `  K )  <Q  u } >.  <P  ( L  +P.  <. { l  |  l  <Q  Q } ,  { u  |  Q  <Q  u } >. )
) )
4133, 40mpbid 147 1  |-  ( ph  -> 
<. { l  |  l 
<Q  ( F `  K
) } ,  {
u  |  ( F `
 K )  <Q  u } >.  <P  ( L  +P.  <. { l  |  l  <Q  Q } ,  { u  |  Q  <Q  u } >. )
)
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = 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   1stc1st 6376   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:  caucvgprlemlim  8054
  Copyright terms: Public domain W3C validator