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

Theorem caucvgprlemupu 7448
Description: Lemma for caucvgpr 7458. 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 7141 . . . . 5  |-  <Q  C_  ( Q.  X.  Q. )
21brel 4561 . . . 4  |-  ( s 
<Q  r  ->  ( s  e.  Q.  /\  r  e.  Q. ) )
32simprd 113 . . 3  |-  ( s 
<Q  r  ->  r  e. 
Q. )
433ad2ant2 988 . 2  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  r  e.  Q. )
5 breq2 3903 . . . . . . 7  |-  ( u  =  s  ->  (
( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  u  <->  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
s ) )
65rexbidv 2415 . . . . . 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 5392 . . . . . . 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 7139 . . . . . . . . 9  |-  Q.  e.  _V
109rabex 4042 . . . . . . . 8  |-  { l  e.  Q.  |  E. j  e.  N.  (
l  +Q  ( *Q
`  [ <. j ,  1o >. ]  ~Q  )
)  <Q  ( F `  j ) }  e.  _V
119rabex 4042 . . . . . . . 8  |-  { u  e.  Q.  |  E. j  e.  N.  ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q  u }  e.  _V
1210, 11op2nd 6013 . . . . . . 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 2138 . . . . . 6  |-  ( 2nd `  L )  =  {
u  e.  Q.  |  E. j  e.  N.  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  u }
146, 13elrab2 2816 . . . . 5  |-  ( s  e.  ( 2nd `  L
)  <->  ( s  e. 
Q.  /\  E. j  e.  N.  ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
s ) )
1514simprbi 273 . . . 4  |-  ( s  e.  ( 2nd `  L
)  ->  E. j  e.  N.  ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
s )
16153ad2ant3 989 . . 3  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  E. j  e.  N.  ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
s )
17 ltsonq 7174 . . . . . . 7  |-  <Q  Or  Q.
1817, 1sotri 4904 . . . . . 6  |-  ( ( ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  s  /\  s  <Q  r )  ->  (
( F `  j
)  +Q  ( *Q
`  [ <. j ,  1o >. ]  ~Q  )
)  <Q  r )
1918expcom 115 . . . . 5  |-  ( s 
<Q  r  ->  ( ( ( F `  j
)  +Q  ( *Q
`  [ <. j ,  1o >. ]  ~Q  )
)  <Q  s  ->  (
( F `  j
)  +Q  ( *Q
`  [ <. j ,  1o >. ]  ~Q  )
)  <Q  r ) )
20193ad2ant2 988 . . . 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 2510 . . 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 3903 . . . 4  |-  ( u  =  r  ->  (
( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  )
)  <Q  u  <->  ( ( F `  j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
r ) )
2423rexbidv 2415 . . 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 2816 . 2  |-  ( r  e.  ( 2nd `  L
)  <->  ( r  e. 
Q.  /\  E. j  e.  N.  ( ( F `
 j )  +Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) )  <Q 
r ) )
264, 22, 25sylanbrc 413 1  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  r  e.  ( 2nd `  L ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    /\ w3a 947    = wceq 1316    e. wcel 1465   A.wral 2393   E.wrex 2394   {crab 2397   <.cop 3500   class class class wbr 3899   -->wf 5089   ` cfv 5093  (class class class)co 5742   2ndc2nd 6005   1oc1o 6274   [cec 6395   N.cnpi 7048    <N clti 7051    ~Q ceq 7055   Q.cnq 7056    +Q cplq 7058   *Qcrq 7060    <Q cltq 7061
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 588  ax-in2 589  ax-io 683  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-10 1468  ax-11 1469  ax-i12 1470  ax-bndl 1471  ax-4 1472  ax-13 1476  ax-14 1477  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500  ax-ext 2099  ax-coll 4013  ax-sep 4016  ax-nul 4024  ax-pow 4068  ax-pr 4101  ax-un 4325  ax-setind 4422  ax-iinf 4472
This theorem depends on definitions:  df-bi 116  df-dc 805  df-3or 948  df-3an 949  df-tru 1319  df-fal 1322  df-nf 1422  df-sb 1721  df-eu 1980  df-mo 1981  df-clab 2104  df-cleq 2110  df-clel 2113  df-nfc 2247  df-ne 2286  df-ral 2398  df-rex 2399  df-reu 2400  df-rab 2402  df-v 2662  df-sbc 2883  df-csb 2976  df-dif 3043  df-un 3045  df-in 3047  df-ss 3054  df-nul 3334  df-pw 3482  df-sn 3503  df-pr 3504  df-op 3506  df-uni 3707  df-int 3742  df-iun 3785  df-br 3900  df-opab 3960  df-mpt 3961  df-tr 3997  df-eprel 4181  df-id 4185  df-po 4188  df-iso 4189  df-iord 4258  df-on 4260  df-suc 4263  df-iom 4475  df-xp 4515  df-rel 4516  df-cnv 4517  df-co 4518  df-dm 4519  df-rn 4520  df-res 4521  df-ima 4522  df-iota 5058  df-fun 5095  df-fn 5096  df-f 5097  df-f1 5098  df-fo 5099  df-f1o 5100  df-fv 5101  df-ov 5745  df-oprab 5746  df-mpo 5747  df-1st 6006  df-2nd 6007  df-recs 6170  df-irdg 6235  df-oadd 6285  df-omul 6286  df-er 6397  df-ec 6399  df-qs 6403  df-ni 7080  df-mi 7082  df-lti 7083  df-enq 7123  df-nqqs 7124  df-ltnqqs 7129
This theorem is referenced by:  caucvgprlemrnd  7449
  Copyright terms: Public domain W3C validator