| 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 6861 | . . . . 5 ⊢ (𝑀 = 𝑁 → (𝐹‘𝑀) = (𝐹‘𝑁)) | |
| 2 | opeq12 4842 | . . . . 5 ⊢ ((𝑀 = 𝑁 ∧ (𝐹‘𝑀) = (𝐹‘𝑁)) → 〈𝑀, (𝐹‘𝑀)〉 = 〈𝑁, (𝐹‘𝑁)〉) | |
| 3 | 1, 2 | mpdan 687 | . . . 4 ⊢ (𝑀 = 𝑁 → 〈𝑀, (𝐹‘𝑀)〉 = 〈𝑁, (𝐹‘𝑁)〉) |
| 4 | rdgeq2 8383 | . . . 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 6033 | . 2 ⊢ (𝑀 = 𝑁 → (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) “ ω) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑁, (𝐹‘𝑁)〉) “ ω)) |
| 7 | df-seq 13974 | . 2 ⊢ seq𝑀( + , 𝐹) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) “ ω) | |
| 8 | df-seq 13974 | . 2 ⊢ seq𝑁( + , 𝐹) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑁, (𝐹‘𝑁)〉) “ ω) | |
| 9 | 6, 7, 8 | 3eqtr4g 2790 | 1 ⊢ (𝑀 = 𝑁 → seq𝑀( + , 𝐹) = seq𝑁( + , 𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 Vcvv 3450 〈cop 4598 “ cima 5644 ‘cfv 6514 (class class class)co 7390 ∈ cmpo 7392 ωcom 7845 reccrdg 8380 1c1 11076 + caddc 11078 seqcseq 13973 |
| 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 2702 |
| 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 2709 df-cleq 2722 df-clel 2804 df-ral 3046 df-rab 3409 df-v 3452 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-br 5111 df-opab 5173 df-mpt 5192 df-xp 5647 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-iota 6467 df-fv 6522 df-ov 7393 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-seq 13974 |
| This theorem is referenced by: seqeq1d 13979 seqfn 13985 seq1 13986 seqp1 13988 seqf1olem2 14014 seqid 14019 seqz 14022 iserex 15630 summolem2 15689 summo 15690 zsum 15691 isumsplit 15813 ntrivcvg 15870 ntrivcvgn0 15871 ntrivcvgtail 15873 ntrivcvgmullem 15874 prodmolem2 15908 prodmo 15909 zprod 15910 fprodntriv 15915 ege2le3 16063 gsumval2a 18619 leibpi 26859 dvradcnv2 44343 binomcxplemnotnn0 44352 stirlinglem12 46090 |
| Copyright terms: Public domain | W3C validator |