791bea027f
This PR adds lemmas reducing for loops over `Std.Range` to for loops over `List.range'`. Equivalent theorems previously existed in Batteries, but the underlying definitions have changed so these are written from scratch.
10 lines
421 B
Text
10 lines
421 B
Text
/-!
|
|
This tests that `0 : Fin (n + 1)` unfolds to `0 : Nat`, which is a property kept for backwards
|
|
compatibility with mathlib in Lean 3.
|
|
|
|
Some Zulip discussion is available
|
|
[here](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Nat.2Emod.200.20n.20.3D.200.20no.20longer.20true.20by.20rfl/near/319683008).
|
|
-/
|
|
|
|
example (n : Nat) : 0 % n = 0 := rfl
|
|
example (n : Nat) : (0 : Fin (n + 1)).val = 0 := rfl
|