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

Theorem caucvgprlemopu 8044
Description: Lemma for caucvgpr 8055. The upper cut of the putative limit is open. (Contributed by Jim Kingdon, 20-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
caucvgprlemopu  |-  ( (
ph  /\  r  e.  ( 2nd `  L ) )  ->  E. s  e.  Q.  ( s  <Q 
r  /\  s  e.  ( 2nd `  L ) ) )
Distinct variable groups:    A, j    F, l, r, s    u, F   
j, L, r, s   
j, l, s    ph, j,
r, s    u, j,
r, s
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 caucvgprlemopu
StepHypRef Expression
1 breq2 4135 . . . . . 6  |-  ( u  =  r  ->  (
( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  u  <->  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
r ) )
21rexbidv 2551 . . . . 5  |-  ( u  =  r  ->  ( E. j  e.  N.  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  u  <->  E. j  e.  N.  ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
r ) )
3 caucvgpr.lim . . . . . . 7  |-  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 } >.
43fveq2i 5701 . . . . . 6  |-  ( 2nd `  L )  =  ( 2nd `  <. { 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 nqex 7736 . . . . . . . 8  |-  Q.  e.  _V
65rabex 4282 . . . . . . 7  |-  { l  e.  Q.  |  E. j  e.  N.  (
l  +Q  ( *Q
`  [ <. j ,  1o >. ]  ~Q  )
)  <Q  ( F `  j ) }  e.  _V
75rabex 4282 . . . . . . 7  |-  { u  e.  Q.  |  E. j  e.  N.  ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q  u }  e.  _V
86, 7op2nd 6385 . . . . . 6  |-  ( 2nd `  <. { 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 } >. )  =  { u  e. 
Q.  |  E. j  e.  N.  ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q  u }
94, 8eqtri 2259 . . . . 5  |-  ( 2nd `  L )  =  {
u  e.  Q.  |  E. j  e.  N.  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  u }
102, 9elrab2 2985 . . . 4  |-  ( r  e.  ( 2nd `  L
)  <->  ( r  e. 
Q.  /\  E. j  e.  N.  ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
r ) )
1110simprbi 275 . . 3  |-  ( r  e.  ( 2nd `  L
)  ->  E. j  e.  N.  ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
r )
1211adantl 277 . 2  |-  ( (
ph  /\  r  e.  ( 2nd `  L ) )  ->  E. j  e.  N.  ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
r )
13 simprr 537 . . . 4  |-  ( ( ( ph  /\  r  e.  ( 2nd `  L
) )  /\  (
j  e.  N.  /\  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  r ) )  ->  ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
r )
14 ltbtwnnqq 7788 . . . 4  |-  ( ( ( F `  j
)  +Q  ( *Q
`  [ <. j ,  1o >. ]  ~Q  )
)  <Q  r  <->  E. s  e.  Q.  ( ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) ) 
<Q  s  /\  s  <Q  r ) )
1513, 14sylib 122 . . 3  |-  ( ( ( ph  /\  r  e.  ( 2nd `  L
) )  /\  (
j  e.  N.  /\  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  r ) )  ->  E. s  e.  Q.  ( ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
s  /\  s  <Q  r ) )
16 simprr 537 . . . . . 6  |-  ( ( ( ( ( ph  /\  r  e.  ( 2nd `  L ) )  /\  ( j  e.  N.  /\  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  r ) )  /\  s  e.  Q. )  /\  ( ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) ) 
<Q  s  /\  s  <Q  r ) )  -> 
s  <Q  r )
17 simplr 533 . . . . . . 7  |-  ( ( ( ( ( ph  /\  r  e.  ( 2nd `  L ) )  /\  ( j  e.  N.  /\  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  r ) )  /\  s  e.  Q. )  /\  ( ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) ) 
<Q  s  /\  s  <Q  r ) )  -> 
s  e.  Q. )
18 simplrl 541 . . . . . . . . 9  |-  ( ( ( ( ph  /\  r  e.  ( 2nd `  L ) )  /\  ( j  e.  N.  /\  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  r ) )  /\  s  e.  Q. )  ->  j  e.  N. )
1918adantr 276 . . . . . . . 8  |-  ( ( ( ( ( ph  /\  r  e.  ( 2nd `  L ) )  /\  ( j  e.  N.  /\  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  r ) )  /\  s  e.  Q. )  /\  ( ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) ) 
<Q  s  /\  s  <Q  r ) )  -> 
j  e.  N. )
20 simprl 535 . . . . . . . 8  |-  ( ( ( ( ( ph  /\  r  e.  ( 2nd `  L ) )  /\  ( j  e.  N.  /\  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  r ) )  /\  s  e.  Q. )  /\  ( ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) ) 
<Q  s  /\  s  <Q  r ) )  -> 
( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  s )
21 rspe 2599 . . . . . . . 8  |-  ( ( j  e.  N.  /\  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  s )  ->  E. j  e.  N.  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  s )
2219, 20, 21syl2anc 415 . . . . . . 7  |-  ( ( ( ( ( ph  /\  r  e.  ( 2nd `  L ) )  /\  ( j  e.  N.  /\  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  r ) )  /\  s  e.  Q. )  /\  ( ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) ) 
<Q  s  /\  s  <Q  r ) )  ->  E. j  e.  N.  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  s )
23 breq2 4135 . . . . . . . . 9  |-  ( u  =  s  ->  (
( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  u  <->  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
s ) )
2423rexbidv 2551 . . . . . . . 8  |-  ( u  =  s  ->  ( E. j  e.  N.  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  u  <->  E. j  e.  N.  ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
s ) )
2524, 9elrab2 2985 . . . . . . 7  |-  ( s  e.  ( 2nd `  L
)  <->  ( s  e. 
Q.  /\  E. j  e.  N.  ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
s ) )
2617, 22, 25sylanbrc 421 . . . . . 6  |-  ( ( ( ( ( ph  /\  r  e.  ( 2nd `  L ) )  /\  ( j  e.  N.  /\  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  r ) )  /\  s  e.  Q. )  /\  ( ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) ) 
<Q  s  /\  s  <Q  r ) )  -> 
s  e.  ( 2nd `  L ) )
2716, 26jca 306 . . . . 5  |-  ( ( ( ( ( ph  /\  r  e.  ( 2nd `  L ) )  /\  ( j  e.  N.  /\  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  r ) )  /\  s  e.  Q. )  /\  ( ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) ) 
<Q  s  /\  s  <Q  r ) )  -> 
( s  <Q  r  /\  s  e.  ( 2nd `  L ) ) )
2827ex 115 . . . 4  |-  ( ( ( ( ph  /\  r  e.  ( 2nd `  L ) )  /\  ( j  e.  N.  /\  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  r ) )  /\  s  e.  Q. )  ->  ( ( ( ( F `  j
)  +Q  ( *Q
`  [ <. j ,  1o >. ]  ~Q  )
)  <Q  s  /\  s  <Q  r )  ->  (
s  <Q  r  /\  s  e.  ( 2nd `  L
) ) ) )
2928reximdva 2652 . . 3  |-  ( ( ( ph  /\  r  e.  ( 2nd `  L
) )  /\  (
j  e.  N.  /\  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  r ) )  ->  ( E. s  e.  Q.  ( ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) ) 
<Q  s  /\  s  <Q  r )  ->  E. s  e.  Q.  ( s  <Q 
r  /\  s  e.  ( 2nd `  L ) ) ) )
3015, 29mpd 13 . 2  |-  ( ( ( ph  /\  r  e.  ( 2nd `  L
) )  /\  (
j  e.  N.  /\  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  r ) )  ->  E. s  e.  Q.  ( s  <Q  r  /\  s  e.  ( 2nd `  L ) ) )
3112, 30rexlimddv 2673 1  |-  ( (
ph  /\  r  e.  ( 2nd `  L ) )  ->  E. s  e.  Q.  ( s  <Q 
r  /\  s  e.  ( 2nd `  L ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   A.wral 2528   E.wrex 2529   {crab 2532   <.cop 3712   class class class wbr 4131   -->wf 5376   ` cfv 5380  (class class class)co 6088   2ndc2nd 6377   1oc1o 6684   [cec 6809   N.cnpi 7645    <N clti 7648    ~Q ceq 7652   Q.cnq 7653    +Q cplq 7655   *Qcrq 7657    <Q cltq 7658
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-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
This theorem is used by:  caucvgprlemrnd  8046
  Copyright terms: Public domain W3C validator