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

Theorem seq3p1 10922
Description: Value of the sequence builder function at a successor. (Contributed by Jim Kingdon, 30-Apr-2022.)
Hypotheses
Ref Expression
seq3p1.m  |-  ( ph  ->  N  e.  ( ZZ>= `  M ) )
seq3p1.f  |-  ( (
ph  /\  x  e.  ( ZZ>= `  M )
)  ->  ( F `  x )  e.  S
)
seq3p1.pl  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  .+  y
)  e.  S )
Assertion
Ref Expression
seq3p1  |-  ( ph  ->  (  seq M ( 
.+  ,  F ) `
 ( N  + 
1 ) )  =  ( (  seq M
(  .+  ,  F
) `  N )  .+  ( F `  ( N  +  1 ) ) ) )
Distinct variable groups:    x,  .+ , y    x, F, y    x, M, y    x, N, y   
x, S, y    ph, x, y

Proof of Theorem seq3p1
Dummy variables  a  b  w  z  c  d are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 seq3p1.m . . 3  |-  ( ph  ->  N  e.  ( ZZ>= `  M ) )
2 eluzel2 9941 . . . . 5  |-  ( N  e.  ( ZZ>= `  M
)  ->  M  e.  ZZ )
31, 2syl 14 . . . 4  |-  ( ph  ->  M  e.  ZZ )
4 fveq2 5698 . . . . . 6  |-  ( x  =  M  ->  ( F `  x )  =  ( F `  M ) )
54eleq1d 2307 . . . . 5  |-  ( x  =  M  ->  (
( F `  x
)  e.  S  <->  ( F `  M )  e.  S
) )
6 seq3p1.f . . . . . 6  |-  ( (
ph  /\  x  e.  ( ZZ>= `  M )
)  ->  ( F `  x )  e.  S
)
76ralrimiva 2623 . . . . 5  |-  ( ph  ->  A. x  e.  (
ZZ>= `  M ) ( F `  x )  e.  S )
8 uzid 9951 . . . . . 6  |-  ( M  e.  ZZ  ->  M  e.  ( ZZ>= `  M )
)
93, 8syl 14 . . . . 5  |-  ( ph  ->  M  e.  ( ZZ>= `  M ) )
105, 7, 9rspcdva 2934 . . . 4  |-  ( ph  ->  ( F `  M
)  e.  S )
11 ssv 3270 . . . . 5  |-  S  C_  _V
1211a1i 9 . . . 4  |-  ( ph  ->  S  C_  _V )
13 seq3p1.pl . . . . 5  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  .+  y
)  e.  S )
146, 13iseqovex 10915 . . . 4  |-  ( (
ph  /\  ( x  e.  ( ZZ>= `  M )  /\  y  e.  S
) )  ->  (
x ( z  e.  ( ZZ>= `  M ) ,  w  e.  S  |->  ( w  .+  ( F `  ( z  +  1 ) ) ) ) y )  e.  S )
15 iseqvalcbv 10916 . . . 4  |- frec ( ( a  e.  ( ZZ>= `  M ) ,  b  e.  _V  |->  <. (
a  +  1 ) ,  ( a ( c  e.  ( ZZ>= `  M ) ,  d  e.  S  |->  ( 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.  S  |->  ( w  .+  ( F `
 ( z  +  1 ) ) ) ) y ) >.
) ,  <. M , 
( F `  M
) >. )
163, 15, 6, 13seq3val 10917 . . . 4  |-  ( ph  ->  seq M (  .+  ,  F )  =  ran frec ( ( a  e.  (
ZZ>= `  M ) ,  b  e.  _V  |->  <.
( a  +  1 ) ,  ( a ( c  e.  (
ZZ>= `  M ) ,  d  e.  S  |->  ( d  .+  ( F `
 ( c  +  1 ) ) ) ) b ) >.
) ,  <. M , 
( F `  M
) >. ) )
173, 10, 12, 14, 15, 16frecuzrdgsuct 10881 . . 3  |-  ( (
ph  /\  N  e.  ( ZZ>= `  M )
)  ->  (  seq M (  .+  ,  F ) `  ( N  +  1 ) )  =  ( N ( z  e.  (
ZZ>= `  M ) ,  w  e.  S  |->  ( w  .+  ( F `
 ( z  +  1 ) ) ) ) (  seq M
(  .+  ,  F
) `  N )
) )
181, 17mpdan 425 . 2  |-  ( ph  ->  (  seq M ( 
.+  ,  F ) `
 ( N  + 
1 ) )  =  ( N ( z  e.  ( ZZ>= `  M
) ,  w  e.  S  |->  ( w  .+  ( F `  ( z  +  1 ) ) ) ) (  seq M (  .+  ,  F ) `  N
) ) )
19 eqid 2238 . . . . 5  |-  ( ZZ>= `  M )  =  (
ZZ>= `  M )
2019, 3, 6, 13seqf 10921 . . . 4  |-  ( ph  ->  seq M (  .+  ,  F ) : (
ZZ>= `  M ) --> S )
2120, 1ffvelcdmd 5847 . . 3  |-  ( ph  ->  (  seq M ( 
.+  ,  F ) `
 N )  e.  S )
22 fveq2 5698 . . . . . 6  |-  ( x  =  ( N  + 
1 )  ->  ( F `  x )  =  ( F `  ( N  +  1
) ) )
2322eleq1d 2307 . . . . 5  |-  ( x  =  ( N  + 
1 )  ->  (
( F `  x
)  e.  S  <->  ( F `  ( N  +  1 ) )  e.  S
) )
24 peano2uz 9998 . . . . . 6  |-  ( N  e.  ( ZZ>= `  M
)  ->  ( N  +  1 )  e.  ( ZZ>= `  M )
)
251, 24syl 14 . . . . 5  |-  ( ph  ->  ( N  +  1 )  e.  ( ZZ>= `  M ) )
2623, 7, 25rspcdva 2934 . . . 4  |-  ( ph  ->  ( F `  ( N  +  1 ) )  e.  S )
2713, 21, 26caovcld 6246 . . 3  |-  ( ph  ->  ( (  seq M
(  .+  ,  F
) `  N )  .+  ( F `  ( N  +  1 ) ) )  e.  S
)
28 fvoveq1 6111 . . . . 5  |-  ( z  =  N  ->  ( F `  ( z  +  1 ) )  =  ( F `  ( N  +  1
) ) )
2928oveq2d 6104 . . . 4  |-  ( z  =  N  ->  (
w  .+  ( F `  ( z  +  1 ) ) )  =  ( w  .+  ( F `  ( N  +  1 ) ) ) )
30 oveq1 6095 . . . 4  |-  ( w  =  (  seq M
(  .+  ,  F
) `  N )  ->  ( w  .+  ( F `  ( N  +  1 ) ) )  =  ( (  seq M (  .+  ,  F ) `  N
)  .+  ( F `  ( N  +  1 ) ) ) )
31 eqid 2238 . . . 4  |-  ( z  e.  ( ZZ>= `  M
) ,  w  e.  S  |->  ( w  .+  ( F `  ( z  +  1 ) ) ) )  =  ( z  e.  ( ZZ>= `  M ) ,  w  e.  S  |->  ( w 
.+  ( F `  ( z  +  1 ) ) ) )
3229, 30, 31ovmpog 6226 . . 3  |-  ( ( N  e.  ( ZZ>= `  M )  /\  (  seq M (  .+  ,  F ) `  N
)  e.  S  /\  ( (  seq M
(  .+  ,  F
) `  N )  .+  ( F `  ( N  +  1 ) ) )  e.  S
)  ->  ( N
( z  e.  (
ZZ>= `  M ) ,  w  e.  S  |->  ( w  .+  ( F `
 ( z  +  1 ) ) ) ) (  seq M
(  .+  ,  F
) `  N )
)  =  ( (  seq M (  .+  ,  F ) `  N
)  .+  ( F `  ( N  +  1 ) ) ) )
331, 21, 27, 32syl3anc 1278 . 2  |-  ( ph  ->  ( N ( z  e.  ( ZZ>= `  M
) ,  w  e.  S  |->  ( w  .+  ( F `  ( z  +  1 ) ) ) ) (  seq M (  .+  ,  F ) `  N
) )  =  ( (  seq M ( 
.+  ,  F ) `
 N )  .+  ( F `  ( N  +  1 ) ) ) )
3418, 33eqtrd 2271 1  |-  ( ph  ->  (  seq M ( 
.+  ,  F ) `
 ( N  + 
1 ) )  =  ( (  seq M
(  .+  ,  F
) `  N )  .+  ( F `  ( N  +  1 ) ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   _Vcvv 2821    C_ wss 3220   <.cop 3712   ` cfv 5380  (class class class)co 6088    e. cmpo 6090  freccfrec 6666   1c1 8186    + caddc 8188   ZZcz 9653   ZZ>=cuz 9936    seqcseq 10904
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-ltadd 8301
This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6581  df-frec 6667  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-inn 9314  df-n0 9575  df-z 9654  df-uz 9937  df-seqfrec 10905
This theorem is used by:  seqp1g  10923  seq3clss  10928  seq3m1  10930  seq3fveq2  10932  seq3shft2  10938  ser3mono  10944  seq3split  10945  seq3caopr3  10948  seq3id3  10981  seq3id2  10983  seq3homo  10984  seq3z  10985  seqfeq4g  10988  ser3ge0  10993  exp3vallem  10997  expp1  11003  facp1  11189  seq3coll  11315  resqrexlemfp1  11796  climserle  12135  clim2prod  12330  prodfap0  12336  prodfrecap  12337  ege2le3  12462  efgt1p2  12486  efgt1p  12487  algrp1  12848  pcmpt  13150  nninfdclemp1  13398  gzsumsplit1r  13773  mulgnnp1  13991  bposlem5  16332  depindlem1  16969
  Copyright terms: Public domain W3C validator