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

Theorem cauappcvgprlemcl 6843
Description: Lemma for cauappcvgpr 6852. The putative limit is a positive real. (Contributed by Jim Kingdon, 20-Jun-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
cauappcvgprlemcl  |-  ( ph  ->  L  e.  P. )
Distinct variable groups:    A, p    L, p, q    ph, p, q    F, l, u, p, q
Allowed substitution hints:    ph( u, l)    A( u, q, l)    L( u, l)

Proof of Theorem cauappcvgprlemcl
Dummy variables  r  s are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cauappcvgpr.f . . . 4  |-  ( ph  ->  F : Q. --> Q. )
2 cauappcvgpr.app . . . 4  |-  ( 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 . . . 4  |-  ( ph  ->  A. p  e.  Q.  A  <Q  ( F `  p ) )
4 cauappcvgpr.lim . . . 4  |-  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, 4cauappcvgprlemm 6835 . . 3  |-  ( ph  ->  ( E. s  e. 
Q.  s  e.  ( 1st `  L )  /\  E. r  e. 
Q.  r  e.  ( 2nd `  L ) ) )
6 ssrab2 3079 . . . . . 6  |-  { l  e.  Q.  |  E. q  e.  Q.  (
l  +Q  q ) 
<Q  ( F `  q
) }  C_  Q.
7 nqex 6553 . . . . . . 7  |-  Q.  e.  _V
87elpw2 3932 . . . . . 6  |-  ( { l  e.  Q.  |  E. q  e.  Q.  ( l  +Q  q
)  <Q  ( F `  q ) }  e.  ~P Q.  <->  { l  e.  Q.  |  E. q  e.  Q.  ( l  +Q  q
)  <Q  ( F `  q ) }  C_  Q. )
96, 8mpbir 144 . . . . 5  |-  { l  e.  Q.  |  E. q  e.  Q.  (
l  +Q  q ) 
<Q  ( F `  q
) }  e.  ~P Q.
10 ssrab2 3079 . . . . . 6  |-  { u  e.  Q.  |  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  u }  C_  Q.
117elpw2 3932 . . . . . 6  |-  ( { u  e.  Q.  |  E. q  e.  Q.  ( ( F `  q )  +Q  q
)  <Q  u }  e.  ~P Q.  <->  { u  e.  Q.  |  E. q  e.  Q.  ( ( F `  q )  +Q  q
)  <Q  u }  C_  Q. )
1210, 11mpbir 144 . . . . 5  |-  { u  e.  Q.  |  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  u }  e.  ~P Q.
13 opelxpi 4394 . . . . 5  |-  ( ( { l  e.  Q.  |  E. q  e.  Q.  ( l  +Q  q
)  <Q  ( F `  q ) }  e.  ~P Q.  /\  { u  e.  Q.  |  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  u }  e.  ~P Q. )  ->  <. { 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 } >.  e.  ( ~P Q.  X.  ~P Q. ) )
149, 12, 13mp2an 416 . . . 4  |-  <. { 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 } >.  e.  ( ~P Q.  X.  ~P Q. )
154, 14eqeltri 2151 . . 3  |-  L  e.  ( ~P Q.  X.  ~P Q. )
165, 15jctil 305 . 2  |-  ( ph  ->  ( L  e.  ( ~P Q.  X.  ~P Q. )  /\  ( E. s  e.  Q.  s  e.  ( 1st `  L )  /\  E. r  e.  Q.  r  e.  ( 2nd `  L
) ) ) )
171, 2, 3, 4cauappcvgprlemrnd 6840 . . 3  |-  ( 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 ) ) ) ) )
181, 2, 3, 4cauappcvgprlemdisj 6841 . . 3  |-  ( ph  ->  A. s  e.  Q.  -.  ( s  e.  ( 1st `  L )  /\  s  e.  ( 2nd `  L ) ) )
191, 2, 3, 4cauappcvgprlemloc 6842 . . 3  |-  ( ph  ->  A. s  e.  Q.  A. r  e.  Q.  (
s  <Q  r  ->  (
s  e.  ( 1st `  L )  \/  r  e.  ( 2nd `  L
) ) ) )
2017, 18, 193jca 1118 . 2  |-  ( 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 ) ) ) )  /\  A. s  e.  Q.  -.  (
s  e.  ( 1st `  L )  /\  s  e.  ( 2nd `  L
) )  /\  A. s  e.  Q.  A. r  e.  Q.  ( s  <Q 
r  ->  ( s  e.  ( 1st `  L
)  \/  r  e.  ( 2nd `  L
) ) ) ) )
21 elnp1st2nd 6666 . 2  |-  ( L  e.  P.  <->  ( ( L  e.  ( ~P Q.  X.  ~P Q. )  /\  ( E. s  e. 
Q.  s  e.  ( 1st `  L )  /\  E. r  e. 
Q.  r  e.  ( 2nd `  L ) ) )  /\  (
( 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 ) ) ) )  /\  A. s  e.  Q.  -.  (
s  e.  ( 1st `  L )  /\  s  e.  ( 2nd `  L
) )  /\  A. s  e.  Q.  A. r  e.  Q.  ( s  <Q 
r  ->  ( s  e.  ( 1st `  L
)  \/  r  e.  ( 2nd `  L
) ) ) ) ) )
2216, 20, 21sylanbrc 408 1  |-  ( ph  ->  L  e.  P. )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 102    <-> wb 103    \/ wo 661    /\ w3a 919    = wceq 1284    e. wcel 1433   A.wral 2348   E.wrex 2349   {crab 2352    C_ wss 2973   ~Pcpw 3382   <.cop 3401   class class class wbr 3785    X. cxp 4361   -->wf 4918   ` cfv 4922  (class class class)co 5532   1stc1st 5785   2ndc2nd 5786   Q.cnq 6470    +Q cplq 6472    <Q cltq 6475   P.cnp 6481
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-coll 3893  ax-sep 3896  ax-nul 3904  ax-pow 3948  ax-pr 3964  ax-un 4188  ax-setind 4280  ax-iinf 4329
This theorem depends on definitions:  df-bi 115  df-dc 776  df-3or 920  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-ral 2353  df-rex 2354  df-reu 2355  df-rab 2357  df-v 2603  df-sbc 2816  df-csb 2909  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-nul 3252  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-int 3637  df-iun 3680  df-br 3786  df-opab 3840  df-mpt 3841  df-tr 3876  df-eprel 4044  df-id 4048  df-po 4051  df-iso 4052  df-iord 4121  df-on 4123  df-suc 4126  df-iom 4332  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-1st 5787  df-2nd 5788  df-recs 5943  df-irdg 5980  df-1o 6024  df-oadd 6028  df-omul 6029  df-er 6129  df-ec 6131  df-qs 6135  df-ni 6494  df-pli 6495  df-mi 6496  df-lti 6497  df-plpq 6534  df-mpq 6535  df-enq 6537  df-nqqs 6538  df-plqqs 6539  df-mqqs 6540  df-1nqqs 6541  df-rq 6542  df-ltnqqs 6543  df-inp 6656
This theorem is referenced by:  cauappcvgprlemladdfu  6844  cauappcvgprlemladdfl  6845  cauappcvgprlemladdru  6846  cauappcvgprlemladdrl  6847  cauappcvgprlemladd  6848  cauappcvgprlem1  6849  cauappcvgprlem2  6850  cauappcvgpr  6852
  Copyright terms: Public domain W3C validator