| 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 13960 | . 2 ⊢ (𝜑 → seq𝑀( + , 𝐹) = seq𝑁( + , 𝐹)) |
| 3 | seqeq123d.2 | . . 3 ⊢ (𝜑 → + = 𝑄) | |
| 4 | 3 | seqeq2d 13961 | . 2 ⊢ (𝜑 → seq𝑁( + , 𝐹) = seq𝑁(𝑄, 𝐹)) |
| 5 | seqeq123d.3 | . . 3 ⊢ (𝜑 → 𝐹 = 𝐺) | |
| 6 | 5 | seqeq3d 13962 | . 2 ⊢ (𝜑 → seq𝑁(𝑄, 𝐹) = seq𝑁(𝑄, 𝐺)) |
| 7 | 2, 4, 6 | 3eqtrd 2776 | 1 ⊢ (𝜑 → seq𝑀( + , 𝐹) = seq𝑁(𝑄, 𝐺)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 seqcseq 13954 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 df-xp 5630 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-iota 6448 df-fv 6500 df-ov 7363 df-oprab 7364 df-mpo 7365 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-seq 13955 |
| This theorem is referenced by: relexpsucnnr 14978 sseqval 34548 bj-finsumval0 37615 itcoval 49149 |
| Copyright terms: Public domain | W3C validator |