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

Theorem seqfeq3 10891
Description: Equality of series under different addition operations which agree on an additively closed subset. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by Mario Carneiro, 25-Apr-2016.)
Hypotheses
Ref Expression
seqfeq3.m  |-  ( ph  ->  M  e.  ZZ )
seqfeq3.f  |-  ( (
ph  /\  x  e.  ( ZZ>= `  M )
)  ->  ( F `  x )  e.  S
)
seqfeq3.cl  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  .+  y
)  e.  S )
seqfeq3.id  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  .+  y
)  =  ( x Q y ) )
Assertion
Ref Expression
seqfeq3  |-  ( ph  ->  seq M (  .+  ,  F )  =  seq M ( Q ,  F ) )
Distinct variable groups:    ph, x, y   
x, F, y    x, M, y    x,  .+ , y    x, Q, y    x, S, y

Proof of Theorem seqfeq3
Dummy variable  a is distinct from all other variables.
StepHypRef Expression
1 eqid 2232 . . . 4  |-  ( ZZ>= `  M )  =  (
ZZ>= `  M )
2 seqfeq3.m . . . 4  |-  ( ph  ->  M  e.  ZZ )
3 seqfeq3.f . . . 4  |-  ( (
ph  /\  x  e.  ( ZZ>= `  M )
)  ->  ( F `  x )  e.  S
)
4 seqfeq3.cl . . . 4  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  .+  y
)  e.  S )
51, 2, 3, 4seqf 10826 . . 3  |-  ( ph  ->  seq M (  .+  ,  F ) : (
ZZ>= `  M ) --> S )
65ffnd 5509 . 2  |-  ( ph  ->  seq M (  .+  ,  F )  Fn  ( ZZ>=
`  M ) )
7 seqfeq3.id . . . . 5  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  .+  y
)  =  ( x Q y ) )
87, 4eqeltrrd 2310 . . . 4  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x Q y )  e.  S )
91, 2, 3, 8seqf 10826 . . 3  |-  ( ph  ->  seq M ( Q ,  F ) : ( ZZ>= `  M ) --> S )
109ffnd 5509 . 2  |-  ( ph  ->  seq M ( Q ,  F )  Fn  ( ZZ>= `  M )
)
115ffvelcdmda 5812 . . . 4  |-  ( (
ph  /\  a  e.  ( ZZ>= `  M )
)  ->  (  seq M (  .+  ,  F ) `  a
)  e.  S )
12 fvi 5734 . . . 4  |-  ( (  seq M (  .+  ,  F ) `  a
)  e.  S  -> 
(  _I  `  (  seq M (  .+  ,  F ) `  a
) )  =  (  seq M (  .+  ,  F ) `  a
) )
1311, 12syl 14 . . 3  |-  ( (
ph  /\  a  e.  ( ZZ>= `  M )
)  ->  (  _I  `  (  seq M ( 
.+  ,  F ) `
 a ) )  =  (  seq M
(  .+  ,  F
) `  a )
)
144adantlr 477 . . . 4  |-  ( ( ( ph  /\  a  e.  ( ZZ>= `  M )
)  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  .+  y
)  e.  S )
153adantlr 477 . . . 4  |-  ( ( ( ph  /\  a  e.  ( ZZ>= `  M )
)  /\  x  e.  ( ZZ>= `  M )
)  ->  ( F `  x )  e.  S
)
16 simpr 110 . . . 4  |-  ( (
ph  /\  a  e.  ( ZZ>= `  M )
)  ->  a  e.  ( ZZ>= `  M )
)
177adantlr 477 . . . . 5  |-  ( ( ( ph  /\  a  e.  ( ZZ>= `  M )
)  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  .+  y
)  =  ( x Q y ) )
18 fvi 5734 . . . . . 6  |-  ( ( x  .+  y )  e.  S  ->  (  _I  `  ( x  .+  y ) )  =  ( x  .+  y
) )
1914, 18syl 14 . . . . 5  |-  ( ( ( ph  /\  a  e.  ( ZZ>= `  M )
)  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
(  _I  `  (
x  .+  y )
)  =  ( x 
.+  y ) )
20 fvi 5734 . . . . . . 7  |-  ( x  e.  S  ->  (  _I  `  x )  =  x )
2120ad2antrl 490 . . . . . 6  |-  ( ( ( ph  /\  a  e.  ( ZZ>= `  M )
)  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
(  _I  `  x
)  =  x )
22 fvi 5734 . . . . . . 7  |-  ( y  e.  S  ->  (  _I  `  y )  =  y )
2322ad2antll 491 . . . . . 6  |-  ( ( ( ph  /\  a  e.  ( ZZ>= `  M )
)  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
(  _I  `  y
)  =  y )
2421, 23oveq12d 6068 . . . . 5  |-  ( ( ( ph  /\  a  e.  ( ZZ>= `  M )
)  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( (  _I  `  x ) Q (  _I  `  y ) )  =  ( x Q y ) )
2517, 19, 243eqtr4d 2275 . . . 4  |-  ( ( ( ph  /\  a  e.  ( ZZ>= `  M )
)  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
(  _I  `  (
x  .+  y )
)  =  ( (  _I  `  x ) Q (  _I  `  y ) ) )
26 fvi 5734 . . . . 5  |-  ( ( F `  x )  e.  S  ->  (  _I  `  ( F `  x ) )  =  ( F `  x
) )
2715, 26syl 14 . . . 4  |-  ( ( ( ph  /\  a  e.  ( ZZ>= `  M )
)  /\  x  e.  ( ZZ>= `  M )
)  ->  (  _I  `  ( F `  x
) )  =  ( F `  x ) )
288adantlr 477 . . . 4  |-  ( ( ( ph  /\  a  e.  ( ZZ>= `  M )
)  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x Q y )  e.  S )
2914, 15, 16, 25, 27, 15, 28seq3homo 10889 . . 3  |-  ( (
ph  /\  a  e.  ( ZZ>= `  M )
)  ->  (  _I  `  (  seq M ( 
.+  ,  F ) `
 a ) )  =  (  seq M
( Q ,  F
) `  a )
)
3013, 29eqtr3d 2267 . 2  |-  ( (
ph  /\  a  e.  ( ZZ>= `  M )
)  ->  (  seq M (  .+  ,  F ) `  a
)  =  (  seq M ( Q ,  F ) `  a
) )
316, 10, 30eqfnfvd 5778 1  |-  ( ph  ->  seq M (  .+  ,  F )  =  seq M ( Q ,  F ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2203    _I cid 4409   ` cfv 5352  (class class class)co 6050   ZZcz 9577   ZZ>=cuz 9853    seqcseq 10809
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  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-addcom 8227  ax-addass 8229  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-0id 8235  ax-rnegex 8236  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-ltadd 8243
This theorem depends on definitions:  df-bi 117  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-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  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-id 4414  df-iord 4487  df-on 4489  df-ilim 4490  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-frec 6622  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-inn 9238  df-n0 9497  df-z 9578  df-uz 9854  df-seqfrec 10810
This theorem is referenced by:  mulgpropdg  13881
  Copyright terms: Public domain W3C validator