ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  seqp1cd Unicode version

Theorem seqp1cd 10562
Description: Value of the sequence builder function at a successor. A version of seq3p1 10557 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.
StepHypRef Expression
1 seqp1cd.m . . 3  |-  ( ph  ->  N  e.  ( ZZ>= `  M ) )
2 eluzel2 9606 . . . . 5  |-  ( N  e.  ( ZZ>= `  M
)  ->  M  e.  ZZ )
31, 2syl 14 . . . 4  |-  ( ph  ->  M  e.  ZZ )
4 seqp1cd.1 . . . 4  |-  ( ph  ->  ( F `  M
)  e.  C )
5 ssv 3205 . . . . 5  |-  C  C_  _V
65a1i 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 )
97, 8seqovcd 10559 . . . 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 10551 . . . 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
) >. )
113, 10, 4, 8, 7seqvalcd 10553 . . . 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
) >. ) )
123, 4, 6, 9, 10, 11frecuzrdgsuct 10516 . . 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 )
) )
131, 12mpdan 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 2196 . . . . 5  |-  ( ZZ>= `  M )  =  (
ZZ>= `  M )
154, 8, 14, 3, 7seqf2 10560 . . . 4  |-  ( ph  ->  seq M (  .+  ,  F ) : (
ZZ>= `  M ) --> C )
1615, 1ffvelcdmd 5698 . . 3  |-  ( ph  ->  (  seq M ( 
.+  ,  F ) `
 N )  e.  C )
17 fveq2 5558 . . . . . 6  |-  ( x  =  ( N  + 
1 )  ->  ( F `  x )  =  ( F `  ( N  +  1
) ) )
1817eleq1d 2265 . . . . 5  |-  ( x  =  ( N  + 
1 )  ->  (
( F `  x
)  e.  D  <->  ( F `  ( N  +  1 ) )  e.  D
) )
197ralrimiva 2570 . . . . 5  |-  ( ph  ->  A. x  e.  (
ZZ>= `  ( M  + 
1 ) ) ( F `  x )  e.  D )
20 eluzp1p1 9627 . . . . . 6  |-  ( N  e.  ( ZZ>= `  M
)  ->  ( N  +  1 )  e.  ( ZZ>= `  ( M  +  1 ) ) )
211, 20syl 14 . . . . 5  |-  ( ph  ->  ( N  +  1 )  e.  ( ZZ>= `  ( M  +  1
) ) )
2218, 19, 21rspcdva 2873 . . . 4  |-  ( ph  ->  ( F `  ( N  +  1 ) )  e.  D )
238, 16, 22caovcld 6077 . . 3  |-  ( ph  ->  ( (  seq M
(  .+  ,  F
) `  N )  .+  ( F `  ( N  +  1 ) ) )  e.  C
)
24 fvoveq1 5945 . . . . 5  |-  ( z  =  N  ->  ( F `  ( z  +  1 ) )  =  ( F `  ( N  +  1
) ) )
2524oveq2d 5938 . . . 4  |-  ( z  =  N  ->  (
w  .+  ( F `  ( z  +  1 ) ) )  =  ( w  .+  ( F `  ( N  +  1 ) ) ) )
26 oveq1 5929 . . . 4  |-  ( w  =  (  seq M
(  .+  ,  F
) `  N )  ->  ( w  .+  ( F `  ( N  +  1 ) ) )  =  ( (  seq M (  .+  ,  F ) `  N
)  .+  ( F `  ( N  +  1 ) ) ) )
27 eqid 2196 . . . 4  |-  ( z  e.  ( ZZ>= `  M
) ,  w  e.  C  |->  ( w  .+  ( F `  ( z  +  1 ) ) ) )  =  ( z  e.  ( ZZ>= `  M ) ,  w  e.  C  |->  ( w 
.+  ( F `  ( z  +  1 ) ) ) )
2825, 26, 27ovmpog 6057 . . 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 ) ) ) )
291, 16, 23, 28syl3anc 1249 . 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 ) ) ) )
3013, 29eqtrd 2229 1  |-  ( ph  ->  (  seq M ( 
.+  ,  F ) `
 ( N  + 
1 ) )  =  ( (  seq M
(  .+  ,  F
) `  N )  .+  ( F `  ( N  +  1 ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1364    e. wcel 2167   _Vcvv 2763    C_ wss 3157   <.cop 3625   ` cfv 5258  (class class class)co 5922    e. cmpo 5924  freccfrec 6448   1c1 7880    + caddc 7882   ZZcz 9326   ZZ>=cuz 9601    seqcseq 10539
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-nul 4159  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-iinf 4624  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-addcom 7979  ax-addass 7981  ax-distr 7983  ax-i2m1 7984  ax-0lt1 7985  ax-0id 7987  ax-rnegex 7988  ax-cnre 7990  ax-pre-ltirr 7991  ax-pre-ltwlin 7992  ax-pre-lttrn 7993  ax-pre-ltadd 7995
This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-tr 4132  df-id 4328  df-iord 4401  df-on 4403  df-ilim 4404  df-suc 4406  df-iom 4627  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199  df-recs 6363  df-frec 6449  df-pnf 8063  df-mnf 8064  df-xr 8065  df-ltxr 8066  df-le 8067  df-sub 8199  df-neg 8200  df-inn 8991  df-n0 9250  df-z 9327  df-uz 9602  df-seqfrec 10540
This theorem is referenced by:  ennnfonelemp1  12623
  Copyright terms: Public domain W3C validator