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

Theorem cauappcvgprlemrnd 7913
Description: Lemma for cauappcvgpr 7925. The putative limit is rounded. (Contributed by Jim Kingdon, 18-Jul-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
cauappcvgprlemrnd  |-  ( ph  ->  ( A. s  e. 
Q.  ( s  e.  ( 1st `  L
)  <->  E. r  e.  Q.  ( s  <Q  r  /\  r  e.  ( 1st `  L ) ) )  /\  A. r  e.  Q.  ( r  e.  ( 2nd `  L
)  <->  E. s  e.  Q.  ( s  <Q  r  /\  s  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 cauappcvgprlemrnd
StepHypRef Expression
1 cauappcvgpr.f . . . . . 6  |-  ( ph  ->  F : Q. --> Q. )
2 cauappcvgpr.app . . . . . 6  |-  ( 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 ) ) ) )
3 cauappcvgpr.bnd . . . . . 6  |-  ( ph  ->  A. p  e.  Q.  A  <Q  ( F `  p ) )
4 cauappcvgpr.lim . . . . . 6  |-  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 } >.
51, 2, 3, 4cauappcvgprlemopl 7909 . . . . 5  |-  ( (
ph  /\  s  e.  ( 1st `  L ) )  ->  E. r  e.  Q.  ( s  <Q 
r  /\  r  e.  ( 1st `  L ) ) )
65ex 115 . . . 4  |-  ( ph  ->  ( s  e.  ( 1st `  L )  ->  E. r  e.  Q.  ( s  <Q  r  /\  r  e.  ( 1st `  L ) ) ) )
71, 2, 3, 4cauappcvgprlemlol 7910 . . . . . 6  |-  ( (
ph  /\  s  <Q  r  /\  r  e.  ( 1st `  L ) )  ->  s  e.  ( 1st `  L ) )
873expib 1233 . . . . 5  |-  ( ph  ->  ( ( s  <Q 
r  /\  r  e.  ( 1st `  L ) )  ->  s  e.  ( 1st `  L ) ) )
98rexlimdvw 2655 . . . 4  |-  ( ph  ->  ( E. r  e. 
Q.  ( s  <Q 
r  /\  r  e.  ( 1st `  L ) )  ->  s  e.  ( 1st `  L ) ) )
106, 9impbid 129 . . 3  |-  ( ph  ->  ( s  e.  ( 1st `  L )  <->  E. r  e.  Q.  ( s  <Q  r  /\  r  e.  ( 1st `  L ) ) ) )
1110ralrimivw 2607 . 2  |-  ( ph  ->  A. s  e.  Q.  ( s  e.  ( 1st `  L )  <->  E. r  e.  Q.  ( s  <Q  r  /\  r  e.  ( 1st `  L ) ) ) )
121, 2, 3, 4cauappcvgprlemopu 7911 . . . . 5  |-  ( (
ph  /\  r  e.  ( 2nd `  L ) )  ->  E. s  e.  Q.  ( s  <Q 
r  /\  s  e.  ( 2nd `  L ) ) )
1312ex 115 . . . 4  |-  ( ph  ->  ( r  e.  ( 2nd `  L )  ->  E. s  e.  Q.  ( s  <Q  r  /\  s  e.  ( 2nd `  L ) ) ) )
141, 2, 3, 4cauappcvgprlemupu 7912 . . . . . 6  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  r  e.  ( 2nd `  L ) )
15143expib 1233 . . . . 5  |-  ( ph  ->  ( ( s  <Q 
r  /\  s  e.  ( 2nd `  L ) )  ->  r  e.  ( 2nd `  L ) ) )
1615rexlimdvw 2655 . . . 4  |-  ( ph  ->  ( E. s  e. 
Q.  ( s  <Q 
r  /\  s  e.  ( 2nd `  L ) )  ->  r  e.  ( 2nd `  L ) ) )
1713, 16impbid 129 . . 3  |-  ( ph  ->  ( r  e.  ( 2nd `  L )  <->  E. s  e.  Q.  ( s  <Q  r  /\  s  e.  ( 2nd `  L ) ) ) )
1817ralrimivw 2607 . 2  |-  ( ph  ->  A. r  e.  Q.  ( r  e.  ( 2nd `  L )  <->  E. s  e.  Q.  ( s  <Q  r  /\  s  e.  ( 2nd `  L ) ) ) )
1911, 18jca 306 1  |-  ( ph  ->  ( A. s  e. 
Q.  ( s  e.  ( 1st `  L
)  <->  E. r  e.  Q.  ( s  <Q  r  /\  r  e.  ( 1st `  L ) ) )  /\  A. r  e.  Q.  ( r  e.  ( 2nd `  L
)  <->  E. s  e.  Q.  ( s  <Q  r  /\  s  e.  ( 2nd `  L ) ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2202   A.wral 2511   E.wrex 2512   {crab 2515   <.cop 3676   class class class wbr 4093   -->wf 5329   ` cfv 5333  (class class class)co 6028   1stc1st 6310   2ndc2nd 6311   Q.cnq 7543    +Q cplq 7545    <Q cltq 7548
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-eprel 4392  df-id 4396  df-po 4399  df-iso 4400  df-iord 4469  df-on 4471  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-irdg 6579  df-1o 6625  df-oadd 6629  df-omul 6630  df-er 6745  df-ec 6747  df-qs 6751  df-ni 7567  df-pli 7568  df-mi 7569  df-lti 7570  df-plpq 7607  df-mpq 7608  df-enq 7610  df-nqqs 7611  df-plqqs 7612  df-mqqs 7613  df-1nqqs 7614  df-rq 7615  df-ltnqqs 7616
This theorem is referenced by:  cauappcvgprlemcl  7916
  Copyright terms: Public domain W3C validator