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

Theorem cauappcvgprlemcl 7461
Description: Lemma for cauappcvgpr 7470. 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 7453 . . 3  |-  ( ph  ->  ( E. s  e. 
Q.  s  e.  ( 1st `  L )  /\  E. r  e. 
Q.  r  e.  ( 2nd `  L ) ) )
6 ssrab2 3182 . . . . . 6  |-  { l  e.  Q.  |  E. q  e.  Q.  (
l  +Q  q ) 
<Q  ( F `  q
) }  C_  Q.
7 nqex 7171 . . . . . . 7  |-  Q.  e.  _V
87elpw2 4082 . . . . . 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 145 . . . . 5  |-  { l  e.  Q.  |  E. q  e.  Q.  (
l  +Q  q ) 
<Q  ( F `  q
) }  e.  ~P Q.
10 ssrab2 3182 . . . . . 6  |-  { u  e.  Q.  |  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  u }  C_  Q.
117elpw2 4082 . . . . . 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 145 . . . . 5  |-  { u  e.  Q.  |  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  u }  e.  ~P Q.
13 opelxpi 4571 . . . . 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 422 . . . 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 2212 . . 3  |-  L  e.  ( ~P Q.  X.  ~P Q. )
165, 15jctil 310 . 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 7458 . . 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 7459 . . 3  |-  ( ph  ->  A. s  e.  Q.  -.  ( s  e.  ( 1st `  L )  /\  s  e.  ( 2nd `  L ) ) )
191, 2, 3, 4cauappcvgprlemloc 7460 . . 3  |-  ( ph  ->  A. s  e.  Q.  A. r  e.  Q.  (
s  <Q  r  ->  (
s  e.  ( 1st `  L )  \/  r  e.  ( 2nd `  L
) ) ) )
2017, 18, 193jca 1161 . 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 7284 . 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 413 1  |-  ( ph  ->  L  e.  P. )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    <-> wb 104    \/ wo 697    /\ w3a 962    = wceq 1331    e. wcel 1480   A.wral 2416   E.wrex 2417   {crab 2420    C_ wss 3071   ~Pcpw 3510   <.cop 3530   class class class wbr 3929    X. cxp 4537   -->wf 5119   ` cfv 5123  (class class class)co 5774   1stc1st 6036   2ndc2nd 6037   Q.cnq 7088    +Q cplq 7090    <Q cltq 7093   P.cnp 7099
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-nul 4054  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-iinf 4502
This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-tr 4027  df-eprel 4211  df-id 4215  df-po 4218  df-iso 4219  df-iord 4288  df-on 4290  df-suc 4293  df-iom 4505  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039  df-recs 6202  df-irdg 6267  df-1o 6313  df-oadd 6317  df-omul 6318  df-er 6429  df-ec 6431  df-qs 6435  df-ni 7112  df-pli 7113  df-mi 7114  df-lti 7115  df-plpq 7152  df-mpq 7153  df-enq 7155  df-nqqs 7156  df-plqqs 7157  df-mqqs 7158  df-1nqqs 7159  df-rq 7160  df-ltnqqs 7161  df-inp 7274
This theorem is referenced by:  cauappcvgprlemladdfu  7462  cauappcvgprlemladdfl  7463  cauappcvgprlemladdru  7464  cauappcvgprlemladdrl  7465  cauappcvgprlemladd  7466  cauappcvgprlem1  7467  cauappcvgprlem2  7468  cauappcvgpr  7470
  Copyright terms: Public domain W3C validator