| 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 6862 | . . . . 5 ⊢ (𝑀 = 𝑁 → (𝐹‘𝑀) = (𝐹‘𝑁)) | |
| 2 | opeq12 4830 | . . . . 5 ⊢ ((𝑀 = 𝑁 ∧ (𝐹‘𝑀) = (𝐹‘𝑁)) → 〈𝑀, (𝐹‘𝑀)〉 = 〈𝑁, (𝐹‘𝑁)〉) | |
| 3 | 1, 2 | mpdan 697 | . . . 4 ⊢ (𝑀 = 𝑁 → 〈𝑀, (𝐹‘𝑀)〉 = 〈𝑁, (𝐹‘𝑁)〉) |
| 4 | rdgeq2 8377 | . . . 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 6044 | . 2 ⊢ (𝑀 = 𝑁 → (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) “ ω) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑁, (𝐹‘𝑁)〉) “ ω)) |
| 7 | df-seq 14009 | . 2 ⊢ seq𝑀( + , 𝐹) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) “ ω) | |
| 8 | df-seq 14009 | . 2 ⊢ seq𝑁( + , 𝐹) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑁, (𝐹‘𝑁)〉) “ ω) | |
| 9 | 6, 7, 8 | 3eqtr4g 2821 | 1 ⊢ (𝑀 = 𝑁 → seq𝑀( + , 𝐹) = seq𝑁( + , 𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1559 Vcvv 3453 〈cop 4585 “ cima 5646 ‘cfv 6516 (class class class)co 7391 ∈ cmpo 7393 ωcom 7841 reccrdg 8374 1c1 11068 + caddc 11070 seqcseq 14008 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3076 df-rab 3414 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4478 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-br 5098 df-opab 5160 df-mpt 5179 df-xp 5649 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-iota 6472 df-fv 6524 df-ov 7394 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-seq 14009 |
| This theorem is referenced by: seqeq1d 14014 seqfn 14020 seq1 14021 seqp1 14023 seqf1olem2 14049 seqid 14054 seqz 14057 iserex 15675 summolem2 15734 summo 15735 zsum 15736 isumsplit 15861 ntrivcvg 15918 ntrivcvgn0 15919 ntrivcvgtail 15921 ntrivcvgmullem 15922 prodmolem2 15956 prodmo 15957 zprod 15958 fprodntriv 15963 ege2le3 16111 gsumval2a 18710 leibpi 26995 dvradcnv2 44884 binomcxplemnotnn0 44893 stirlinglem12 46620 |
| Copyright terms: Public domain | W3C validator |