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

Theorem cauappcvgprlemlol 7588
Description: Lemma for cauappcvgpr 7603. The lower cut of the putative limit is lower. (Contributed by Jim Kingdon, 4-Aug-2020.)
Hypotheses
Ref Expression
cauappcvgpr.f  |-  ( ph  ->  F : Q. --> Q. )
cauappcvgpr.app  |-  ( ph  ->  A. p  e.  Q.  A. q  e.  Q.  (
( F `  p
)  <Q  ( ( F `
 q )  +Q  ( p  +Q  q
) )  /\  ( F `  q )  <Q  ( ( F `  p )  +Q  (
p  +Q  q ) ) ) )
cauappcvgpr.bnd  |-  ( ph  ->  A. p  e.  Q.  A  <Q  ( F `  p ) )
cauappcvgpr.lim  |-  L  = 
<. { l  e.  Q.  |  E. q  e.  Q.  ( l  +Q  q
)  <Q  ( F `  q ) } ,  { u  e.  Q.  |  E. q  e.  Q.  ( ( F `  q )  +Q  q
)  <Q  u } >.
Assertion
Ref Expression
cauappcvgprlemlol  |-  ( (
ph  /\  s  <Q  r  /\  r  e.  ( 1st `  L ) )  ->  s  e.  ( 1st `  L ) )
Distinct variable groups:    A, p    L, p, q    ph, p, q    L, r, s    A, s, p    F, l, u, p, q, r, s    ph, r,
s
Allowed substitution hints:    ph( u, l)    A( u, r, q, l)    L( u, l)

Proof of Theorem cauappcvgprlemlol
Dummy variables  f  g  h are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ltrelnq 7306 . . . . 5  |-  <Q  C_  ( Q.  X.  Q. )
21brel 4656 . . . 4  |-  ( s 
<Q  r  ->  ( s  e.  Q.  /\  r  e.  Q. ) )
32simpld 111 . . 3  |-  ( s 
<Q  r  ->  s  e. 
Q. )
433ad2ant2 1009 . 2  |-  ( (
ph  /\  s  <Q  r  /\  r  e.  ( 1st `  L ) )  ->  s  e.  Q. )
5 oveq1 5849 . . . . . . . 8  |-  ( l  =  r  ->  (
l  +Q  q )  =  ( r  +Q  q ) )
65breq1d 3992 . . . . . . 7  |-  ( l  =  r  ->  (
( l  +Q  q
)  <Q  ( F `  q )  <->  ( r  +Q  q )  <Q  ( F `  q )
) )
76rexbidv 2467 . . . . . 6  |-  ( l  =  r  ->  ( E. q  e.  Q.  ( l  +Q  q
)  <Q  ( F `  q )  <->  E. q  e.  Q.  ( r  +Q  q )  <Q  ( F `  q )
) )
8 cauappcvgpr.lim . . . . . . . 8  |-  L  = 
<. { l  e.  Q.  |  E. q  e.  Q.  ( l  +Q  q
)  <Q  ( F `  q ) } ,  { u  e.  Q.  |  E. q  e.  Q.  ( ( F `  q )  +Q  q
)  <Q  u } >.
98fveq2i 5489 . . . . . . 7  |-  ( 1st `  L )  =  ( 1st `  <. { l  e.  Q.  |  E. q  e.  Q.  (
l  +Q  q ) 
<Q  ( F `  q
) } ,  {
u  e.  Q.  |  E. q  e.  Q.  ( ( F `  q )  +Q  q
)  <Q  u } >. )
10 nqex 7304 . . . . . . . . 9  |-  Q.  e.  _V
1110rabex 4126 . . . . . . . 8  |-  { l  e.  Q.  |  E. q  e.  Q.  (
l  +Q  q ) 
<Q  ( F `  q
) }  e.  _V
1210rabex 4126 . . . . . . . 8  |-  { u  e.  Q.  |  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  u }  e.  _V
1311, 12op1st 6114 . . . . . . 7  |-  ( 1st `  <. { l  e. 
Q.  |  E. q  e.  Q.  ( l  +Q  q )  <Q  ( F `  q ) } ,  { u  e.  Q.  |  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  u } >. )  =  {
l  e.  Q.  |  E. q  e.  Q.  ( l  +Q  q
)  <Q  ( F `  q ) }
149, 13eqtri 2186 . . . . . 6  |-  ( 1st `  L )  =  {
l  e.  Q.  |  E. q  e.  Q.  ( l  +Q  q
)  <Q  ( F `  q ) }
157, 14elrab2 2885 . . . . 5  |-  ( r  e.  ( 1st `  L
)  <->  ( r  e. 
Q.  /\  E. q  e.  Q.  ( r  +Q  q )  <Q  ( F `  q )
) )
1615simprbi 273 . . . 4  |-  ( r  e.  ( 1st `  L
)  ->  E. q  e.  Q.  ( r  +Q  q )  <Q  ( F `  q )
)
17163ad2ant3 1010 . . 3  |-  ( (
ph  /\  s  <Q  r  /\  r  e.  ( 1st `  L ) )  ->  E. q  e.  Q.  ( r  +Q  q )  <Q  ( F `  q )
)
18 simpll2 1027 . . . . . . 7  |-  ( ( ( ( ph  /\  s  <Q  r  /\  r  e.  ( 1st `  L
) )  /\  q  e.  Q. )  /\  (
r  +Q  q ) 
<Q  ( F `  q
) )  ->  s  <Q  r )
19 ltanqg 7341 . . . . . . . . 9  |-  ( ( f  e.  Q.  /\  g  e.  Q.  /\  h  e.  Q. )  ->  (
f  <Q  g  <->  ( h  +Q  f )  <Q  (
h  +Q  g ) ) )
2019adantl 275 . . . . . . . 8  |-  ( ( ( ( ( ph  /\  s  <Q  r  /\  r  e.  ( 1st `  L ) )  /\  q  e.  Q. )  /\  ( r  +Q  q
)  <Q  ( F `  q ) )  /\  ( f  e.  Q.  /\  g  e.  Q.  /\  h  e.  Q. )
)  ->  ( f  <Q  g  <->  ( h  +Q  f )  <Q  (
h  +Q  g ) ) )
214ad2antrr 480 . . . . . . . 8  |-  ( ( ( ( ph  /\  s  <Q  r  /\  r  e.  ( 1st `  L
) )  /\  q  e.  Q. )  /\  (
r  +Q  q ) 
<Q  ( F `  q
) )  ->  s  e.  Q. )
222simprd 113 . . . . . . . . . 10  |-  ( s 
<Q  r  ->  r  e. 
Q. )
23223ad2ant2 1009 . . . . . . . . 9  |-  ( (
ph  /\  s  <Q  r  /\  r  e.  ( 1st `  L ) )  ->  r  e.  Q. )
2423ad2antrr 480 . . . . . . . 8  |-  ( ( ( ( ph  /\  s  <Q  r  /\  r  e.  ( 1st `  L
) )  /\  q  e.  Q. )  /\  (
r  +Q  q ) 
<Q  ( F `  q
) )  ->  r  e.  Q. )
25 simplr 520 . . . . . . . 8  |-  ( ( ( ( ph  /\  s  <Q  r  /\  r  e.  ( 1st `  L
) )  /\  q  e.  Q. )  /\  (
r  +Q  q ) 
<Q  ( F `  q
) )  ->  q  e.  Q. )
26 addcomnqg 7322 . . . . . . . . 9  |-  ( ( f  e.  Q.  /\  g  e.  Q. )  ->  ( f  +Q  g
)  =  ( g  +Q  f ) )
2726adantl 275 . . . . . . . 8  |-  ( ( ( ( ( ph  /\  s  <Q  r  /\  r  e.  ( 1st `  L ) )  /\  q  e.  Q. )  /\  ( r  +Q  q
)  <Q  ( F `  q ) )  /\  ( f  e.  Q.  /\  g  e.  Q. )
)  ->  ( f  +Q  g )  =  ( g  +Q  f ) )
2820, 21, 24, 25, 27caovord2d 6011 . . . . . . 7  |-  ( ( ( ( ph  /\  s  <Q  r  /\  r  e.  ( 1st `  L
) )  /\  q  e.  Q. )  /\  (
r  +Q  q ) 
<Q  ( F `  q
) )  ->  (
s  <Q  r  <->  ( s  +Q  q )  <Q  (
r  +Q  q ) ) )
2918, 28mpbid 146 . . . . . 6  |-  ( ( ( ( ph  /\  s  <Q  r  /\  r  e.  ( 1st `  L
) )  /\  q  e.  Q. )  /\  (
r  +Q  q ) 
<Q  ( F `  q
) )  ->  (
s  +Q  q ) 
<Q  ( r  +Q  q
) )
30 ltsonq 7339 . . . . . . 7  |-  <Q  Or  Q.
3130, 1sotri 4999 . . . . . 6  |-  ( ( ( s  +Q  q
)  <Q  ( r  +Q  q )  /\  (
r  +Q  q ) 
<Q  ( F `  q
) )  ->  (
s  +Q  q ) 
<Q  ( F `  q
) )
3229, 31sylancom 417 . . . . 5  |-  ( ( ( ( ph  /\  s  <Q  r  /\  r  e.  ( 1st `  L
) )  /\  q  e.  Q. )  /\  (
r  +Q  q ) 
<Q  ( F `  q
) )  ->  (
s  +Q  q ) 
<Q  ( F `  q
) )
3332ex 114 . . . 4  |-  ( ( ( ph  /\  s  <Q  r  /\  r  e.  ( 1st `  L
) )  /\  q  e.  Q. )  ->  (
( r  +Q  q
)  <Q  ( F `  q )  ->  (
s  +Q  q ) 
<Q  ( F `  q
) ) )
3433reximdva 2568 . . 3  |-  ( (
ph  /\  s  <Q  r  /\  r  e.  ( 1st `  L ) )  ->  ( E. q  e.  Q.  (
r  +Q  q ) 
<Q  ( F `  q
)  ->  E. q  e.  Q.  ( s  +Q  q )  <Q  ( F `  q )
) )
3517, 34mpd 13 . 2  |-  ( (
ph  /\  s  <Q  r  /\  r  e.  ( 1st `  L ) )  ->  E. q  e.  Q.  ( s  +Q  q )  <Q  ( F `  q )
)
36 oveq1 5849 . . . . 5  |-  ( l  =  s  ->  (
l  +Q  q )  =  ( s  +Q  q ) )
3736breq1d 3992 . . . 4  |-  ( l  =  s  ->  (
( l  +Q  q
)  <Q  ( F `  q )  <->  ( s  +Q  q )  <Q  ( F `  q )
) )
3837rexbidv 2467 . . 3  |-  ( l  =  s  ->  ( E. q  e.  Q.  ( l  +Q  q
)  <Q  ( F `  q )  <->  E. q  e.  Q.  ( s  +Q  q )  <Q  ( F `  q )
) )
3938, 14elrab2 2885 . 2  |-  ( s  e.  ( 1st `  L
)  <->  ( s  e. 
Q.  /\  E. q  e.  Q.  ( s  +Q  q )  <Q  ( F `  q )
) )
404, 35, 39sylanbrc 414 1  |-  ( (
ph  /\  s  <Q  r  /\  r  e.  ( 1st `  L ) )  ->  s  e.  ( 1st `  L ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    /\ w3a 968    = wceq 1343    e. wcel 2136   A.wral 2444   E.wrex 2445   {crab 2448   <.cop 3579   class class class wbr 3982   -->wf 5184   ` cfv 5188  (class class class)co 5842   1stc1st 6106   Q.cnq 7221    +Q cplq 7223    <Q cltq 7226
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 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-coll 4097  ax-sep 4100  ax-nul 4108  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-iinf 4565
This theorem depends on definitions:  df-bi 116  df-dc 825  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-ral 2449  df-rex 2450  df-reu 2451  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-tr 4081  df-eprel 4267  df-id 4271  df-po 4274  df-iso 4275  df-iord 4344  df-on 4346  df-suc 4349  df-iom 4568  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-recs 6273  df-irdg 6338  df-oadd 6388  df-omul 6389  df-er 6501  df-ec 6503  df-qs 6507  df-ni 7245  df-pli 7246  df-mi 7247  df-lti 7248  df-plpq 7285  df-enq 7288  df-nqqs 7289  df-plqqs 7290  df-ltnqqs 7294
This theorem is referenced by:  cauappcvgprlemrnd  7591
  Copyright terms: Public domain W3C validator