Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

4
  • $\begingroup$ Thanks, this solves my example, but it seems to struggle with a simpler lemma of this sort: lemma bar (r: Array α) (b: List α): r ++ b = { data := r.data ++ b } Even when importing Std.Data.List.Init.Lemmas as well. Is this the result of a missing lemma, or are there more tricks needed for these sorts of proofs? $\endgroup$ Commented Dec 12, 2022 at 17:58
  • $\begingroup$ I was able to solve it using rw [← Array.appendList_data], but is there an easier way that doesn't require me manually searching for lemmas? $\endgroup$ Commented Dec 12, 2022 at 18:19
  • $\begingroup$ @JeremySalwen See my edits. $\endgroup$
    – Jason Rute
    Commented Dec 12, 2022 at 22:07
  • $\begingroup$ @JeremySalwen Also the congr proof seems to work with the symmetric goal, { data := r.data ++ b } = r ++ b. That is a bit annoying, but good to know. $\endgroup$
    – Jason Rute
    Commented Dec 12, 2022 at 22:16