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

Theorem seqomeq12 8376
Description: Equality theorem for seqω. (Contributed by Stefan O'Rear, 1-Nov-2014.)
Assertion
Ref Expression
seqomeq12 ((𝐴 = 𝐵𝐶 = 𝐷) → seqω(𝐴, 𝐶) = seqω(𝐵, 𝐷))

Proof of Theorem seqomeq12
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq 7355 . . . . . 6 (𝐴 = 𝐵 → (𝑎𝐴𝑏) = (𝑎𝐵𝑏))
21opeq2d 4831 . . . . 5 (𝐴 = 𝐵 → ⟨suc 𝑎, (𝑎𝐴𝑏)⟩ = ⟨suc 𝑎, (𝑎𝐵𝑏)⟩)
32mpoeq3dv 7428 . . . 4 (𝐴 = 𝐵 → (𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐴𝑏)⟩) = (𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐵𝑏)⟩))
4 fveq2 6822 . . . . 5 (𝐶 = 𝐷 → ( I ‘𝐶) = ( I ‘𝐷))
54opeq2d 4831 . . . 4 (𝐶 = 𝐷 → ⟨∅, ( I ‘𝐶)⟩ = ⟨∅, ( I ‘𝐷)⟩)
6 rdgeq12 8335 . . . 4 (((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐴𝑏)⟩) = (𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐵𝑏)⟩) ∧ ⟨∅, ( I ‘𝐶)⟩ = ⟨∅, ( I ‘𝐷)⟩) → rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐴𝑏)⟩), ⟨∅, ( I ‘𝐶)⟩) = rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐵𝑏)⟩), ⟨∅, ( I ‘𝐷)⟩))
73, 5, 6syl2an 596 . . 3 ((𝐴 = 𝐵𝐶 = 𝐷) → rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐴𝑏)⟩), ⟨∅, ( I ‘𝐶)⟩) = rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐵𝑏)⟩), ⟨∅, ( I ‘𝐷)⟩))
87imaeq1d 6010 . 2 ((𝐴 = 𝐵𝐶 = 𝐷) → (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐴𝑏)⟩), ⟨∅, ( I ‘𝐶)⟩) “ ω) = (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐵𝑏)⟩), ⟨∅, ( I ‘𝐷)⟩) “ ω))
9 df-seqom 8370 . 2 seqω(𝐴, 𝐶) = (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐴𝑏)⟩), ⟨∅, ( I ‘𝐶)⟩) “ ω)
10 df-seqom 8370 . 2 seqω(𝐵, 𝐷) = (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐵𝑏)⟩), ⟨∅, ( I ‘𝐷)⟩) “ ω)
118, 9, 103eqtr4g 2789 1 ((𝐴 = 𝐵𝐶 = 𝐷) → seqω(𝐴, 𝐶) = seqω(𝐵, 𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  Vcvv 3436  c0 4284  cop 4583   I cid 5513  cima 5622  suc csuc 6309  cfv 6482  (class class class)co 7349  cmpo 7351  ωcom 7799  reccrdg 8331  seqωcseqom 8369
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rab 3395  df-v 3438  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4285  df-if 4477  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-br 5093  df-opab 5155  df-mpt 5174  df-xp 5625  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6249  df-iota 6438  df-fv 6490  df-ov 7352  df-oprab 7353  df-mpo 7354  df-frecs 8214  df-wrecs 8245  df-recs 8294  df-rdg 8332  df-seqom 8370
This theorem is referenced by:  cantnffval  9559  cantnfval  9564  cantnfres  9573  cnfcomlem  9595  cnfcom2  9598  fin23lem33  10239
  Copyright terms: Public domain W3C validator