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

Theorem caucvgprlemupu 7670
Description: Lemma for caucvgpr 7680. The upper cut of the putative limit is upper. (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
caucvgprlemupu  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  r  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 caucvgprlemupu
StepHypRef Expression
1 ltrelnq 7363 . . . . 5  |-  <Q  C_  ( Q.  X.  Q. )
21brel 4678 . . . 4  |-  ( s 
<Q  r  ->  ( s  e.  Q.  /\  r  e.  Q. ) )
32simprd 114 . . 3  |-  ( s 
<Q  r  ->  r  e. 
Q. )
433ad2ant2 1019 . 2  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  r  e.  Q. )
5 breq2 4007 . . . . . . 7  |-  ( u  =  s  ->  (
( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  u  <->  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
s ) )
65rexbidv 2478 . . . . . 6  |-  ( 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 ) )
7 caucvgpr.lim . . . . . . . 8  |-  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 } >.
87fveq2i 5518 . . . . . . 7  |-  ( 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 } >. )
9 nqex 7361 . . . . . . . . 9  |-  Q.  e.  _V
109rabex 4147 . . . . . . . 8  |-  { l  e.  Q.  |  E. j  e.  N.  (
l  +Q  ( *Q
`  [ <. j ,  1o >. ]  ~Q  )
)  <Q  ( F `  j ) }  e.  _V
119rabex 4147 . . . . . . . 8  |-  { u  e.  Q.  |  E. j  e.  N.  ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q  u }  e.  _V
1210, 11op2nd 6147 . . . . . . 7  |-  ( 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 }
138, 12eqtri 2198 . . . . . 6  |-  ( 2nd `  L )  =  {
u  e.  Q.  |  E. j  e.  N.  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  u }
146, 13elrab2 2896 . . . . 5  |-  ( s  e.  ( 2nd `  L
)  <->  ( s  e. 
Q.  /\  E. j  e.  N.  ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
s ) )
1514simprbi 275 . . . 4  |-  ( s  e.  ( 2nd `  L
)  ->  E. j  e.  N.  ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
s )
16153ad2ant3 1020 . . 3  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  E. j  e.  N.  ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
s )
17 ltsonq 7396 . . . . . . 7  |-  <Q  Or  Q.
1817, 1sotri 5024 . . . . . 6  |-  ( ( ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  s  /\  s  <Q  r )  ->  (
( F `  j
)  +Q  ( *Q
`  [ <. j ,  1o >. ]  ~Q  )
)  <Q  r )
1918expcom 116 . . . . 5  |-  ( s 
<Q  r  ->  ( ( ( F `  j
)  +Q  ( *Q
`  [ <. j ,  1o >. ]  ~Q  )
)  <Q  s  ->  (
( F `  j
)  +Q  ( *Q
`  [ <. j ,  1o >. ]  ~Q  )
)  <Q  r ) )
20193ad2ant2 1019 . . . 4  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  ( (
( F `  j
)  +Q  ( *Q
`  [ <. j ,  1o >. ]  ~Q  )
)  <Q  s  ->  (
( F `  j
)  +Q  ( *Q
`  [ <. j ,  1o >. ]  ~Q  )
)  <Q  r ) )
2120reximdv 2578 . . 3  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  ( E. j  e.  N.  (
( F `  j
)  +Q  ( *Q
`  [ <. j ,  1o >. ]  ~Q  )
)  <Q  s  ->  E. j  e.  N.  ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
r ) )
2216, 21mpd 13 . 2  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  E. j  e.  N.  ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
r )
23 breq2 4007 . . . 4  |-  ( u  =  r  ->  (
( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  u  <->  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
r ) )
2423rexbidv 2478 . . 3  |-  ( 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 ) )
2524, 13elrab2 2896 . 2  |-  ( r  e.  ( 2nd `  L
)  <->  ( r  e. 
Q.  /\  E. j  e.  N.  ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
r ) )
264, 22, 25sylanbrc 417 1  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  r  e.  ( 2nd `  L ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 978    = wceq 1353    e. wcel 2148   A.wral 2455   E.wrex 2456   {crab 2459   <.cop 3595   class class class wbr 4003   -->wf 5212   ` cfv 5216  (class class class)co 5874   2ndc2nd 6139   1oc1o 6409   [cec 6532   N.cnpi 7270    <N clti 7273    ~Q ceq 7277   Q.cnq 7278    +Q cplq 7280   *Qcrq 7282    <Q cltq 7283
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4118  ax-sep 4121  ax-nul 4129  ax-pow 4174  ax-pr 4209  ax-un 4433  ax-setind 4536  ax-iinf 4587
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-int 3845  df-iun 3888  df-br 4004  df-opab 4065  df-mpt 4066  df-tr 4102  df-eprel 4289  df-id 4293  df-po 4296  df-iso 4297  df-iord 4366  df-on 4368  df-suc 4371  df-iom 4590  df-xp 4632  df-rel 4633  df-cnv 4634  df-co 4635  df-dm 4636  df-rn 4637  df-res 4638  df-ima 4639  df-iota 5178  df-fun 5218  df-fn 5219  df-f 5220  df-f1 5221  df-fo 5222  df-f1o 5223  df-fv 5224  df-ov 5877  df-oprab 5878  df-mpo 5879  df-1st 6140  df-2nd 6141  df-recs 6305  df-irdg 6370  df-oadd 6420  df-omul 6421  df-er 6534  df-ec 6536  df-qs 6540  df-ni 7302  df-mi 7304  df-lti 7305  df-enq 7345  df-nqqs 7346  df-ltnqqs 7351
This theorem is referenced by:  caucvgprlemrnd  7671
  Copyright terms: Public domain W3C validator