b5122b6a7b
This change * moves `termination_by` and `decreasing_by` next to the function they apply to * simplify the syntax of `termination_by` * apply the `decreasing_by` goal to all goals at once, for better interactive use. See the section in `RELEASES.md` for more details and migration advise. This is a hard breaking change, requiring developers to touch every `termination_by` in their code base. We decided to still do it as a hard-breaking change, because supporting both old and new syntax at the same time would be non-trivial, and not save that much. Moreover, this requires changes to some metaprograms that developers might have written, and supporting both syntaxes at the same time would make _their_ migration harder.
31 lines
1,008 B
Text
31 lines
1,008 B
Text
@[eliminator] protected def Nat.recDiag {motive : Nat → Nat → Sort u}
|
|
(zero_zero : motive 0 0)
|
|
(succ_zero : (x : Nat) → motive x 0 → motive (x + 1) 0)
|
|
(zero_succ : (y : Nat) → motive 0 y → motive 0 (y + 1))
|
|
(succ_succ : (x y : Nat) → motive x y → motive (x + 1) (y + 1))
|
|
(x y : Nat) : motive x y :=
|
|
let rec go : (x y : Nat) → motive x y
|
|
| 0, 0 => zero_zero
|
|
| x+1, 0 => succ_zero x (go x 0)
|
|
| 0, y+1 => zero_succ y (go 0 y)
|
|
| x+1, y+1 => succ_succ x y (go x y)
|
|
termination_by x y => (x, y)
|
|
go x y
|
|
|
|
def f (x y : Nat) :=
|
|
match x, y with
|
|
| 0, 0 => 1
|
|
| x+1, 0 => f x 0
|
|
| 0, y+1 => f 0 y
|
|
| x+1, y+1 => f x y
|
|
termination_by (x, y)
|
|
|
|
example (x y : Nat) : f x y > 0 := by
|
|
induction x, y with
|
|
| zero_zero => decide
|
|
| succ_zero x ih => simp [f, ih]
|
|
| zero_succ y ih => simp [f, ih]
|
|
| succ_succ x y ih => simp [f, ih]
|
|
|
|
example (x y : Nat) : f x y > 0 := by
|
|
induction x, y <;> simp (config := { decide := true }) [f, *]
|