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

Theorem seqp1cd 10239
Description: Value of the sequence builder function at a successor. A version of seq3p1 10235 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 9331 . . . . 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 3119 . . . . 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 10236 . . . 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 10230 . . . 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 10232 . . . 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 10197 . . 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 417 . 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 2139 . . . . 5  |-  ( ZZ>= `  M )  =  (
ZZ>= `  M )
154, 8, 14, 3, 7seqf2 10237 . . . 4  |-  ( ph  ->  seq M (  .+  ,  F ) : (
ZZ>= `  M ) --> C )
1615, 1ffvelrnd 5556 . . 3  |-  ( ph  ->  (  seq M ( 
.+  ,  F ) `
 N )  e.  C )
17 fveq2 5421 . . . . . 6  |-  ( x  =  ( N  + 
1 )  ->  ( F `  x )  =  ( F `  ( N  +  1
) ) )
1817eleq1d 2208 . . . . 5  |-  ( x  =  ( N  + 
1 )  ->  (
( F `  x
)  e.  D  <->  ( F `  ( N  +  1 ) )  e.  D
) )
197ralrimiva 2505 . . . . 5  |-  ( ph  ->  A. x  e.  (
ZZ>= `  ( M  + 
1 ) ) ( F `  x )  e.  D )
20 eluzp1p1 9351 . . . . . 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 2794 . . . 4  |-  ( ph  ->  ( F `  ( N  +  1 ) )  e.  D )
238, 16, 22caovcld 5924 . . 3  |-  ( ph  ->  ( (  seq M
(  .+  ,  F
) `  N )  .+  ( F `  ( N  +  1 ) ) )  e.  C
)
24 fvoveq1 5797 . . . . 5  |-  ( z  =  N  ->  ( F `  ( z  +  1 ) )  =  ( F `  ( N  +  1
) ) )
2524oveq2d 5790 . . . 4  |-  ( z  =  N  ->  (
w  .+  ( F `  ( z  +  1 ) ) )  =  ( w  .+  ( F `  ( N  +  1 ) ) ) )
26 oveq1 5781 . . . 4  |-  ( w  =  (  seq M
(  .+  ,  F
) `  N )  ->  ( w  .+  ( F `  ( N  +  1 ) ) )  =  ( (  seq M (  .+  ,  F ) `  N
)  .+  ( F `  ( N  +  1 ) ) ) )
27 eqid 2139 . . . 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 5905 . . 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 1216 . 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 2172 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 103    = wceq 1331    e. wcel 1480   _Vcvv 2686    C_ wss 3071   <.cop 3530   ` cfv 5123  (class class class)co 5774    e. cmpo 5776  freccfrec 6287   1c1 7621    + caddc 7623   ZZcz 9054   ZZ>=cuz 9326    seqcseq 10218
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-nul 4054  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-iinf 4502  ax-cnex 7711  ax-resscn 7712  ax-1cn 7713  ax-1re 7714  ax-icn 7715  ax-addcl 7716  ax-addrcl 7717  ax-mulcl 7718  ax-addcom 7720  ax-addass 7722  ax-distr 7724  ax-i2m1 7725  ax-0lt1 7726  ax-0id 7728  ax-rnegex 7729  ax-cnre 7731  ax-pre-ltirr 7732  ax-pre-ltwlin 7733  ax-pre-lttrn 7734  ax-pre-ltadd 7736
This theorem depends on definitions:  df-bi 116  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-nel 2404  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-tr 4027  df-id 4215  df-iord 4288  df-on 4290  df-ilim 4291  df-suc 4293  df-iom 4505  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-riota 5730  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039  df-recs 6202  df-frec 6288  df-pnf 7802  df-mnf 7803  df-xr 7804  df-ltxr 7805  df-le 7806  df-sub 7935  df-neg 7936  df-inn 8721  df-n0 8978  df-z 9055  df-uz 9327  df-seqfrec 10219
This theorem is referenced by:  ennnfonelemp1  11919
  Copyright terms: Public domain W3C validator