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

Theorem seqfeq3 10944
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 2238 . . . 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 10879 . . 3  |-  ( ph  ->  seq M (  .+  ,  F ) : (
ZZ>= `  M ) --> S )
65ffnd 5529 . 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 2316 . . . 4  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x Q y )  e.  S )
91, 2, 3, 8seqf 10879 . . 3  |-  ( ph  ->  seq M ( Q ,  F ) : ( ZZ>= `  M ) --> S )
109ffnd 5529 . 2  |-  ( ph  ->  seq M ( Q ,  F )  Fn  ( ZZ>= `  M )
)
115ffvelcdmda 5834 . . . 4  |-  ( (
ph  /\  a  e.  ( ZZ>= `  M )
)  ->  (  seq M (  .+  ,  F ) `  a
)  e.  S )
12 fvi 5754 . . . 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 481 . . . 4  |-  ( ( ( ph  /\  a  e.  ( ZZ>= `  M )
)  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  .+  y
)  e.  S )
153adantlr 481 . . . 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 481 . . . . 5  |-  ( ( ( ph  /\  a  e.  ( ZZ>= `  M )
)  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  .+  y
)  =  ( x Q y ) )
18 fvi 5754 . . . . . 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 5754 . . . . . . 7  |-  ( x  e.  S  ->  (  _I  `  x )  =  x )
2120ad2antrl 494 . . . . . 6  |-  ( ( ( ph  /\  a  e.  ( ZZ>= `  M )
)  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
(  _I  `  x
)  =  x )
22 fvi 5754 . . . . . . 7  |-  ( y  e.  S  ->  (  _I  `  y )  =  y )
2322ad2antll 495 . . . . . 6  |-  ( ( ( ph  /\  a  e.  ( ZZ>= `  M )
)  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
(  _I  `  y
)  =  y )
2421, 23oveq12d 6093 . . . . 5  |-  ( ( ( ph  /\  a  e.  ( ZZ>= `  M )
)  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( (  _I  `  x ) Q (  _I  `  y ) )  =  ( x Q y ) )
2517, 19, 243eqtr4d 2281 . . . 4  |-  ( ( ( ph  /\  a  e.  ( ZZ>= `  M )
)  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
(  _I  `  (
x  .+  y )
)  =  ( (  _I  `  x ) Q (  _I  `  y ) ) )
26 fvi 5754 . . . . 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 481 . . . 4  |-  ( ( ( ph  /\  a  e.  ( ZZ>= `  M )
)  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x Q y )  e.  S )
2914, 15, 16, 25, 27, 15, 28seq3homo 10942 . . 3  |-  ( (
ph  /\  a  e.  ( ZZ>= `  M )
)  ->  (  _I  `  (  seq M ( 
.+  ,  F ) `
 a ) )  =  (  seq M
( Q ,  F
) `  a )
)
3013, 29eqtr3d 2273 . 2  |-  ( (
ph  /\  a  e.  ( ZZ>= `  M )
)  ->  (  seq M (  .+  ,  F ) `  a
)  =  (  seq M ( Q ,  F ) `  a
) )
316, 10, 30eqfnfvd 5800 1  |-  ( ph  ->  seq M (  .+  ,  F )  =  seq M ( Q ,  F ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209    _I cid 4428   ` cfv 5372  (class class class)co 6075   ZZcz 9623   ZZ>=cuz 9900    seqcseq 10862
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 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 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-ltadd 8285
This theorem 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 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-ilim 4509  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-frec 6652  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-inn 9284  df-n0 9543  df-z 9624  df-uz 9901  df-seqfrec 10863
This theorem is referenced by:  mulgpropdg  13944
  Copyright terms: Public domain W3C validator