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

Theorem seq3feq 10662
Description: Equality of sequences. (Contributed by Jim Kingdon, 15-Aug-2021.) (Revised by Jim Kingdon, 7-Apr-2023.)
Hypotheses
Ref Expression
seq3feq.1  |-  ( ph  ->  M  e.  ZZ )
seq3feq.f  |-  ( (
ph  /\  x  e.  ( ZZ>= `  M )
)  ->  ( F `  x )  e.  S
)
seq3feq.2  |-  ( (
ph  /\  k  e.  ( ZZ>= `  M )
)  ->  ( F `  k )  =  ( G `  k ) )
seq3feq.pl  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  .+  y
)  e.  S )
Assertion
Ref Expression
seq3feq  |-  ( ph  ->  seq M (  .+  ,  F )  =  seq M (  .+  ,  G ) )
Distinct variable groups:    .+ , k, x, y    k, F, x, y    k, G, x, y    k, M, x, y    S, k, x, y    ph, k, x, y

Proof of Theorem seq3feq
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 eqid 2207 . . . 4  |-  ( ZZ>= `  M )  =  (
ZZ>= `  M )
2 seq3feq.1 . . . 4  |-  ( ph  ->  M  e.  ZZ )
3 seq3feq.f . . . 4  |-  ( (
ph  /\  x  e.  ( ZZ>= `  M )
)  ->  ( F `  x )  e.  S
)
4 seq3feq.pl . . . 4  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  .+  y
)  e.  S )
51, 2, 3, 4seqf 10646 . . 3  |-  ( ph  ->  seq M (  .+  ,  F ) : (
ZZ>= `  M ) --> S )
65ffnd 5446 . 2  |-  ( ph  ->  seq M (  .+  ,  F )  Fn  ( ZZ>=
`  M ) )
7 fveq2 5599 . . . . . . 7  |-  ( k  =  x  ->  ( F `  k )  =  ( F `  x ) )
8 fveq2 5599 . . . . . . 7  |-  ( k  =  x  ->  ( G `  k )  =  ( G `  x ) )
97, 8eqeq12d 2222 . . . . . 6  |-  ( k  =  x  ->  (
( F `  k
)  =  ( G `
 k )  <->  ( F `  x )  =  ( G `  x ) ) )
10 seq3feq.2 . . . . . . . 8  |-  ( (
ph  /\  k  e.  ( ZZ>= `  M )
)  ->  ( F `  k )  =  ( G `  k ) )
1110ralrimiva 2581 . . . . . . 7  |-  ( ph  ->  A. k  e.  (
ZZ>= `  M ) ( F `  k )  =  ( G `  k ) )
1211adantr 276 . . . . . 6  |-  ( (
ph  /\  x  e.  ( ZZ>= `  M )
)  ->  A. k  e.  ( ZZ>= `  M )
( F `  k
)  =  ( G `
 k ) )
13 simpr 110 . . . . . 6  |-  ( (
ph  /\  x  e.  ( ZZ>= `  M )
)  ->  x  e.  ( ZZ>= `  M )
)
149, 12, 13rspcdva 2889 . . . . 5  |-  ( (
ph  /\  x  e.  ( ZZ>= `  M )
)  ->  ( F `  x )  =  ( G `  x ) )
1514, 3eqeltrrd 2285 . . . 4  |-  ( (
ph  /\  x  e.  ( ZZ>= `  M )
)  ->  ( G `  x )  e.  S
)
161, 2, 15, 4seqf 10646 . . 3  |-  ( ph  ->  seq M (  .+  ,  G ) : (
ZZ>= `  M ) --> S )
1716ffnd 5446 . 2  |-  ( ph  ->  seq M (  .+  ,  G )  Fn  ( ZZ>=
`  M ) )
18 simpr 110 . . 3  |-  ( (
ph  /\  z  e.  ( ZZ>= `  M )
)  ->  z  e.  ( ZZ>= `  M )
)
19 simpll 527 . . . 4  |-  ( ( ( ph  /\  z  e.  ( ZZ>= `  M )
)  /\  k  e.  ( M ... z ) )  ->  ph )
20 elfzuz 10178 . . . . 5  |-  ( k  e.  ( M ... z )  ->  k  e.  ( ZZ>= `  M )
)
2120adantl 277 . . . 4  |-  ( ( ( ph  /\  z  e.  ( ZZ>= `  M )
)  /\  k  e.  ( M ... z ) )  ->  k  e.  ( ZZ>= `  M )
)
2219, 21, 10syl2anc 411 . . 3  |-  ( ( ( ph  /\  z  e.  ( ZZ>= `  M )
)  /\  k  e.  ( M ... z ) )  ->  ( F `  k )  =  ( G `  k ) )
233adantlr 477 . . 3  |-  ( ( ( ph  /\  z  e.  ( ZZ>= `  M )
)  /\  x  e.  ( ZZ>= `  M )
)  ->  ( F `  x )  e.  S
)
2415adantlr 477 . . 3  |-  ( ( ( ph  /\  z  e.  ( ZZ>= `  M )
)  /\  x  e.  ( ZZ>= `  M )
)  ->  ( G `  x )  e.  S
)
254adantlr 477 . . 3  |-  ( ( ( ph  /\  z  e.  ( ZZ>= `  M )
)  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  .+  y
)  e.  S )
2618, 22, 23, 24, 25seq3fveq 10661 . 2  |-  ( (
ph  /\  z  e.  ( ZZ>= `  M )
)  ->  (  seq M (  .+  ,  F ) `  z
)  =  (  seq M (  .+  ,  G ) `  z
) )
276, 17, 26eqfnfvd 5703 1  |-  ( ph  ->  seq M (  .+  ,  F )  =  seq M (  .+  ,  G ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1373    e. wcel 2178   A.wral 2486   ` cfv 5290  (class class class)co 5967   ZZcz 9407   ZZ>=cuz 9683   ...cfz 10165    seqcseq 10629
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-nul 4186  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-iinf 4654  ax-cnex 8051  ax-resscn 8052  ax-1cn 8053  ax-1re 8054  ax-icn 8055  ax-addcl 8056  ax-addrcl 8057  ax-mulcl 8058  ax-addcom 8060  ax-addass 8062  ax-distr 8064  ax-i2m1 8065  ax-0lt1 8066  ax-0id 8068  ax-rnegex 8069  ax-cnre 8071  ax-pre-ltirr 8072  ax-pre-ltwlin 8073  ax-pre-lttrn 8074  ax-pre-ltadd 8076
This theorem depends on definitions:  df-bi 117  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-nel 2474  df-ral 2491  df-rex 2492  df-reu 2493  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-tr 4159  df-id 4358  df-iord 4431  df-on 4433  df-ilim 4434  df-suc 4436  df-iom 4657  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-riota 5922  df-ov 5970  df-oprab 5971  df-mpo 5972  df-1st 6249  df-2nd 6250  df-recs 6414  df-frec 6500  df-pnf 8144  df-mnf 8145  df-xr 8146  df-ltxr 8147  df-le 8148  df-sub 8280  df-neg 8281  df-inn 9072  df-n0 9331  df-z 9408  df-uz 9684  df-fz 10166  df-seqfrec 10630
This theorem is referenced by:  zsumdc  11810  fsum3cvg2  11820  isumshft  11916  geolim2  11938  cvgratz  11958  mertenslem2  11962  zproddc  12005
  Copyright terms: Public domain W3C validator