Theorem cauappcvgprlemlol 8020

Description: Lemma for cauappcvgpr 8035. The lower cut of the putative limit is lower. (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
cauappcvgprlemlol	|- ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) -> s e. ( 1st ` 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 cauappcvgprlemlol

Dummy variables f g h are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ltrelnq 7738	. . . . 5 |- <Q C_ ( Q. X. Q. )
2	1	brel 4829	. . . 4 |- ( s <Q r -> ( s e. Q. /\ r e. Q. ) )
3	2	simpld 112	. . 3 |- ( s <Q r -> s e. Q. )
4	3	3ad2ant2 1050	. 2 |- ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) -> s e. Q. )
5		oveq1 6095	. . . . . . . 8 |- ( l = r -> ( l +Q q ) = ( r +Q q ) )
6	5	breq1d 4141	. . . . . . 7 |- ( l = r -> ( ( l +Q q ) <Q ( F ` q ) <-> ( r +Q q ) <Q ( F ` q ) ) )
7	6	rexbidv 2551	. . . . . 6 |- ( l = r -> ( E. q e. Q. ( l +Q q ) <Q ( F ` q ) <-> E. q e. Q. ( r +Q q ) <Q ( F ` q ) ) )
8		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 } >.
9	8	fveq2i 5701	. . . . . . 7 |- ( 1st ` L ) = ( 1st ` <. { 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 } >. )
10		nqex 7736	. . . . . . . . 9 |- Q. e. _V
11	10	rabex 4282	. . . . . . . 8 |- { l e. Q. | E. q e. Q. ( l +Q q ) <Q ( F ` q ) } e. _V
12	10	rabex 4282	. . . . . . . 8 |- { u e. Q. | E. q e. Q. ( ( F ` q ) +Q q ) <Q u } e. _V
13	11, 12	op1st 6384	. . . . . . 7 |- ( 1st ` <. { 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 } >. ) = { l e. Q. | E. q e. Q. ( l +Q q ) <Q ( F ` q ) }
14	9, 13	eqtri 2259	. . . . . 6 |- ( 1st ` L ) = { l e. Q. | E. q e. Q. ( l +Q q ) <Q ( F ` q ) }
15	7, 14	elrab2 2985	. . . . 5 |- ( r e. ( 1st ` L ) <-> ( r e. Q. /\ E. q e. Q. ( r +Q q ) <Q ( F ` q ) ) )
16	15	simprbi 275	. . . 4 |- ( r e. ( 1st ` L ) -> E. q e. Q. ( r +Q q ) <Q ( F ` q ) )
17	16	3ad2ant3 1051	. . 3 |- ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) -> E. q e. Q. ( r +Q q ) <Q ( F ` q ) )
18		simpll2 1068	. . . . . . 7 |- ( ( ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) /\ q e. Q. ) /\ ( r +Q q ) <Q ( F ` q ) ) -> s <Q r )
19		ltanqg 7773	. . . . . . . . 9 |- ( ( f e. Q. /\ g e. Q. /\ h e. Q. ) -> ( f <Q g <-> ( h +Q f ) <Q ( h +Q g ) ) )
20	19	adantl 277	. . . . . . . 8 |- ( ( ( ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) /\ q e. Q. ) /\ ( r +Q q ) <Q ( F ` q ) ) /\ ( f e. Q. /\ g e. Q. /\ h e. Q. ) ) -> ( f <Q g <-> ( h +Q f ) <Q ( h +Q g ) ) )
21	4	ad2antrr 492	. . . . . . . 8 |- ( ( ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) /\ q e. Q. ) /\ ( r +Q q ) <Q ( F ` q ) ) -> s e. Q. )
22	2	simprd 114	. . . . . . . . . 10 |- ( s <Q r -> r e. Q. )
23	22	3ad2ant2 1050	. . . . . . . . 9 |- ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) -> r e. Q. )
24	23	ad2antrr 492	. . . . . . . 8 |- ( ( ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) /\ q e. Q. ) /\ ( r +Q q ) <Q ( F ` q ) ) -> r e. Q. )
25		simplr 533	. . . . . . . 8 |- ( ( ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) /\ q e. Q. ) /\ ( r +Q q ) <Q ( F ` q ) ) -> q e. Q. )
26		addcomnqg 7754	. . . . . . . . 9 |- ( ( f e. Q. /\ g e. Q. ) -> ( f +Q g ) = ( g +Q f ) )
27	26	adantl 277	. . . . . . . 8 |- ( ( ( ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) /\ q e. Q. ) /\ ( r +Q q ) <Q ( F ` q ) ) /\ ( f e. Q. /\ g e. Q. ) ) -> ( f +Q g ) = ( g +Q f ) )
28	20, 21, 24, 25, 27	caovord2d 6262	. . . . . . 7 |- ( ( ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) /\ q e. Q. ) /\ ( r +Q q ) <Q ( F ` q ) ) -> ( s <Q r <-> ( s +Q q ) <Q ( r +Q q ) ) )
29	18, 28	mpbid 147	. . . . . 6 |- ( ( ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) /\ q e. Q. ) /\ ( r +Q q ) <Q ( F ` q ) ) -> ( s +Q q ) <Q ( r +Q q ) )
30		ltsonq 7771	. . . . . . 7 |- <Q Or Q.
31	30, 1	sotri 5186	. . . . . 6 |- ( ( ( s +Q q ) <Q ( r +Q q ) /\ ( r +Q q ) <Q ( F ` q ) ) -> ( s +Q q ) <Q ( F ` q ) )
32	29, 31	sylancom 424	. . . . 5 |- ( ( ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) /\ q e. Q. ) /\ ( r +Q q ) <Q ( F ` q ) ) -> ( s +Q q ) <Q ( F ` q ) )
33	32	ex 115	. . . 4 |- ( ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) /\ q e. Q. ) -> ( ( r +Q q ) <Q ( F ` q ) -> ( s +Q q ) <Q ( F ` q ) ) )
34	33	reximdva 2652	. . 3 |- ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) -> ( E. q e. Q. ( r +Q q ) <Q ( F ` q ) -> E. q e. Q. ( s +Q q ) <Q ( F ` q ) ) )
35	17, 34	mpd 13	. 2 |- ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) -> E. q e. Q. ( s +Q q ) <Q ( F ` q ) )
36		oveq1 6095	. . . . 5 |- ( l = s -> ( l +Q q ) = ( s +Q q ) )
37	36	breq1d 4141	. . . 4 |- ( l = s -> ( ( l +Q q ) <Q ( F ` q ) <-> ( s +Q q ) <Q ( F ` q ) ) )
38	37	rexbidv 2551	. . 3 |- ( l = s -> ( E. q e. Q. ( l +Q q ) <Q ( F ` q ) <-> E. q e. Q. ( s +Q q ) <Q ( F ` q ) ) )
39	38, 14	elrab2 2985	. 2 |- ( s e. ( 1st ` L ) <-> ( s e. Q. /\ E. q e. Q. ( s +Q q ) <Q ( F ` q ) ) )
40	4, 35, 39	sylanbrc 421	1 |- ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) -> s e. ( 1st ` L ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1009   = wceq 1402   e. wcel 2209   A.wral 2528   E.wrex 2529   {crab 2532   <.cop 3712   class class class wbr 4131   -->wf 5376   ` cfv 5380  (class class class)co 6088   1stc1st 6376   Q.cnq 7653   +Q cplq 7655   <Q cltq 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 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737

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 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-eprel 4436  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-oadd 6695  df-omul 6696  df-er 6811  df-ec 6813  df-qs 6817  df-ni 7677  df-pli 7678  df-mi 7679  df-lti 7680  df-plpq 7717  df-enq 7720  df-nqqs 7721  df-plqqs 7722  df-ltnqqs 7726

This theorem is used by:  cauappcvgprlemrnd  8023