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

Theorem cauappcvgprlemcl 8020
Description: Lemma for cauappcvgpr 8029. 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 8012 . . 3  |-  ( ph  ->  ( E. s  e. 
Q.  s  e.  ( 1st `  L )  /\  E. r  e. 
Q.  r  e.  ( 2nd `  L ) ) )
6 ssrab2 3333 . . . . . 6  |-  { l  e.  Q.  |  E. q  e.  Q.  (
l  +Q  q ) 
<Q  ( F `  q
) }  C_  Q.
7 nqex 7730 . . . . . . 7  |-  Q.  e.  _V
87elpw2 4293 . . . . . 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 146 . . . . 5  |-  { l  e.  Q.  |  E. q  e.  Q.  (
l  +Q  q ) 
<Q  ( F `  q
) }  e.  ~P Q.
10 ssrab2 3333 . . . . . 6  |-  { u  e.  Q.  |  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  u }  C_  Q.
117elpw2 4293 . . . . . 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 146 . . . . 5  |-  { u  e.  Q.  |  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  u }  e.  ~P Q.
13 opelxpi 4806 . . . . 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 430 . . . 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 2311 . . 3  |-  L  e.  ( ~P Q.  X.  ~P Q. )
165, 15jctil 312 . 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 8017 . . 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 8018 . . 3  |-  ( ph  ->  A. s  e.  Q.  -.  ( s  e.  ( 1st `  L )  /\  s  e.  ( 2nd `  L ) ) )
191, 2, 3, 4cauappcvgprlemloc 8019 . . 3  |-  ( ph  ->  A. s  e.  Q.  A. r  e.  Q.  (
s  <Q  r  ->  (
s  e.  ( 1st `  L )  \/  r  e.  ( 2nd `  L
) ) ) )
2017, 18, 193jca 1208 . 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 7843 . 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 421 1  |-  ( ph  ->  L  e.  P. )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 720    /\ w3a 1009    = wceq 1402    e. wcel 2209   A.wral 2528   E.wrex 2529   {crab 2532    C_ wss 3220   ~Pcpw 3688   <.cop 3712   class class class wbr 4130    X. cxp 4772   -->wf 5373   ` cfv 5377  (class class class)co 6085   1stc1st 6372   2ndc2nd 6373   Q.cnq 7647    +Q cplq 7649    <Q cltq 7652   P.cnp 7658
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  df-inp 7833
This theorem is used by:  cauappcvgprlemladdfu  8021  cauappcvgprlemladdfl  8022  cauappcvgprlemladdru  8023  cauappcvgprlemladdrl  8024  cauappcvgprlemladd  8025  cauappcvgprlem1  8026  cauappcvgprlem2  8027  cauappcvgpr  8029
  Copyright terms: Public domain W3C validator