| 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 6840 | . . . . 5 ⊢ (𝑀 = 𝑁 → (𝐹‘𝑀) = (𝐹‘𝑁)) | |
| 2 | opeq12 4835 | . . . . 5 ⊢ ((𝑀 = 𝑁 ∧ (𝐹‘𝑀) = (𝐹‘𝑁)) → 〈𝑀, (𝐹‘𝑀)〉 = 〈𝑁, (𝐹‘𝑁)〉) | |
| 3 | 1, 2 | mpdan 687 | . . . 4 ⊢ (𝑀 = 𝑁 → 〈𝑀, (𝐹‘𝑀)〉 = 〈𝑁, (𝐹‘𝑁)〉) |
| 4 | rdgeq2 8357 | . . . 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 6019 | . 2 ⊢ (𝑀 = 𝑁 → (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) “ ω) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑁, (𝐹‘𝑁)〉) “ ω)) |
| 7 | df-seq 13943 | . 2 ⊢ seq𝑀( + , 𝐹) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) “ ω) | |
| 8 | df-seq 13943 | . 2 ⊢ seq𝑁( + , 𝐹) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑁, (𝐹‘𝑁)〉) “ ω) | |
| 9 | 6, 7, 8 | 3eqtr4g 2789 | 1 ⊢ (𝑀 = 𝑁 → seq𝑀( + , 𝐹) = seq𝑁( + , 𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 Vcvv 3444 〈cop 4591 “ cima 5634 ‘cfv 6499 (class class class)co 7369 ∈ cmpo 7371 ωcom 7822 reccrdg 8354 1c1 11045 + caddc 11047 seqcseq 13942 |
| 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 2701 |
| 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 2708 df-cleq 2721 df-clel 2803 df-ral 3045 df-rab 3403 df-v 3446 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4485 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-br 5103 df-opab 5165 df-mpt 5184 df-xp 5637 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-iota 6452 df-fv 6507 df-ov 7372 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-seq 13943 |
| This theorem is referenced by: seqeq1d 13948 seqfn 13954 seq1 13955 seqp1 13957 seqf1olem2 13983 seqid 13988 seqz 13991 iserex 15599 summolem2 15658 summo 15659 zsum 15660 isumsplit 15782 ntrivcvg 15839 ntrivcvgn0 15840 ntrivcvgtail 15842 ntrivcvgmullem 15843 prodmolem2 15877 prodmo 15878 zprod 15879 fprodntriv 15884 ege2le3 16032 gsumval2a 18588 leibpi 26828 dvradcnv2 44309 binomcxplemnotnn0 44318 stirlinglem12 46056 |
| Copyright terms: Public domain | W3C validator |