21 lines
412 B
Text
21 lines
412 B
Text
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
|
|
termination_by' sorry
|
|
decreasing_by sorry
|
|
|
|
attribute [simp] g
|
|
|
|
#check g._eq_1
|
|
#check g._eq_2
|
|
|
|
theorem ex3 : g (n + 1) = match g n with
|
|
| 0 => 0
|
|
| m + 1 => match g (n - m) with
|
|
| 0 => 0
|
|
| m + 1 => g n := by
|
|
conv => lhs; unfold g
|