Theorem caucvgsrlemfv 6875

Description: Lemma for caucvgsr 6886. Coercing sequence value from a positive real to a signed real. (Contributed by Jim Kingdon, 29-Jun-2021.)

Hypotheses

Ref	Expression
caucvgsr.f	|- ( ph -> F : N. --> R. )
caucvgsr.cau	|- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <R ( ( F ` k ) +R [ <. ( <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. +P. 1P ) , 1P >. ] ~R ) /\ ( F ` k ) <R ( ( F ` n ) +R [ <. ( <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. +P. 1P ) , 1P >. ] ~R ) ) ) )
caucvgsrlemgt1.gt1	|- ( ph -> A. m e. N. 1R <R ( F ` m ) )
caucvgsrlemf.xfr	|- G = ( x e. N. |-> ( iota_ y e. P. ( F ` x ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) )

Assertion

Ref	Expression
caucvgsrlemfv	|- ( ( ph /\ A e. N. ) -> [ <. ( ( G ` A ) +P. 1P ) , 1P >. ] ~R = ( F ` A ) )

Distinct variable groups:   A, m   x, A, y   m, F   x, F, y   ph, x

Allowed substitution hints:   ph( y, u, k, m, n, l)   A( u, k, n, l)   F( u, k, n, l)   G( x, y, u, k, m, n, l)

Proof of Theorem caucvgsrlemfv

Step	Hyp	Ref	Expression
1		caucvgsrlemf.xfr	. . . . . . 7 |- G = ( x e. N. |-> ( iota_ y e. P. ( F ` x ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) )
2	1	a1i 9	. . . . . 6 |- ( ( ph /\ A e. N. ) -> G = ( x e. N. |-> ( iota_ y e. P. ( F ` x ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) ) )
3		fveq2 5178	. . . . . . . . 9 |- ( x = A -> ( F ` x ) = ( F ` A ) )
4	3	eqeq1d 2048	. . . . . . . 8 |- ( x = A -> ( ( F ` x ) = [ <. ( y +P. 1P ) , 1P >. ] ~R <-> ( F ` A ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) )
5	4	riotabidv 5470	. . . . . . 7 |- ( x = A -> ( iota_ y e. P. ( F ` x ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) = ( iota_ y e. P. ( F ` A ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) )
6	5	adantl 262	. . . . . 6 |- ( ( ( ph /\ A e. N. ) /\ x = A ) -> ( iota_ y e. P. ( F ` x ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) = ( iota_ y e. P. ( F ` A ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) )
7		simpr 103	. . . . . 6 |- ( ( ph /\ A e. N. ) -> A e. N. )
8		caucvgsr.f	. . . . . . 7 |- ( ph -> F : N. --> R. )
9		caucvgsrlemgt1.gt1	. . . . . . 7 |- ( ph -> A. m e. N. 1R <R ( F ` m ) )
10	8, 9	caucvgsrlemcl 6873	. . . . . 6 |- ( ( ph /\ A e. N. ) -> ( iota_ y e. P. ( F ` A ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) e. P. )
11	2, 6, 7, 10	fvmptd 5253	. . . . 5 |- ( ( ph /\ A e. N. ) -> ( G ` A ) = ( iota_ y e. P. ( F ` A ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) )
12	11	oveq1d 5527	. . . 4 |- ( ( ph /\ A e. N. ) -> ( ( G ` A ) +P. 1P ) = ( ( iota_ y e. P. ( F ` A ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) +P. 1P ) )
13	12	opeq1d 3555	. . 3 |- ( ( ph /\ A e. N. ) -> <. ( ( G ` A ) +P. 1P ) , 1P >. = <. ( ( iota_ y e. P. ( F ` A ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) +P. 1P ) , 1P >. )
14	13	eceq1d 6142	. 2 |- ( ( ph /\ A e. N. ) -> [ <. ( ( G ` A ) +P. 1P ) , 1P >. ] ~R = [ <. ( ( iota_ y e. P. ( F ` A ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) +P. 1P ) , 1P >. ] ~R )
15		eqcom 2042	. . . . . . 7 |- ( ( F ` A ) = [ <. ( y +P. 1P ) , 1P >. ] ~R <-> [ <. ( y +P. 1P ) , 1P >. ] ~R = ( F ` A ) )
16	15	a1i 9	. . . . . 6 |- ( y e. P. -> ( ( F ` A ) = [ <. ( y +P. 1P ) , 1P >. ] ~R <-> [ <. ( y +P. 1P ) , 1P >. ] ~R = ( F ` A ) ) )
17	16	riotabiia 5485	. . . . 5 |- ( iota_ y e. P. ( F ` A ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) = ( iota_ y e. P. [ <. ( y +P. 1P ) , 1P >. ] ~R = ( F ` A ) )
18	17	oveq1i 5522	. . . 4 |- ( ( iota_ y e. P. ( F ` A ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) +P. 1P ) = ( ( iota_ y e. P. [ <. ( y +P. 1P ) , 1P >. ] ~R = ( F ` A ) ) +P. 1P )
19	18	opeq1i 3552	. . 3 |- <. ( ( iota_ y e. P. ( F ` A ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) +P. 1P ) , 1P >. = <. ( ( iota_ y e. P. [ <. ( y +P. 1P ) , 1P >. ] ~R = ( F ` A ) ) +P. 1P ) , 1P >.
20		eceq1 6141	. . 3 |- ( <. ( ( iota_ y e. P. ( F ` A ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) +P. 1P ) , 1P >. = <. ( ( iota_ y e. P. [ <. ( y +P. 1P ) , 1P >. ] ~R = ( F ` A ) ) +P. 1P ) , 1P >. -> [ <. ( ( iota_ y e. P. ( F ` A ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) +P. 1P ) , 1P >. ] ~R = [ <. ( ( iota_ y e. P. [ <. ( y +P. 1P ) , 1P >. ] ~R = ( F ` A ) ) +P. 1P ) , 1P >. ] ~R )
21	19, 20	mp1i 10	. 2 |- ( ( ph /\ A e. N. ) -> [ <. ( ( iota_ y e. P. ( F ` A ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) +P. 1P ) , 1P >. ] ~R = [ <. ( ( iota_ y e. P. [ <. ( y +P. 1P ) , 1P >. ] ~R = ( F ` A ) ) +P. 1P ) , 1P >. ] ~R )
22	8	ffvelrnda 5302	. . 3 |- ( ( ph /\ A e. N. ) -> ( F ` A ) e. R. )
23		0lt1sr 6850	. . . 4 |- 0R <R 1R
24		fveq2 5178	. . . . . . 7 |- ( m = A -> ( F ` m ) = ( F ` A ) )
25	24	breq2d 3776	. . . . . 6 |- ( m = A -> ( 1R <R ( F ` m ) <-> 1R <R ( F ` A ) ) )
26	25	rspcv 2652	. . . . 5 |- ( A e. N. -> ( A. m e. N. 1R <R ( F ` m ) -> 1R <R ( F ` A ) ) )
27	9, 26	mpan9 265	. . . 4 |- ( ( ph /\ A e. N. ) -> 1R <R ( F ` A ) )
28		ltsosr 6849	. . . . 5 |- <R Or R.
29		ltrelsr 6823	. . . . 5 |- <R C_ ( R. X. R. )
30	28, 29	sotri 4720	. . . 4 |- ( ( 0R <R 1R /\ 1R <R ( F ` A ) ) -> 0R <R ( F ` A ) )
31	23, 27, 30	sylancr 393	. . 3 |- ( ( ph /\ A e. N. ) -> 0R <R ( F ` A ) )
32		prsrriota 6872	. . 3 |- ( ( ( F ` A ) e. R. /\ 0R <R ( F ` A ) ) -> [ <. ( ( iota_ y e. P. [ <. ( y +P. 1P ) , 1P >. ] ~R = ( F ` A ) ) +P. 1P ) , 1P >. ] ~R = ( F ` A ) )
33	22, 31, 32	syl2anc 391	. 2 |- ( ( ph /\ A e. N. ) -> [ <. ( ( iota_ y e. P. [ <. ( y +P. 1P ) , 1P >. ] ~R = ( F ` A ) ) +P. 1P ) , 1P >. ] ~R = ( F ` A ) )
34	14, 21, 33	3eqtrd 2076	1 |- ( ( ph /\ A e. N. ) -> [ <. ( ( G ` A ) +P. 1P ) , 1P >. ] ~R = ( F ` A ) )

Syntax hints:   -> wi 4   /\ wa 97   <-> wb 98   = wceq 1243   e. wcel 1393   {cab 2026   A.wral 2306   <.cop 3378   class class class wbr 3764   |-> cmpt 3818   -->wf 4898   ` cfv 4902   iota_crio 5467  (class class class)co 5512   1oc1o 5994   [cec 6104   N.cnpi 6370   <N clti 6373   ~Q ceq 6377   *Qcrq 6382   <Q cltq 6383   P.cnp 6389   1Pc1p 6390   +P. cpp 6391   ~R cer 6394   R.cnr 6395   0Rc0r 6396   1Rc1r 6397   +R cplr 6399   <R cltr 6401

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-rmo 2314  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-riota 5468  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-2o 6002  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  df-enq0 6522  df-nq0 6523  df-0nq0 6524  df-plq0 6525  df-mq0 6526  df-inp 6564  df-i1p 6565  df-iplp 6566  df-iltp 6568  df-enr 6811  df-nr 6812  df-ltr 6815  df-0r 6816  df-1r 6817

This theorem is referenced by:  caucvgsrlemcau  6877  caucvgsrlembound  6878  caucvgsrlemgt1  6879