This PR ensures the `Fin.foldl` and `Fin.foldr` are semireducible. Without this the defeq `example (f : Fin 3 → ℕ) : List.ofFn f = [f 0, f 1, f 2] := rfl` was failing. Thanks @eric-wieser and @digama0 for diagnosing on [Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/.60List.2EfinRange.60.20in.20Mathlib/near/484191814). |
||
|---|---|---|
| .. | ||
| Basic.lean | ||
| Bitwise.lean | ||
| Fold.lean | ||
| Iterate.lean | ||
| Lemmas.lean | ||
| Log2.lean | ||