![]() |
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 7368 | . . . . . 6 ⊢ (𝐴 = 𝐵 → (𝑎𝐴𝑏) = (𝑎𝐵𝑏)) | |
2 | 1 | opeq2d 4842 | . . . . 5 ⊢ (𝐴 = 𝐵 → 〈suc 𝑎, (𝑎𝐴𝑏)〉 = 〈suc 𝑎, (𝑎𝐵𝑏)〉) |
3 | 2 | mpoeq3dv 7441 | . . . 4 ⊢ (𝐴 = 𝐵 → (𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐴𝑏)〉) = (𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐵𝑏)〉)) |
4 | fveq2 6847 | . . . . 5 ⊢ (𝐶 = 𝐷 → ( I ‘𝐶) = ( I ‘𝐷)) | |
5 | 4 | opeq2d 4842 | . . . 4 ⊢ (𝐶 = 𝐷 → 〈∅, ( I ‘𝐶)〉 = 〈∅, ( I ‘𝐷)〉) |
6 | rdgeq12 8364 | . . . 4 ⊢ (((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐴𝑏)〉) = (𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐵𝑏)〉) ∧ 〈∅, ( I ‘𝐶)〉 = 〈∅, ( I ‘𝐷)〉) → rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐴𝑏)〉), 〈∅, ( I ‘𝐶)〉) = rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐵𝑏)〉), 〈∅, ( I ‘𝐷)〉)) | |
7 | 3, 5, 6 | syl2an 596 | . . 3 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐴𝑏)〉), 〈∅, ( I ‘𝐶)〉) = rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐵𝑏)〉), 〈∅, ( I ‘𝐷)〉)) |
8 | 7 | imaeq1d 6017 | . 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐴𝑏)〉), 〈∅, ( I ‘𝐶)〉) “ ω) = (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐵𝑏)〉), 〈∅, ( I ‘𝐷)〉) “ ω)) |
9 | df-seqom 8399 | . 2 ⊢ seqω(𝐴, 𝐶) = (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐴𝑏)〉), 〈∅, ( I ‘𝐶)〉) “ ω) | |
10 | df-seqom 8399 | . 2 ⊢ seqω(𝐵, 𝐷) = (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐵𝑏)〉), 〈∅, ( I ‘𝐷)〉) “ ω) | |
11 | 8, 9, 10 | 3eqtr4g 2796 | 1 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → seqω(𝐴, 𝐶) = seqω(𝐵, 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 Vcvv 3446 ∅c0 4287 〈cop 4597 I cid 5535 “ cima 5641 suc csuc 6324 ‘cfv 6501 (class class class)co 7362 ∈ cmpo 7364 ωcom 7807 reccrdg 8360 seqωcseqom 8398 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2702 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2709 df-cleq 2723 df-clel 2809 df-ral 3061 df-rab 3406 df-v 3448 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4288 df-if 4492 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4871 df-br 5111 df-opab 5173 df-mpt 5194 df-xp 5644 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6258 df-iota 6453 df-fv 6509 df-ov 7365 df-oprab 7366 df-mpo 7367 df-frecs 8217 df-wrecs 8248 df-recs 8322 df-rdg 8361 df-seqom 8399 |
This theorem is referenced by: cantnffval 9608 cantnfval 9613 cantnfres 9622 cnfcomlem 9644 cnfcom2 9647 fin23lem33 10290 |
Copyright terms: Public domain | W3C validator |