| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > seqeq123d | Structured version Visualization version GIF version | ||
| Description: Equality deduction for the sequence builder operation. (Contributed by Mario Carneiro, 7-Sep-2013.) |
| Ref | Expression |
|---|---|
| seqeq123d.1 | ⊢ (𝜑 → 𝑀 = 𝑁) |
| seqeq123d.2 | ⊢ (𝜑 → + = 𝑄) |
| seqeq123d.3 | ⊢ (𝜑 → 𝐹 = 𝐺) |
| Ref | Expression |
|---|---|
| seqeq123d | ⊢ (𝜑 → seq𝑀( + , 𝐹) = seq𝑁(𝑄, 𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | seqeq123d.1 | . . 3 ⊢ (𝜑 → 𝑀 = 𝑁) | |
| 2 | 1 | seqeq1d 13916 | . 2 ⊢ (𝜑 → seq𝑀( + , 𝐹) = seq𝑁( + , 𝐹)) |
| 3 | seqeq123d.2 | . . 3 ⊢ (𝜑 → + = 𝑄) | |
| 4 | 3 | seqeq2d 13917 | . 2 ⊢ (𝜑 → seq𝑁( + , 𝐹) = seq𝑁(𝑄, 𝐹)) |
| 5 | seqeq123d.3 | . . 3 ⊢ (𝜑 → 𝐹 = 𝐺) | |
| 6 | 5 | seqeq3d 13918 | . 2 ⊢ (𝜑 → seq𝑁(𝑄, 𝐹) = seq𝑁(𝑄, 𝐺)) |
| 7 | 2, 4, 6 | 3eqtrd 2772 | 1 ⊢ (𝜑 → seq𝑀( + , 𝐹) = seq𝑁(𝑄, 𝐺)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 seqcseq 13910 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2705 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2712 df-cleq 2725 df-clel 2808 df-ral 3049 df-rab 3397 df-v 3439 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4475 df-sn 4576 df-pr 4578 df-op 4582 df-uni 4859 df-br 5094 df-opab 5156 df-mpt 5175 df-xp 5625 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6253 df-iota 6442 df-fv 6494 df-ov 7355 df-oprab 7356 df-mpo 7357 df-frecs 8217 df-wrecs 8248 df-recs 8297 df-rdg 8335 df-seq 13911 |
| This theorem is referenced by: relexpsucnnr 14934 sseqval 34422 bj-finsumval0 37350 itcoval 48787 |
| Copyright terms: Public domain | W3C validator |