![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > seqomeq12 | Structured version Visualization version GIF version |
Description: Equality theorem for seqω. (Contributed by Stefan O'Rear, 1-Nov-2014.) |
Ref | Expression |
---|---|
seqomeq12 | ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → seqω(𝐴, 𝐶) = seqω(𝐵, 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oveq 7415 | . . . . . 6 ⊢ (𝐴 = 𝐵 → (𝑎𝐴𝑏) = (𝑎𝐵𝑏)) | |
2 | 1 | opeq2d 4881 | . . . . 5 ⊢ (𝐴 = 𝐵 → ⟨suc 𝑎, (𝑎𝐴𝑏)⟩ = ⟨suc 𝑎, (𝑎𝐵𝑏)⟩) |
3 | 2 | mpoeq3dv 7488 | . . . 4 ⊢ (𝐴 = 𝐵 → (𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐴𝑏)⟩) = (𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐵𝑏)⟩)) |
4 | fveq2 6892 | . . . . 5 ⊢ (𝐶 = 𝐷 → ( I ‘𝐶) = ( I ‘𝐷)) | |
5 | 4 | opeq2d 4881 | . . . 4 ⊢ (𝐶 = 𝐷 → ⟨∅, ( I ‘𝐶)⟩ = ⟨∅, ( I ‘𝐷)⟩) |
6 | rdgeq12 8413 | . . . 4 ⊢ (((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐴𝑏)⟩) = (𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐵𝑏)⟩) ∧ ⟨∅, ( I ‘𝐶)⟩ = ⟨∅, ( I ‘𝐷)⟩) → rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐴𝑏)⟩), ⟨∅, ( I ‘𝐶)⟩) = rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐵𝑏)⟩), ⟨∅, ( I ‘𝐷)⟩)) | |
7 | 3, 5, 6 | syl2an 597 | . . 3 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐴𝑏)⟩), ⟨∅, ( I ‘𝐶)⟩) = rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐵𝑏)⟩), ⟨∅, ( I ‘𝐷)⟩)) |
8 | 7 | imaeq1d 6059 | . 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐴𝑏)⟩), ⟨∅, ( I ‘𝐶)⟩) “ ω) = (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐵𝑏)⟩), ⟨∅, ( I ‘𝐷)⟩) “ ω)) |
9 | df-seqom 8448 | . 2 ⊢ seqω(𝐴, 𝐶) = (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐴𝑏)⟩), ⟨∅, ( I ‘𝐶)⟩) “ ω) | |
10 | df-seqom 8448 | . 2 ⊢ seqω(𝐵, 𝐷) = (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ ⟨suc 𝑎, (𝑎𝐵𝑏)⟩), ⟨∅, ( I ‘𝐷)⟩) “ ω) | |
11 | 8, 9, 10 | 3eqtr4g 2798 | 1 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → seqω(𝐴, 𝐶) = seqω(𝐵, 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 Vcvv 3475 ∅c0 4323 ⟨cop 4635 I cid 5574 “ cima 5680 suc csuc 6367 ‘cfv 6544 (class class class)co 7409 ∈ cmpo 7411 ωcom 7855 reccrdg 8409 seqωcseqom 8447 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-ext 2704 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-ral 3063 df-rab 3434 df-v 3477 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4324 df-if 4530 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-br 5150 df-opab 5212 df-mpt 5233 df-xp 5683 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-iota 6496 df-fv 6552 df-ov 7412 df-oprab 7413 df-mpo 7414 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-seqom 8448 |
This theorem is referenced by: cantnffval 9658 cantnfval 9663 cantnfres 9672 cnfcomlem 9694 cnfcom2 9697 fin23lem33 10340 |
Copyright terms: Public domain | W3C validator |