lean4-htt/tests/lean/run/structuralEqns.lean
Leonardo de Moura 22b5c957e9
chore: rename automatically generated "unfold" theorems (#3767)
Given a definition `foo`, they were previously called `foo._unfold`
until 4.7.0. We tried to rename them to `foo.def`, but it created too
many issues in the Mathlib repo. We decided to rename it again to
`foo.eq_def`. The new name is also consistent with the `eq_<idx>`
theorems generated for different "cases". That is, `foo.eq_def` is the
equality theorem for the whole definition, and `foo.eq_<idx>` is the
equality theorem for case `<idx>`.

cc @semorrison
2024-03-25 21:41:26 +00:00

86 lines
1.5 KiB
Text
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

import Lean
open Lean
open Lean.Meta
def tst (declName : Name) : MetaM Unit := do
IO.println (← getUnfoldEqnFor? declName)
#eval tst ``List.map
#check @List.map.eq_1
#check @List.map.eq_2
#check @List.map.eq_def
def foo (xs ys zs : List Nat) : List Nat :=
match (xs, ys) with
| (xs', ys') =>
match zs with
| z::zs => foo xs ys zs
| _ => match ys' with
| [] => [1]
| _ => [2]
#eval tst ``foo
#check foo.eq_1
#check foo.eq_2
#check foo.eq_def
#eval tst ``foo
def g : List Nat → List Nat → Nat
| [], y::ys => y
| [], ys => 0
| [x1], ys => g [] ys
| x::xs, y::ys => g xs ys + y
| x::xs, [] => g xs []
#eval tst ``g
#check g.eq_1
#check g.eq_2
#check g.eq_3
#check g.eq_4
#check g.eq_5
#check g.eq_def
def h (xs : List Nat) (y : Nat) : Nat :=
match xs with
| [] => y
| x::xs =>
match y with
| 0 => h xs 10
| y+1 => h xs y
#eval tst ``h
#check h.eq_1
#check h.eq_2
#check h.eq_def
def r (i j : Nat) : Nat :=
i +
match j with
| Nat.zero => 1
| Nat.succ j =>
i * match j with
| Nat.zero => 2
| Nat.succ j => r i j
#eval tst ``r
#check r.eq_1
#check r.eq_2
#check r.eq_3
#check r.eq_def
def bla (f g : ααα) (a : α) (i : α) (j : Nat) : α :=
f i <|
match j with
| Nat.zero => i
| Nat.succ j =>
g i <| match j with
| Nat.zero => a
| Nat.succ j => bla f g a i j
#eval tst ``bla
#check @bla.eq_1
#check @bla.eq_2
#check @bla.eq_3
#check @bla.eq_def