| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > seqeq1 | Structured version Visualization version GIF version | ||
| Description: Equality theorem for the sequence builder operation. (Contributed by Mario Carneiro, 4-Sep-2013.) |
| Ref | Expression |
|---|---|
| seqeq1 | ⊢ (𝑀 = 𝑁 → seq𝑀( + , 𝐹) = seq𝑁( + , 𝐹)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq2 6827 | . . . . 5 ⊢ (𝑀 = 𝑁 → (𝐹‘𝑀) = (𝐹‘𝑁)) | |
| 2 | opeq12 4806 | . . . . 5 ⊢ ((𝑀 = 𝑁 ∧ (𝐹‘𝑀) = (𝐹‘𝑁)) → 〈𝑀, (𝐹‘𝑀)〉 = 〈𝑁, (𝐹‘𝑁)〉) | |
| 3 | 1, 2 | mpdan 693 | . . . 4 ⊢ (𝑀 = 𝑁 → 〈𝑀, (𝐹‘𝑀)〉 = 〈𝑁, (𝐹‘𝑁)〉) |
| 4 | rdgeq2 8341 | . . . 4 ⊢ (〈𝑀, (𝐹‘𝑀)〉 = 〈𝑁, (𝐹‘𝑁)〉 → rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) = rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑁, (𝐹‘𝑁)〉)) | |
| 5 | 3, 4 | syl 17 | . . 3 ⊢ (𝑀 = 𝑁 → rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) = rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑁, (𝐹‘𝑁)〉)) |
| 6 | 5 | imaeq1d 6011 | . 2 ⊢ (𝑀 = 𝑁 → (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) “ ω) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑁, (𝐹‘𝑁)〉) “ ω)) |
| 7 | df-seq 13955 | . 2 ⊢ seq𝑀( + , 𝐹) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) “ ω) | |
| 8 | df-seq 13955 | . 2 ⊢ seq𝑁( + , 𝐹) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑁, (𝐹‘𝑁)〉) “ ω) | |
| 9 | 6, 7, 8 | 3eqtr4g 2799 | 1 ⊢ (𝑀 = 𝑁 → seq𝑀( + , 𝐹) = seq𝑁( + , 𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1547 Vcvv 3431 〈cop 4561 “ cima 5621 ‘cfv 6485 (class class class)co 7356 ∈ cmpo 7358 ωcom 7806 reccrdg 8338 1c1 11030 + caddc 11032 seqcseq 13954 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-ral 3054 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-br 5073 df-opab 5135 df-mpt 5154 df-xp 5624 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-iota 6441 df-fv 6493 df-ov 7359 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-seq 13955 |
| This theorem is referenced by: seqeq1d 13960 seqfn 13966 seq1 13967 seqp1 13969 seqf1olem2 13995 seqid 14000 seqz 14003 iserex 15610 summolem2 15669 summo 15670 zsum 15671 isumsplit 15796 ntrivcvg 15853 ntrivcvgn0 15854 ntrivcvgtail 15856 ntrivcvgmullem 15857 prodmolem2 15891 prodmo 15892 zprod 15893 fprodntriv 15898 ege2le3 16046 gsumval2a 18644 leibpi 26924 dvradcnv2 44791 binomcxplemnotnn0 44800 stirlinglem12 46528 |
| Copyright terms: Public domain | W3C validator |