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

Theorem seqomeq12 8502
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 7457 . . . . . 6 (𝐴 = 𝐵 → (𝑎𝐴𝑏) = (𝑎𝐵𝑏))
21opeq2d 4852 . . . . 5 (𝐴 = 𝐵 → ⟨suc 𝑎, (𝑎𝐴𝑏)⟩ = ⟨suc 𝑎, (𝑎𝐵𝑏)⟩)
32mpoeq3dv 7530 . . . 4 (𝐴 = 𝐵 → (𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐴𝑏)⟩) = (𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐵𝑏)⟩))
4 fveq2 6916 . . . . 5 (𝐶 = 𝐷 → ( I ‘𝐶) = ( I ‘𝐷))
54opeq2d 4852 . . . 4 (𝐶 = 𝐷 → ⟨∅, ( I ‘𝐶)⟩ = ⟨∅, ( I ‘𝐷)⟩)
6 rdgeq12 8459 . . . 4 (((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐴𝑏)⟩) = (𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐵𝑏)⟩) ∧ ⟨∅, ( I ‘𝐶)⟩ = ⟨∅, ( I ‘𝐷)⟩) → rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐴𝑏)⟩), ⟨∅, ( I ‘𝐶)⟩) = rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐵𝑏)⟩), ⟨∅, ( I ‘𝐷)⟩))
73, 5, 6syl2an 608 . . 3 ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐴𝑏)⟩), ⟨∅, ( I ‘𝐶)⟩) = rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐵𝑏)⟩), ⟨∅, ( I ‘𝐷)⟩))
87imaeq1d 6069 . 2 ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐴𝑏)⟩), ⟨∅, ( I ‘𝐶)⟩) “ ω) = (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐵𝑏)⟩), ⟨∅, ( I ‘𝐷)⟩) “ ω))
9 df-seqom 8496 . 2 seqω(𝐴, 𝐶) = (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐴𝑏)⟩), ⟨∅, ( I ‘𝐶)⟩) “ ω)
10 df-seqom 8496 . 2 seqω(𝐵, 𝐷) = (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐵𝑏)⟩), ⟨∅, ( I ‘𝐷)⟩) “ ω)
118, 9, 103eqtr4g 2823 1 ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → seqω(𝐴, 𝐶) = seqω(𝐵, 𝐷))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  Vcvv 3454  ∅c0 4281  ⟨cop 4840   I cid 5552   “ cima 5661  suc csuc 6390  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  ωcom 7911  reccrdg 8455  seqωcseqom 8495
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-xp 5664  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-iota 6520  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-seqom 8496
This theorem is used by:  cantnffval  9701  cantnfval  9706  cantnfres  9715  cnfcomlem  9737  cnfcom2  9740  fin23lem33  10462
  Copyright terms: Public domain W3C validator