| 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 6881 | . . . . 5 ⊢ (𝑀 = 𝑁 → (𝐹‘𝑀) = (𝐹‘𝑁)) | |
| 2 | opeq12 4840 | . . . . 5 ⊢ ((𝑀 = 𝑁 ∧ (𝐹‘𝑀) = (𝐹‘𝑁)) → 〈𝑀, (𝐹‘𝑀)〉 = 〈𝑁, (𝐹‘𝑁)〉) | |
| 3 | 1, 2 | mpdan 699 | . . . 4 ⊢ (𝑀 = 𝑁 → 〈𝑀, (𝐹‘𝑀)〉 = 〈𝑁, (𝐹‘𝑁)〉) |
| 4 | rdgeq2 8395 | . . . 4 ⊢ (〈𝑀, (𝐹‘𝑀)〉 = 〈𝑁, (𝐹‘𝑁)〉 → rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) = rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑁, (𝐹‘𝑁)〉)) | |
| 5 | 3, 4 | syl 18 | . . 3 ⊢ (𝑀 = 𝑁 → rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) = rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑁, (𝐹‘𝑁)〉)) |
| 6 | 5 | imaeq1d 6061 | . 2 ⊢ (𝑀 = 𝑁 → (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) “ ω) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑁, (𝐹‘𝑁)〉) “ ω)) |
| 7 | df-seq 14034 | . 2 ⊢ seq𝑀( + , 𝐹) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) “ ω) | |
| 8 | df-seq 14034 | . 2 ⊢ seq𝑁( + , 𝐹) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑁, (𝐹‘𝑁)〉) “ ω) | |
| 9 | 6, 7, 8 | 3eqtr4g 2823 | 1 ⊢ (𝑀 = 𝑁 → seq𝑀( + , 𝐹) = seq𝑁( + , 𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1570 Vcvv 3455 〈cop 4595 “ cima 5664 ‘cfv 6536 (class class class)co 7410 ∈ cmpo 7412 ωcom 7858 reccrdg 8392 1c1 11096 + caddc 11098 seqcseq 14033 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-mpt 5193 df-xp 5667 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-iota 6492 df-fv 6544 df-ov 7413 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-seq 14034 |
| This theorem is referenced by: seqeq1d 14039 seqfn 14045 seq1 14046 seqp1 14048 seqf1olem2 14074 seqid 14079 seqz 14082 iserex 15704 summolem2 15763 summo 15764 zsum 15765 isumsplit 15890 ntrivcvg 15947 ntrivcvgn0 15948 ntrivcvgtail 15950 ntrivcvgmullem 15951 prodmolem2 15985 prodmo 15986 zprod 15987 fprodntriv 15992 ege2le3 16139 gsumval2a 18738 leibpi 27107 dvradcnv2 45057 binomcxplemnotnn0 45066 stirlinglem12 46799 |
| Copyright terms: Public domain | W3C validator |