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

Theorem cauappcvgprlemopu 7965
Description: Lemma for cauappcvgpr 7979. The upper cut of the putative limit is open. (Contributed by Jim Kingdon, 4-Aug-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
cauappcvgprlemopu  |-  ( (
ph  /\  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 cauappcvgprlemopu
StepHypRef Expression
1 breq2 4115 . . . . . 6  |-  ( u  =  r  ->  (
( ( F `  q )  +Q  q
)  <Q  u  <->  ( ( F `  q )  +Q  q )  <Q  r
) )
21rexbidv 2545 . . . . 5  |-  ( u  =  r  ->  ( E. q  e.  Q.  ( ( F `  q )  +Q  q
)  <Q  u  <->  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  r
) )
3 cauappcvgpr.lim . . . . . . 7  |-  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 } >.
43fveq2i 5675 . . . . . 6  |-  ( 2nd `  L )  =  ( 2nd `  <. { 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 } >. )
5 nqex 7680 . . . . . . . 8  |-  Q.  e.  _V
65rabex 4258 . . . . . . 7  |-  { l  e.  Q.  |  E. q  e.  Q.  (
l  +Q  q ) 
<Q  ( F `  q
) }  e.  _V
75rabex 4258 . . . . . . 7  |-  { u  e.  Q.  |  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  u }  e.  _V
86, 7op2nd 6343 . . . . . 6  |-  ( 2nd `  <. { 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 } >. )  =  {
u  e.  Q.  |  E. q  e.  Q.  ( ( F `  q )  +Q  q
)  <Q  u }
94, 8eqtri 2255 . . . . 5  |-  ( 2nd `  L )  =  {
u  e.  Q.  |  E. q  e.  Q.  ( ( F `  q )  +Q  q
)  <Q  u }
102, 9elrab2 2978 . . . 4  |-  ( r  e.  ( 2nd `  L
)  <->  ( r  e. 
Q.  /\  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  r
) )
1110simprbi 275 . . 3  |-  ( r  e.  ( 2nd `  L
)  ->  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  r
)
1211adantl 277 . 2  |-  ( (
ph  /\  r  e.  ( 2nd `  L ) )  ->  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  r
)
13 simprr 533 . . . 4  |-  ( ( ( ph  /\  r  e.  ( 2nd `  L
) )  /\  (
q  e.  Q.  /\  ( ( F `  q )  +Q  q
)  <Q  r ) )  ->  ( ( F `
 q )  +Q  q )  <Q  r
)
14 ltbtwnnqq 7732 . . . 4  |-  ( ( ( F `  q
)  +Q  q ) 
<Q  r  <->  E. s  e.  Q.  ( ( ( F `
 q )  +Q  q )  <Q  s  /\  s  <Q  r ) )
1513, 14sylib 122 . . 3  |-  ( ( ( ph  /\  r  e.  ( 2nd `  L
) )  /\  (
q  e.  Q.  /\  ( ( F `  q )  +Q  q
)  <Q  r ) )  ->  E. s  e.  Q.  ( ( ( F `
 q )  +Q  q )  <Q  s  /\  s  <Q  r ) )
16 simprr 533 . . . . . 6  |-  ( ( ( ( ( ph  /\  r  e.  ( 2nd `  L ) )  /\  ( q  e.  Q.  /\  ( ( F `  q )  +Q  q
)  <Q  r ) )  /\  s  e.  Q. )  /\  ( ( ( F `  q )  +Q  q )  <Q 
s  /\  s  <Q  r ) )  ->  s  <Q  r )
17 simplr 529 . . . . . . 7  |-  ( ( ( ( ( ph  /\  r  e.  ( 2nd `  L ) )  /\  ( q  e.  Q.  /\  ( ( F `  q )  +Q  q
)  <Q  r ) )  /\  s  e.  Q. )  /\  ( ( ( F `  q )  +Q  q )  <Q 
s  /\  s  <Q  r ) )  ->  s  e.  Q. )
18 simplrl 537 . . . . . . . . 9  |-  ( ( ( ( ph  /\  r  e.  ( 2nd `  L ) )  /\  ( q  e.  Q.  /\  ( ( F `  q )  +Q  q
)  <Q  r ) )  /\  s  e.  Q. )  ->  q  e.  Q. )
1918adantr 276 . . . . . . . 8  |-  ( ( ( ( ( ph  /\  r  e.  ( 2nd `  L ) )  /\  ( q  e.  Q.  /\  ( ( F `  q )  +Q  q
)  <Q  r ) )  /\  s  e.  Q. )  /\  ( ( ( F `  q )  +Q  q )  <Q 
s  /\  s  <Q  r ) )  ->  q  e.  Q. )
20 simprl 531 . . . . . . . 8  |-  ( ( ( ( ( ph  /\  r  e.  ( 2nd `  L ) )  /\  ( q  e.  Q.  /\  ( ( F `  q )  +Q  q
)  <Q  r ) )  /\  s  e.  Q. )  /\  ( ( ( F `  q )  +Q  q )  <Q 
s  /\  s  <Q  r ) )  ->  (
( F `  q
)  +Q  q ) 
<Q  s )
21 rspe 2593 . . . . . . . 8  |-  ( ( q  e.  Q.  /\  ( ( F `  q )  +Q  q
)  <Q  s )  ->  E. q  e.  Q.  ( ( F `  q )  +Q  q
)  <Q  s )
2219, 20, 21syl2anc 411 . . . . . . 7  |-  ( ( ( ( ( ph  /\  r  e.  ( 2nd `  L ) )  /\  ( q  e.  Q.  /\  ( ( F `  q )  +Q  q
)  <Q  r ) )  /\  s  e.  Q. )  /\  ( ( ( F `  q )  +Q  q )  <Q 
s  /\  s  <Q  r ) )  ->  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  s
)
23 breq2 4115 . . . . . . . . 9  |-  ( u  =  s  ->  (
( ( F `  q )  +Q  q
)  <Q  u  <->  ( ( F `  q )  +Q  q )  <Q  s
) )
2423rexbidv 2545 . . . . . . . 8  |-  ( u  =  s  ->  ( E. q  e.  Q.  ( ( F `  q )  +Q  q
)  <Q  u  <->  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  s
) )
2524, 9elrab2 2978 . . . . . . 7  |-  ( s  e.  ( 2nd `  L
)  <->  ( s  e. 
Q.  /\  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  s
) )
2617, 22, 25sylanbrc 417 . . . . . 6  |-  ( ( ( ( ( ph  /\  r  e.  ( 2nd `  L ) )  /\  ( q  e.  Q.  /\  ( ( F `  q )  +Q  q
)  <Q  r ) )  /\  s  e.  Q. )  /\  ( ( ( F `  q )  +Q  q )  <Q 
s  /\  s  <Q  r ) )  ->  s  e.  ( 2nd `  L
) )
2716, 26jca 306 . . . . 5  |-  ( ( ( ( ( ph  /\  r  e.  ( 2nd `  L ) )  /\  ( q  e.  Q.  /\  ( ( F `  q )  +Q  q
)  <Q  r ) )  /\  s  e.  Q. )  /\  ( ( ( F `  q )  +Q  q )  <Q 
s  /\  s  <Q  r ) )  ->  (
s  <Q  r  /\  s  e.  ( 2nd `  L
) ) )
2827ex 115 . . . 4  |-  ( ( ( ( ph  /\  r  e.  ( 2nd `  L ) )  /\  ( q  e.  Q.  /\  ( ( F `  q )  +Q  q
)  <Q  r ) )  /\  s  e.  Q. )  ->  ( ( ( ( F `  q
)  +Q  q ) 
<Q  s  /\  s  <Q  r )  ->  (
s  <Q  r  /\  s  e.  ( 2nd `  L
) ) ) )
2928reximdva 2646 . . 3  |-  ( ( ( ph  /\  r  e.  ( 2nd `  L
) )  /\  (
q  e.  Q.  /\  ( ( F `  q )  +Q  q
)  <Q  r ) )  ->  ( E. s  e.  Q.  ( ( ( F `  q )  +Q  q )  <Q 
s  /\  s  <Q  r )  ->  E. s  e.  Q.  ( s  <Q 
r  /\  s  e.  ( 2nd `  L ) ) ) )
3015, 29mpd 13 . 2  |-  ( ( ( ph  /\  r  e.  ( 2nd `  L
) )  /\  (
q  e.  Q.  /\  ( ( F `  q )  +Q  q
)  <Q  r ) )  ->  E. s  e.  Q.  ( s  <Q  r  /\  s  e.  ( 2nd `  L ) ) )
3112, 30rexlimddv 2667 1  |-  ( (
ph  /\  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    = wceq 1398    e. wcel 2205   A.wral 2522   E.wrex 2523   {crab 2526   <.cop 3694   class class class wbr 4111   -->wf 5350   ` cfv 5354  (class class class)co 6052   2ndc2nd 6335   Q.cnq 7597    +Q cplq 7599    <Q cltq 7602
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-nul 4238  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-iinf 4712
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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-tr 4211  df-eprel 4412  df-id 4416  df-po 4419  df-iso 4420  df-iord 4489  df-on 4491  df-suc 4494  df-iom 4715  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-recs 6538  df-irdg 6603  df-1o 6649  df-oadd 6653  df-omul 6654  df-er 6769  df-ec 6771  df-qs 6775  df-ni 7621  df-pli 7622  df-mi 7623  df-lti 7624  df-plpq 7661  df-mpq 7662  df-enq 7664  df-nqqs 7665  df-plqqs 7666  df-mqqs 7667  df-1nqqs 7668  df-rq 7669  df-ltnqqs 7670
This theorem is referenced by:  cauappcvgprlemrnd  7967
  Copyright terms: Public domain W3C validator