| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > seqeq3d | GIF version | ||
| Description: Equality deduction for the sequence builder operation. (Contributed by Mario Carneiro, 7-Sep-2013.) |
| Ref | Expression |
|---|---|
| seqeqd.1 | ⊢ (𝜑 → 𝐴 = 𝐵) |
| Ref | Expression |
|---|---|
| seqeq3d | ⊢ (𝜑 → seq𝑀( + , 𝐴) = seq𝑀( + , 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | seqeqd.1 | . 2 ⊢ (𝜑 → 𝐴 = 𝐵) | |
| 2 | seqeq3 10891 | . 2 ⊢ (𝐴 = 𝐵 → seq𝑀( + , 𝐴) = seq𝑀( + , 𝐵)) | |
| 3 | 1, 2 | syl 14 | 1 ⊢ (𝜑 → seq𝑀( + , 𝐴) = seq𝑀( + , 𝐵)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 seqcseq 10886 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-un 3224 df-in 3226 df-ss 3233 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-br 4131 df-opab 4193 df-mpt 4194 df-cnv 4782 df-dm 4784 df-rn 4785 df-res 4786 df-iota 5337 df-fv 5385 df-ov 6088 df-oprab 6089 df-mpo 6090 df-recs 6576 df-frec 6662 df-seqfrec 10887 |
| This theorem is used by: seqeq123d 10895 seq3f1olemstep 10953 seq3f1olemp 10954 seqf1oglem2 10959 seqf1og 10960 exp3val 10980 sumeq1 12123 sumeq2 12127 summodc 12152 zsumdc 12153 fsum3 12156 isumz 12158 prodeq1f 12321 prodeq2w 12325 prodeq2 12326 prodmodc 12347 zproddc 12348 fprodseq 12352 prod1dc 12355 mulgval 13927 lgsval 16135 lgsval4 16151 lgsneg 16155 lgsmod 16157 |
| Copyright terms: Public domain | W3C validator |