Theorem seqp1cd 10731

Description: Value of the sequence builder function at a successor. A version of seq3p1 10726 which provides two classes D and C for the terms and the value being accumulated, respectively. (Contributed by Jim Kingdon, 20-Jul-2023.)

Hypotheses

Ref	Expression
seqp1cd.m	|- ( ph -> N e. ( ZZ>= ` M ) )
seqp1cd.1	|- ( ph -> ( F ` M ) e. C )
seqp1cd.2	|- ( ( ph /\ ( x e. C /\ y e. D ) ) -> ( x .+ y ) e. C )
seqp1cd.5	|- ( ( ph /\ x e. ( ZZ>= ` ( M + 1 ) ) ) -> ( F ` x ) e. D )

Assertion

Ref	Expression
seqp1cd	|- ( ph -> ( seq M ( .+ , F ) ` ( N + 1 ) ) = ( ( seq M ( .+ , F ) ` N ) .+ ( F ` ( N + 1 ) ) ) )

Distinct variable groups:   x, .+ , y   x, C, y   x, D, y   x, F, y   x, M, y   x, N, y   ph, x, y

Proof of Theorem seqp1cd

Dummy variables a b w z c d are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		seqp1cd.m	. . 3 |- ( ph -> N e. ( ZZ>= ` M ) )
2		eluzel2 9759	. . . . 5 |- ( N e. ( ZZ>= ` M ) -> M e. ZZ )
3	1, 2	syl 14	. . . 4 |- ( ph -> M e. ZZ )
4		seqp1cd.1	. . . 4 |- ( ph -> ( F ` M ) e. C )
5		ssv 3249	. . . . 5 |- C C_ _V
6	5	a1i 9	. . . 4 |- ( ph -> C C_ _V )
7		seqp1cd.5	. . . . 5 |- ( ( ph /\ x e. ( ZZ>= ` ( M + 1 ) ) ) -> ( F ` x ) e. D )
8		seqp1cd.2	. . . . 5 |- ( ( ph /\ ( x e. C /\ y e. D ) ) -> ( x .+ y ) e. C )
9	7, 8	seqovcd 10728	. . . 4 |- ( ( ph /\ ( x e. ( ZZ>= ` M ) /\ y e. C ) ) -> ( x ( z e. ( ZZ>= ` M ) , w e. C |-> ( w .+ ( F ` ( z + 1 ) ) ) ) y ) e. C )
10		iseqvalcbv 10720	. . . 4 |- frec ( ( a e. ( ZZ>= ` M ) , b e. _V |-> <. ( a + 1 ) , ( a ( c e. ( ZZ>= ` M ) , d e. C |-> ( d .+ ( F ` ( c + 1 ) ) ) ) b ) >. ) , <. M , ( F ` M ) >. ) = frec ( ( x e. ( ZZ>= ` M ) , y e. _V |-> <. ( x + 1 ) , ( x ( z e. ( ZZ>= ` M ) , w e. C |-> ( w .+ ( F ` ( z + 1 ) ) ) ) y ) >. ) , <. M , ( F ` M ) >. )
11	3, 10, 4, 8, 7	seqvalcd 10722	. . . 4 |- ( ph -> seq M ( .+ , F ) = ran frec ( ( a e. ( ZZ>= ` M ) , b e. _V |-> <. ( a + 1 ) , ( a ( c e. ( ZZ>= ` M ) , d e. C |-> ( d .+ ( F ` ( c + 1 ) ) ) ) b ) >. ) , <. M , ( F ` M ) >. ) )
12	3, 4, 6, 9, 10, 11	frecuzrdgsuct 10685	. . 3 |- ( ( ph /\ N e. ( ZZ>= ` M ) ) -> ( seq M ( .+ , F ) ` ( N + 1 ) ) = ( N ( z e. ( ZZ>= ` M ) , w e. C |-> ( w .+ ( F ` ( z + 1 ) ) ) ) ( seq M ( .+ , F ) ` N ) ) )
13	1, 12	mpdan 421	. 2 |- ( ph -> ( seq M ( .+ , F ) ` ( N + 1 ) ) = ( N ( z e. ( ZZ>= ` M ) , w e. C |-> ( w .+ ( F ` ( z + 1 ) ) ) ) ( seq M ( .+ , F ) ` N ) ) )
14		eqid 2231	. . . . 5 |- ( ZZ>= ` M ) = ( ZZ>= ` M )
15	4, 8, 14, 3, 7	seqf2 10729	. . . 4 |- ( ph -> seq M ( .+ , F ) : ( ZZ>= ` M ) --> C )
16	15, 1	ffvelcdmd 5783	. . 3 |- ( ph -> ( seq M ( .+ , F ) ` N ) e. C )
17		fveq2 5639	. . . . . 6 |- ( x = ( N + 1 ) -> ( F ` x ) = ( F ` ( N + 1 ) ) )
18	17	eleq1d 2300	. . . . 5 |- ( x = ( N + 1 ) -> ( ( F ` x ) e. D <-> ( F ` ( N + 1 ) ) e. D ) )
19	7	ralrimiva 2605	. . . . 5 |- ( ph -> A. x e. ( ZZ>= ` ( M + 1 ) ) ( F ` x ) e. D )
20		eluzp1p1 9781	. . . . . 6 |- ( N e. ( ZZ>= ` M ) -> ( N + 1 ) e. ( ZZ>= ` ( M + 1 ) ) )
21	1, 20	syl 14	. . . . 5 |- ( ph -> ( N + 1 ) e. ( ZZ>= ` ( M + 1 ) ) )
22	18, 19, 21	rspcdva 2915	. . . 4 |- ( ph -> ( F ` ( N + 1 ) ) e. D )
23	8, 16, 22	caovcld 6175	. . 3 |- ( ph -> ( ( seq M ( .+ , F ) ` N ) .+ ( F ` ( N + 1 ) ) ) e. C )
24		fvoveq1 6040	. . . . 5 |- ( z = N -> ( F ` ( z + 1 ) ) = ( F ` ( N + 1 ) ) )
25	24	oveq2d 6033	. . . 4 |- ( z = N -> ( w .+ ( F ` ( z + 1 ) ) ) = ( w .+ ( F ` ( N + 1 ) ) ) )
26		oveq1 6024	. . . 4 |- ( w = ( seq M ( .+ , F ) ` N ) -> ( w .+ ( F ` ( N + 1 ) ) ) = ( ( seq M ( .+ , F ) ` N ) .+ ( F ` ( N + 1 ) ) ) )
27		eqid 2231	. . . 4 |- ( z e. ( ZZ>= ` M ) , w e. C |-> ( w .+ ( F ` ( z + 1 ) ) ) ) = ( z e. ( ZZ>= ` M ) , w e. C |-> ( w .+ ( F ` ( z + 1 ) ) ) )
28	25, 26, 27	ovmpog 6155	. . 3 |- ( ( N e. ( ZZ>= ` M ) /\ ( seq M ( .+ , F ) ` N ) e. C /\ ( ( seq M ( .+ , F ) ` N ) .+ ( F ` ( N + 1 ) ) ) e. C ) -> ( N ( z e. ( ZZ>= ` M ) , w e. C |-> ( w .+ ( F ` ( z + 1 ) ) ) ) ( seq M ( .+ , F ) ` N ) ) = ( ( seq M ( .+ , F ) ` N ) .+ ( F ` ( N + 1 ) ) ) )
29	1, 16, 23, 28	syl3anc 1273	. 2 |- ( ph -> ( N ( z e. ( ZZ>= ` M ) , w e. C |-> ( w .+ ( F ` ( z + 1 ) ) ) ) ( seq M ( .+ , F ) ` N ) ) = ( ( seq M ( .+ , F ) ` N ) .+ ( F ` ( N + 1 ) ) ) )
30	13, 29	eqtrd 2264	1 |- ( ph -> ( seq M ( .+ , F ) ` ( N + 1 ) ) = ( ( seq M ( .+ , F ) ` N ) .+ ( F ` ( N + 1 ) ) ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1397   e. wcel 2202   _Vcvv 2802   C_ wss 3200   <.cop 3672   ` cfv 5326  (class class class)co 6017   e. cmpo 6019  freccfrec 6555   1c1 8032   + caddc 8034   ZZcz 9478   ZZ>=cuz 9754   seqcseq 10708

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-0id 8139  ax-rnegex 8140  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-ltadd 8147

This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-ilim 4466  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-frec 6556  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-inn 9143  df-n0 9402  df-z 9479  df-uz 9755  df-seqfrec 10709

This theorem is referenced by:  ennnfonelemp1  13026