| 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 10903 | . 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 10898 |
| 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 10899 |
| This theorem is used by: seqeq123d 10907 seq3f1olemstep 10965 seq3f1olemp 10966 seqf1oglem2 10971 seqf1og 10972 exp3val 10992 sumeq1 12139 sumeq2 12143 summodc 12168 zsumdc 12169 fsum3 12172 isumz 12174 prodeq1f 12337 prodeq2w 12341 prodeq2 12342 prodmodc 12363 zproddc 12364 fprodseq 12368 prod1dc 12371 mulgval 13976 lgsval 16245 lgsval4 16261 lgsneg 16265 lgsmod 16267 |
| Copyright terms: Public domain | W3C validator |