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

Theorem cauappcvgprlemupu 7762
Description: Lemma for cauappcvgpr 7775. The upper cut of the putative limit is upper. (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
cauappcvgprlemupu  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  r  e.  ( 2nd `  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 cauappcvgprlemupu
StepHypRef Expression
1 ltrelnq 7478 . . . . 5  |-  <Q  C_  ( Q.  X.  Q. )
21brel 4727 . . . 4  |-  ( s 
<Q  r  ->  ( s  e.  Q.  /\  r  e.  Q. ) )
32simprd 114 . . 3  |-  ( s 
<Q  r  ->  r  e. 
Q. )
433ad2ant2 1022 . 2  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  r  e.  Q. )
5 breq2 4048 . . . . . . 7  |-  ( u  =  s  ->  (
( ( F `  q )  +Q  q
)  <Q  u  <->  ( ( F `  q )  +Q  q )  <Q  s
) )
65rexbidv 2507 . . . . . 6  |-  ( u  =  s  ->  ( E. q  e.  Q.  ( ( F `  q )  +Q  q
)  <Q  u  <->  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  s
) )
7 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 } >.
87fveq2i 5579 . . . . . . 7  |-  ( 2nd `  L )  =  ( 2nd `  <. { 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 } >. )
9 nqex 7476 . . . . . . . . 9  |-  Q.  e.  _V
109rabex 4188 . . . . . . . 8  |-  { l  e.  Q.  |  E. q  e.  Q.  (
l  +Q  q ) 
<Q  ( F `  q
) }  e.  _V
119rabex 4188 . . . . . . . 8  |-  { u  e.  Q.  |  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  u }  e.  _V
1210, 11op2nd 6233 . . . . . . 7  |-  ( 2nd `  <. { 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 } >. )  =  {
u  e.  Q.  |  E. q  e.  Q.  ( ( F `  q )  +Q  q
)  <Q  u }
138, 12eqtri 2226 . . . . . 6  |-  ( 2nd `  L )  =  {
u  e.  Q.  |  E. q  e.  Q.  ( ( F `  q )  +Q  q
)  <Q  u }
146, 13elrab2 2932 . . . . 5  |-  ( s  e.  ( 2nd `  L
)  <->  ( s  e. 
Q.  /\  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  s
) )
1514simprbi 275 . . . 4  |-  ( s  e.  ( 2nd `  L
)  ->  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  s
)
16153ad2ant3 1023 . . 3  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  s
)
17 ltsonq 7511 . . . . . . 7  |-  <Q  Or  Q.
1817, 1sotri 5078 . . . . . 6  |-  ( ( ( ( F `  q )  +Q  q
)  <Q  s  /\  s  <Q  r )  ->  (
( F `  q
)  +Q  q ) 
<Q  r )
1918expcom 116 . . . . 5  |-  ( s 
<Q  r  ->  ( ( ( F `  q
)  +Q  q ) 
<Q  s  ->  ( ( F `  q )  +Q  q )  <Q 
r ) )
20193ad2ant2 1022 . . . 4  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  ( (
( F `  q
)  +Q  q ) 
<Q  s  ->  ( ( F `  q )  +Q  q )  <Q 
r ) )
2120reximdv 2607 . . 3  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  ( E. q  e.  Q.  (
( F `  q
)  +Q  q ) 
<Q  s  ->  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  r
) )
2216, 21mpd 13 . 2  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  r
)
23 breq2 4048 . . . 4  |-  ( u  =  r  ->  (
( ( F `  q )  +Q  q
)  <Q  u  <->  ( ( F `  q )  +Q  q )  <Q  r
) )
2423rexbidv 2507 . . 3  |-  ( u  =  r  ->  ( E. q  e.  Q.  ( ( F `  q )  +Q  q
)  <Q  u  <->  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  r
) )
2524, 13elrab2 2932 . 2  |-  ( r  e.  ( 2nd `  L
)  <->  ( r  e. 
Q.  /\  E. q  e.  Q.  ( ( F `
 q )  +Q  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 981    = wceq 1373    e. wcel 2176   A.wral 2484   E.wrex 2485   {crab 2488   <.cop 3636   class class class wbr 4044   -->wf 5267   ` cfv 5271  (class class class)co 5944   2ndc2nd 6225   Q.cnq 7393    +Q cplq 7395    <Q cltq 7398
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 615  ax-in2 616  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-coll 4159  ax-sep 4162  ax-nul 4170  ax-pow 4218  ax-pr 4253  ax-un 4480  ax-setind 4585  ax-iinf 4636
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-ral 2489  df-rex 2490  df-reu 2491  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3461  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-int 3886  df-iun 3929  df-br 4045  df-opab 4106  df-mpt 4107  df-tr 4143  df-eprel 4336  df-id 4340  df-po 4343  df-iso 4344  df-iord 4413  df-on 4415  df-suc 4418  df-iom 4639  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688  df-iota 5232  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-ov 5947  df-oprab 5948  df-mpo 5949  df-1st 6226  df-2nd 6227  df-recs 6391  df-irdg 6456  df-oadd 6506  df-omul 6507  df-er 6620  df-ec 6622  df-qs 6626  df-ni 7417  df-mi 7419  df-lti 7420  df-enq 7460  df-nqqs 7461  df-ltnqqs 7466
This theorem is referenced by:  cauappcvgprlemrnd  7763
  Copyright terms: Public domain W3C validator