MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  seqeq1 Structured version   Visualization version   GIF version

Theorem seqeq1 14058
Description: Equality theorem for the sequence builder operation. (Contributed by Mario Carneiro, 4-Sep-2013.)
Assertion
Ref Expression
seqeq1 (𝑀 = 𝑁 → seq𝑀( + , 𝐹) = seq𝑁( + , 𝐹))

Proof of Theorem seqeq1
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6885 . . . . 5 (𝑀 = 𝑁 → (𝐹𝑀) = (𝐹𝑁))
2 opeq12 4842 . . . . 5 ((𝑀 = 𝑁 ∧ (𝐹𝑀) = (𝐹𝑁)) → ⟨𝑀, (𝐹𝑀)⟩ = ⟨𝑁, (𝐹𝑁)⟩)
31, 2mpdan 700 . . . 4 (𝑀 = 𝑁 → ⟨𝑀, (𝐹𝑀)⟩ = ⟨𝑁, (𝐹𝑁)⟩)
4 rdgeq2 8405 . . . 4 (⟨𝑀, (𝐹𝑀)⟩ = ⟨𝑁, (𝐹𝑁)⟩ → rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹𝑀)⟩) = rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑁, (𝐹𝑁)⟩))
53, 4syl 18 . . 3 (𝑀 = 𝑁 → rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹𝑀)⟩) = rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑁, (𝐹𝑁)⟩))
65imaeq1d 6063 . 2 (𝑀 = 𝑁 → (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹𝑀)⟩) “ ω) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑁, (𝐹𝑁)⟩) “ ω))
7 df-seq 14056 . 2 seq𝑀( + , 𝐹) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹𝑀)⟩) “ ω)
8 df-seq 14056 . 2 seq𝑁( + , 𝐹) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑁, (𝐹𝑁)⟩) “ ω)
96, 7, 83eqtr4g 2825 1 (𝑀 = 𝑁 → seq𝑀( + , 𝐹) = seq𝑁( + , 𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  Vcvv 3457  cop 4597  cima 5666  cfv 6540  (class class class)co 7419  cmpo 7421  ωcom 7868  reccrdg 8402  1c1 11116   + caddc 11118  seqcseq 14055
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-xp 5669  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-iota 6496  df-fv 6548  df-ov 7422  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-seq 14056
This theorem is used by:  seqeq1d  14061  seqfn  14067  seq1  14068  seqp1  14070  seqf1olem2  14096  seqid  14101  seqz  14104  iserex  15732  summolem2  15790  summo  15791  zsum  15792  isumsplit  15917  ntrivcvg  15974  ntrivcvgn0  15975  ntrivcvgtail  15977  ntrivcvgmullem  15978  prodmolem2  16012  prodmo  16013  zprod  16014  fprodntriv  16019  ege2le3  16166  gsumval2a  18775  leibpi  27158  dvradcnv2  45115  binomcxplemnotnn0  45124  stirlinglem12  46857
  Copyright terms: Public domain W3C validator