22b5c957e9
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
64 lines
994 B
Text
64 lines
994 B
Text
namespace Ex1
|
|
|
|
mutual
|
|
def h (c : Nat) (x : Nat) := match g c x c c with
|
|
| 0 => 1
|
|
| r => r + 2
|
|
termination_by 0
|
|
decreasing_by all_goals sorry
|
|
|
|
def g (c : Nat) (t : Nat) (a b : Nat) : Nat := match t with
|
|
| (n+1) => match g c n a b with
|
|
| 0 => 0
|
|
| m => match g c (n - m) a b with
|
|
| 0 => 0
|
|
| m + 1 => g c m a b
|
|
| 0 => f c 0
|
|
termination_by 0
|
|
decreasing_by all_goals sorry
|
|
|
|
def f (c : Nat) (x : Nat) := match h c x with
|
|
| 0 => 1
|
|
| r => f c r
|
|
termination_by 0
|
|
decreasing_by all_goals sorry
|
|
end
|
|
|
|
attribute [simp] g
|
|
attribute [simp] h
|
|
attribute [simp] f
|
|
|
|
#check g.eq_1
|
|
#check g.eq_2
|
|
|
|
#check h.eq_1
|
|
|
|
#check f.eq_1
|
|
|
|
end Ex1
|
|
|
|
namespace Ex2
|
|
|
|
def g (t : Nat) : Nat := match t with
|
|
| (n+1) => match g n with
|
|
| 0 => 0
|
|
| m + 1 => match g (n - m) with
|
|
| 0 => 0
|
|
| m + 1 => g n
|
|
| 0 => 0
|
|
decreasing_by all_goals sorry
|
|
|
|
theorem ex1 : g 0 = 0 := by
|
|
rw [g]
|
|
|
|
#check g.eq_1
|
|
#check g.eq_2
|
|
|
|
theorem ex2 : g 0 = 0 := by
|
|
unfold g
|
|
simp
|
|
|
|
#check g.eq_def
|
|
|
|
|
|
end Ex2
|