ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  caucvgprlemlol Unicode version
Theorem caucvgprlemlol 6768
Description: Lemma for caucvgpr 6780. The lower cut of the putative limit is lower. (Contributed by Jim Kingdon, 20-Oct-2020.)
Hypotheses
Ref Expression
caucvgpr.f |- ( ph -> F : N. --> Q. )
caucvgpr.cau |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <Q ( ( F ` k ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) /\ ( F ` k ) <Q ( ( F ` n ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) ) ) )
caucvgpr.bnd |- ( ph -> A. j e. N. A <Q ( F ` j ) )
caucvgpr.lim |- L = <. { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) } , { u e. Q. | E. j e. N. ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q u } >.
Assertion
Ref Expression
caucvgprlemlol |- ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) -> s e. ( 1st ` L ) )
Distinct variable groups:   A, j   F, l, r, s   u, F   j, L, r, s   j, l, s   ph, j, r, s   u, j, r, s
Allowed substitution hints:   ph( u, k, n, l)   A( u, k, n, s, r, l)   F( j, k, n)   L( u, k, n, l)
Proof of Theorem caucvgprlemlol
Dummy variables f g h are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ltrelnq 6463 . . . . 5 |- <Q C_ ( Q. X. Q. )
21brel 4392 . . . 4 |- ( s <Q r -> ( s e. Q. /\ r e. Q. ) )
32simpld 105 . . 3 |- ( s <Q r -> s e. Q. )
433ad2ant2 926 . 2 |- ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) -> s e. Q. )
5 oveq1 5519 . . . . . . . 8 |- ( l = r -> ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) = ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) )
65breq1d 3774 . . . . . . 7 |- ( l = r -> ( ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) <-> ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) ) )
76rexbidv 2327 . . . . . 6 |- ( l = r -> ( E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) <-> E. j e. N. ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) ) )
8 caucvgpr.lim . . . . . . . 8 |- L = <. { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) } , { u e. Q. | E. j e. N. ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q u } >.
98fveq2i 5181 . . . . . . 7 |- ( 1st ` L ) = ( 1st ` <. { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) } , { u e. Q. | E. j e. N. ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q u } >. )
10 nqex 6461 . . . . . . . . 9 |- Q. e. _V
1110rabex 3901 . . . . . . . 8 |- { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) } e. _V
1210rabex 3901 . . . . . . . 8 |- { u e. Q. | E. j e. N. ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q u } e. _V
1311, 12op1st 5773 . . . . . . 7 |- ( 1st ` <. { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) } , { u e. Q. | E. j e. N. ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q u } >. ) = { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) }
149, 13eqtri 2060 . . . . . 6 |- ( 1st ` L ) = { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) }
157, 14elrab2 2700 . . . . 5 |- ( r e. ( 1st ` L ) <-> ( r e. Q. /\ E. j e. N. ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) ) )
1615simprbi 260 . . . 4 |- ( r e. ( 1st ` L ) -> E. j e. N. ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) )
17163ad2ant3 927 . . 3 |- ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) -> E. j e. N. ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) )
18 simpll2 944 . . . . . . 7 |- ( ( ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) /\ j e. N. ) /\ ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) ) -> s <Q r )
19 ltanqg 6498 . . . . . . . . 9 |- ( ( f e. Q. /\ g e. Q. /\ h e. Q. ) -> ( f <Q g <-> ( h +Q f ) <Q ( h +Q g ) ) )
2019adantl 262 . . . . . . . 8 |- ( ( ( ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) /\ j e. N. ) /\ ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) ) /\ ( f e. Q. /\ g e. Q. /\ h e. Q. ) ) -> ( f <Q g <-> ( h +Q f ) <Q ( h +Q g ) ) )
214ad2antrr 457 . . . . . . . 8 |- ( ( ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) /\ j e. N. ) /\ ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) ) -> s e. Q. )
222simprd 107 . . . . . . . . . 10 |- ( s <Q r -> r e. Q. )
23223ad2ant2 926 . . . . . . . . 9 |- ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) -> r e. Q. )
2423ad2antrr 457 . . . . . . . 8 |- ( ( ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) /\ j e. N. ) /\ ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) ) -> r e. Q. )
25 simplr 482 . . . . . . . . 9 |- ( ( ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) /\ j e. N. ) /\ ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) ) -> j e. N. )
26 nnnq 6520 . . . . . . . . 9 |- ( j e. N. -> [ <. j , 1o >. ] ~Q e. Q. )
27 recclnq 6490 . . . . . . . . 9 |- ( [ <. j , 1o >. ] ~Q e. Q. -> ( *Q ` [ <. j , 1o >. ] ~Q ) e. Q. )
2825, 26, 273syl 17 . . . . . . . 8 |- ( ( ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) /\ j e. N. ) /\ ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) ) -> ( *Q ` [ <. j , 1o >. ] ~Q ) e. Q. )
29 addcomnqg 6479 . . . . . . . . 9 |- ( ( f e. Q. /\ g e. Q. ) -> ( f +Q g ) = ( g +Q f ) )
3029adantl 262 . . . . . . . 8 |- ( ( ( ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) /\ j e. N. ) /\ ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) ) /\ ( f e. Q. /\ g e. Q. ) ) -> ( f +Q g ) = ( g +Q f ) )
3120, 21, 24, 28, 30caovord2d 5670 . . . . . . 7 |- ( ( ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) /\ j e. N. ) /\ ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) ) -> ( s <Q r <-> ( s +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) ) )
3218, 31mpbid 135 . . . . . 6 |- ( ( ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) /\ j e. N. ) /\ ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) ) -> ( s +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) )
33 ltsonq 6496 . . . . . . 7 |- <Q Or Q.
3433, 1sotri 4720 . . . . . 6 |- ( ( ( s +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) /\ ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) ) -> ( s +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) )
3532, 34sylancom 397 . . . . 5 |- ( ( ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) /\ j e. N. ) /\ ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) ) -> ( s +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) )
3635ex 108 . . . 4 |- ( ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) /\ j e. N. ) -> ( ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) -> ( s +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) ) )
3736reximdva 2421 . . 3 |- ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) -> ( E. j e. N. ( r +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) -> E. j e. N. ( s +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) ) )
3817, 37mpd 13 . 2 |- ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) -> E. j e. N. ( s +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) )
39 oveq1 5519 . . . . 5 |- ( l = s -> ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) = ( s +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) )
4039breq1d 3774 . . . 4 |- ( l = s -> ( ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) <-> ( s +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) ) )
4140rexbidv 2327 . . 3 |- ( l = s -> ( E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) <-> E. j e. N. ( s +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) ) )
4241, 14elrab2 2700 . 2 |- ( s e. ( 1st ` L ) <-> ( s e. Q. /\ E. j e. N. ( s +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) ) )
434, 38, 42sylanbrc 394 1 |- ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) -> s e. ( 1st ` L ) )
Colors of variables: wff set class
Syntax hints:   -> wi 4   /\ wa 97   <-> wb 98   /\ w3a 885   = wceq 1243   e. wcel 1393   A.wral 2306   E.wrex 2307   {crab 2310   <.cop 3378   class class class wbr 3764   -->wf 4898   ` cfv 4902  (class class class)co 5512   1stc1st 5765   1oc1o 5994   [cec 6104   N.cnpi 6370   <N clti 6373   ~Q ceq 6377   Q.cnq 6378   +Q cplq 6380   *Qcrq 6382   <Q cltq 6383
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-coll 3872  ax-sep 3875  ax-nul 3883  ax-pow 3927  ax-pr 3944  ax-un 4170  ax-setind 4262  ax-iinf 4311
This theorem depends on definitions:  df-bi 110  df-dc 743  df-3or 886  df-3an 887  df-tru 1246  df-fal 1249  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ne 2206  df-ral 2311  df-rex 2312  df-reu 2313  df-rab 2315  df-v 2559  df-sbc 2765  df-csb 2853  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-nul 3225  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-int 3616  df-iun 3659  df-br 3765  df-opab 3819  df-mpt 3820  df-tr 3855  df-eprel 4026  df-id 4030  df-po 4033  df-iso 4034  df-iord 4103  df-on 4105  df-suc 4108  df-iom 4314  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910  df-ov 5515  df-oprab 5516  df-mpt2 5517  df-1st 5767  df-2nd 5768  df-recs 5920  df-irdg 5957  df-1o 6001  df-oadd 6005  df-omul 6006  df-er 6106  df-ec 6108  df-qs 6112  df-ni 6402  df-pli 6403  df-mi 6404  df-lti 6405  df-plpq 6442  df-mpq 6443  df-enq 6445  df-nqqs 6446  df-plqqs 6447  df-mqqs 6448  df-1nqqs 6449  df-rq 6450  df-ltnqqs 6451
This theorem is referenced by:  caucvgprlemrnd  6771
  Copyright terms: Public domain W3C validator