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

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

Proof of Theorem seqeq2
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq 7197 . . . . . 6 ( + = 𝑄 → (𝑦 + (𝐹‘(𝑥 + 1))) = (𝑦𝑄(𝐹‘(𝑥 + 1))))
21opeq2d 4777 . . . . 5 ( + = 𝑄 → ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩ = ⟨(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))⟩)
32mpoeq3dv 7268 . . . 4 ( + = 𝑄 → (𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩) = (𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))⟩))
4 rdgeq1 8125 . . . 4 ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩) = (𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))⟩) → rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹𝑀)⟩) = rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹𝑀)⟩))
53, 4syl 17 . . 3 ( + = 𝑄 → rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹𝑀)⟩) = rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹𝑀)⟩))
65imaeq1d 5913 . 2 ( + = 𝑄 → (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹𝑀)⟩) “ ω) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹𝑀)⟩) “ ω))
7 df-seq 13540 . 2 seq𝑀( + , 𝐹) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹𝑀)⟩) “ ω)
8 df-seq 13540 . 2 seq𝑀(𝑄, 𝐹) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹𝑀)⟩) “ ω)
96, 7, 83eqtr4g 2796 1 ( + = 𝑄 → seq𝑀( + , 𝐹) = seq𝑀(𝑄, 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1543  Vcvv 3398  cop 4533  cima 5539  cfv 6358  (class class class)co 7191  cmpo 7193  ωcom 7622  reccrdg 8123  1c1 10695   + caddc 10697  seqcseq 13539
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-12 2177  ax-ext 2708
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-clab 2715  df-cleq 2728  df-clel 2809  df-ral 3056  df-rab 3060  df-v 3400  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-nul 4224  df-if 4426  df-sn 4528  df-pr 4530  df-op 4534  df-uni 4806  df-br 5040  df-opab 5102  df-mpt 5121  df-xp 5542  df-cnv 5544  df-dm 5546  df-rn 5547  df-res 5548  df-ima 5549  df-pred 6140  df-iota 6316  df-fv 6366  df-ov 7194  df-oprab 7195  df-mpo 7196  df-wrecs 8025  df-recs 8086  df-rdg 8124  df-seq 13540
This theorem is referenced by:  seqeq2d  13546  sadcom  15985  ressmulgnn  30965  cvmliftlem15  32927
  Copyright terms: Public domain W3C validator