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

Theorem cauappcvgprlemrnd 7964
Description: Lemma for cauappcvgpr 7976. 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 7960 . . . . 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 7961 . . . . . 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 2664 . . . 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 2616 . 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 7962 . . . . 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 7963 . . . . . 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 2664 . . . 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 2616 . 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 2203   A.wral 2520   E.wrex 2521   {crab 2524   <.cop 3691   class class class wbr 4108   -->wf 5347   ` cfv 5351  (class class class)co 6049   1stc1st 6331   2ndc2nd 6332   Q.cnq 7594    +Q cplq 7596    <Q cltq 7599
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 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-nul 4235  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-iinf 4709
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 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-tr 4208  df-eprel 4409  df-id 4413  df-po 4416  df-iso 4417  df-iord 4486  df-on 4488  df-suc 4491  df-iom 4712  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-ov 6052  df-oprab 6053  df-mpo 6054  df-1st 6333  df-2nd 6334  df-recs 6535  df-irdg 6600  df-1o 6646  df-oadd 6650  df-omul 6651  df-er 6766  df-ec 6768  df-qs 6772  df-ni 7618  df-pli 7619  df-mi 7620  df-lti 7621  df-plpq 7658  df-mpq 7659  df-enq 7661  df-nqqs 7662  df-plqqs 7663  df-mqqs 7664  df-1nqqs 7665  df-rq 7666  df-ltnqqs 7667
This theorem is referenced by:  cauappcvgprlemcl  7967
  Copyright terms: Public domain W3C validator