Theorem caucvgsrlemfv 8106

Description: Lemma for caucvgsr 8117. 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 5670	. . . . . . . . 9 |- ( x = A -> ( F ` x ) = ( F ` A ) )
4	3	eqeq1d 2241	. . . . . . . 8 |- ( x = A -> ( ( F ` x ) = [ <. ( y +P. 1P ) , 1P >. ] ~R <-> ( F ` A ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) )
5	4	riotabidv 6005	. . . . . . 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 277	. . . . . 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 110	. . . . . 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 8104	. . . . . 6 |- ( ( ph /\ A e. N. ) -> ( iota_ y e. P. ( F ` A ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) e. P. )
11	2, 6, 7, 10	fvmptd 5758	. . . . 5 |- ( ( ph /\ A e. N. ) -> ( G ` A ) = ( iota_ y e. P. ( F ` A ) = [ <. ( y +P. 1P ) , 1P >. ] ~R ) )
12	11	oveq1d 6065	. . . 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 3889	. . 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 6803	. 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 2234	. . . . . . 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 6022	. . . . 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 6060	. . . 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 3886	. . 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 6802	. . 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	ffvelcdmda 5812	. . 3 |- ( ( ph /\ A e. N. ) -> ( F ` A ) e. R. )
23		0lt1sr 8080	. . . 4 |- 0R <R 1R
24		fveq2 5670	. . . . . . 7 |- ( m = A -> ( F ` m ) = ( F ` A ) )
25	24	breq2d 4121	. . . . . 6 |- ( m = A -> ( 1R <R ( F ` m ) <-> 1R <R ( F ` A ) ) )
26	25	rspcv 2917	. . . . 5 |- ( A e. N. -> ( A. m e. N. 1R <R ( F ` m ) -> 1R <R ( F ` A ) ) )
27	9, 26	mpan9 281	. . . 4 |- ( ( ph /\ A e. N. ) -> 1R <R ( F ` A ) )
28		ltsosr 8079	. . . . 5 |- <R Or R.
29		ltrelsr 8053	. . . . 5 |- <R C_ ( R. X. R. )
30	28, 29	sotri 5158	. . . 4 |- ( ( 0R <R 1R /\ 1R <R ( F ` A ) ) -> 0R <R ( F ` A ) )
31	23, 27, 30	sylancr 414	. . 3 |- ( ( ph /\ A e. N. ) -> 0R <R ( F ` A ) )
32		prsrriota 8103	. . 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 411	. 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 2269	1 |- ( ( ph /\ A e. N. ) -> [ <. ( ( G ` A ) +P. 1P ) , 1P >. ] ~R = ( F ` A ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1398   e. wcel 2203   {cab 2218   A.wral 2520   <.cop 3692   class class class wbr 4109   |-> cmpt 4171   -->wf 5348   ` cfv 5352   iota_crio 6002  (class class class)co 6050   1oc1o 6640   [cec 6765   N.cnpi 7587   <N clti 7590   ~Q ceq 7594   *Qcrq 7599   <Q cltq 7600   P.cnp 7606   1Pc1p 7607   +P. cpp 7608   ~R cer 7611   R.cnr 7612   0Rc0r 7613   1Rc1r 7614   +R cplr 7616   <R cltr 7618

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 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-iinf 4710

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 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-eprel 4410  df-id 4414  df-po 4417  df-iso 4418  df-iord 4487  df-on 4489  df-suc 4492  df-iom 4713  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-recs 6536  df-irdg 6601  df-1o 6647  df-2o 6648  df-oadd 6651  df-omul 6652  df-er 6767  df-ec 6769  df-qs 6773  df-ni 7619  df-pli 7620  df-mi 7621  df-lti 7622  df-plpq 7659  df-mpq 7660  df-enq 7662  df-nqqs 7663  df-plqqs 7664  df-mqqs 7665  df-1nqqs 7666  df-rq 7667  df-ltnqqs 7668  df-enq0 7739  df-nq0 7740  df-0nq0 7741  df-plq0 7742  df-mq0 7743  df-inp 7781  df-i1p 7782  df-iplp 7783  df-iltp 7785  df-enr 8041  df-nr 8042  df-ltr 8045  df-0r 8046  df-1r 8047

This theorem is referenced by:  caucvgsrlemcau  8108  caucvgsrlembound  8109  caucvgsrlemgt1  8110