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

Theorem cauappcvgprlemrnd 8017
Description: Lemma for cauappcvgpr 8029. 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 8013 . . . . 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 8014 . . . . . 6  |-  ( (
ph  /\  s  <Q  r  /\  r  e.  ( 1st `  L ) )  ->  s  e.  ( 1st `  L ) )
873expib 1237 . . . . 5  |-  ( ph  ->  ( ( s  <Q 
r  /\  r  e.  ( 1st `  L ) )  ->  s  e.  ( 1st `  L ) ) )
98rexlimdvw 2672 . . . 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 2624 . 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 8015 . . . . 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 8016 . . . . . 6  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  r  e.  ( 2nd `  L ) )
15143expib 1237 . . . . 5  |-  ( ph  ->  ( ( s  <Q 
r  /\  s  e.  ( 2nd `  L ) )  ->  r  e.  ( 2nd `  L ) ) )
1615rexlimdvw 2672 . . . 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 2624 . 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
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   A.wral 2528   E.wrex 2529   {crab 2532   <.cop 3712   class class class wbr 4130   -->wf 5373   ` cfv 5377  (class class class)co 6085   1stc1st 6372   2ndc2nd 6373   Q.cnq 7647    +Q cplq 7649    <Q cltq 7652
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-eprel 4434  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-1o 6687  df-oadd 6691  df-omul 6692  df-er 6807  df-ec 6809  df-qs 6813  df-ni 7671  df-pli 7672  df-mi 7673  df-lti 7674  df-plpq 7711  df-mpq 7712  df-enq 7714  df-nqqs 7715  df-plqqs 7716  df-mqqs 7717  df-1nqqs 7718  df-rq 7719  df-ltnqqs 7720
This theorem is used by:  cauappcvgprlemcl  8020
  Copyright terms: Public domain W3C validator