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

Theorem cauappcvgprlemupu 7797
Description: Lemma for cauappcvgpr 7810. The upper cut of the putative limit is upper. (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
cauappcvgprlemupu  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  r  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 cauappcvgprlemupu
StepHypRef Expression
1 ltrelnq 7513 . . . . 5  |-  <Q  C_  ( Q.  X.  Q. )
21brel 4745 . . . 4  |-  ( s 
<Q  r  ->  ( s  e.  Q.  /\  r  e.  Q. ) )
32simprd 114 . . 3  |-  ( s 
<Q  r  ->  r  e. 
Q. )
433ad2ant2 1022 . 2  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  r  e.  Q. )
5 breq2 4063 . . . . . . 7  |-  ( u  =  s  ->  (
( ( F `  q )  +Q  q
)  <Q  u  <->  ( ( F `  q )  +Q  q )  <Q  s
) )
65rexbidv 2509 . . . . . 6  |-  ( u  =  s  ->  ( E. q  e.  Q.  ( ( F `  q )  +Q  q
)  <Q  u  <->  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  s
) )
7 cauappcvgpr.lim . . . . . . . 8  |-  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 } >.
87fveq2i 5602 . . . . . . 7  |-  ( 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 } >. )
9 nqex 7511 . . . . . . . . 9  |-  Q.  e.  _V
109rabex 4204 . . . . . . . 8  |-  { l  e.  Q.  |  E. q  e.  Q.  (
l  +Q  q ) 
<Q  ( F `  q
) }  e.  _V
119rabex 4204 . . . . . . . 8  |-  { u  e.  Q.  |  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  u }  e.  _V
1210, 11op2nd 6256 . . . . . . 7  |-  ( 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 }
138, 12eqtri 2228 . . . . . 6  |-  ( 2nd `  L )  =  {
u  e.  Q.  |  E. q  e.  Q.  ( ( F `  q )  +Q  q
)  <Q  u }
146, 13elrab2 2939 . . . . 5  |-  ( s  e.  ( 2nd `  L
)  <->  ( s  e. 
Q.  /\  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  s
) )
1514simprbi 275 . . . 4  |-  ( s  e.  ( 2nd `  L
)  ->  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  s
)
16153ad2ant3 1023 . . 3  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  s
)
17 ltsonq 7546 . . . . . . 7  |-  <Q  Or  Q.
1817, 1sotri 5097 . . . . . 6  |-  ( ( ( ( F `  q )  +Q  q
)  <Q  s  /\  s  <Q  r )  ->  (
( F `  q
)  +Q  q ) 
<Q  r )
1918expcom 116 . . . . 5  |-  ( s 
<Q  r  ->  ( ( ( F `  q
)  +Q  q ) 
<Q  s  ->  ( ( F `  q )  +Q  q )  <Q 
r ) )
20193ad2ant2 1022 . . . 4  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  ( (
( F `  q
)  +Q  q ) 
<Q  s  ->  ( ( F `  q )  +Q  q )  <Q 
r ) )
2120reximdv 2609 . . 3  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  ( E. q  e.  Q.  (
( F `  q
)  +Q  q ) 
<Q  s  ->  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  r
) )
2216, 21mpd 13 . 2  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  r
)
23 breq2 4063 . . . 4  |-  ( u  =  r  ->  (
( ( F `  q )  +Q  q
)  <Q  u  <->  ( ( F `  q )  +Q  q )  <Q  r
) )
2423rexbidv 2509 . . 3  |-  ( u  =  r  ->  ( E. q  e.  Q.  ( ( F `  q )  +Q  q
)  <Q  u  <->  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  r
) )
2524, 13elrab2 2939 . 2  |-  ( r  e.  ( 2nd `  L
)  <->  ( r  e. 
Q.  /\  E. q  e.  Q.  ( ( F `
 q )  +Q  q )  <Q  r
) )
264, 22, 25sylanbrc 417 1  |-  ( (
ph  /\  s  <Q  r  /\  s  e.  ( 2nd `  L ) )  ->  r  e.  ( 2nd `  L ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 981    = wceq 1373    e. wcel 2178   A.wral 2486   E.wrex 2487   {crab 2490   <.cop 3646   class class class wbr 4059   -->wf 5286   ` cfv 5290  (class class class)co 5967   2ndc2nd 6248   Q.cnq 7428    +Q cplq 7430    <Q cltq 7433
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-nul 4186  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-iinf 4654
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-reu 2493  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-tr 4159  df-eprel 4354  df-id 4358  df-po 4361  df-iso 4362  df-iord 4431  df-on 4433  df-suc 4436  df-iom 4657  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-ov 5970  df-oprab 5971  df-mpo 5972  df-1st 6249  df-2nd 6250  df-recs 6414  df-irdg 6479  df-oadd 6529  df-omul 6530  df-er 6643  df-ec 6645  df-qs 6649  df-ni 7452  df-mi 7454  df-lti 7455  df-enq 7495  df-nqqs 7496  df-ltnqqs 7501
This theorem is referenced by:  cauappcvgprlemrnd  7798
  Copyright terms: Public domain W3C validator