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

Theorem seqeq2 13367
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 7156 . . . . . 6 ( + = 𝑄 → (𝑦 + (𝐹‘(𝑥 + 1))) = (𝑦𝑄(𝐹‘(𝑥 + 1))))
21opeq2d 4803 . . . . 5 ( + = 𝑄 → ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩ = ⟨(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))⟩)
32mpoeq3dv 7227 . . . 4 ( + = 𝑄 → (𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩) = (𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))⟩))
4 rdgeq1 8041 . . . 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 5922 . 2 ( + = 𝑄 → (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹𝑀)⟩) “ ω) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹𝑀)⟩) “ ω))
7 df-seq 13364 . 2 seq𝑀( + , 𝐹) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹𝑀)⟩) “ ω)
8 df-seq 13364 . 2 seq𝑀(𝑄, 𝐹) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))⟩), ⟨𝑀, (𝐹𝑀)⟩) “ ω)
96, 7, 83eqtr4g 2881 1 ( + = 𝑄 → seq𝑀( + , 𝐹) = seq𝑀(𝑄, 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1533  Vcvv 3494  cop 4566  cima 5552  cfv 6349  (class class class)co 7150  cmpo 7152  ωcom 7574  reccrdg 8039  1c1 10532   + caddc 10534  seqcseq 13363
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-br 5059  df-opab 5121  df-mpt 5139  df-xp 5555  df-cnv 5557  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-pred 6142  df-iota 6308  df-fv 6357  df-ov 7153  df-oprab 7154  df-mpo 7155  df-wrecs 7941  df-recs 8002  df-rdg 8040  df-seq 13364
This theorem is referenced by:  seqeq2d  13370  sadcom  15806  ressmulgnn  30665  cvmliftlem15  32540
  Copyright terms: Public domain W3C validator