lean4-htt/tests/lean/unfold1.lean
Leonardo de Moura 9ee529e5ce fix: use PSum instead of Sum when using well-founded recursion
See new test for example that did not work with `Sum` because type
alpha was `Sort u`.
2022-02-17 16:14:34 -08:00

27 lines
678 B
Text

mutual
def isEven : Nat → Bool
| 0 => true
| n+1 => isOdd n
def isOdd : Nat → Bool
| 0 => false
| n+1 => isEven n
end
termination_by' measure fun | PSum.inl n => n | PSum.inr n => n
decreasing_by apply Nat.lt_succ_self
theorem isEven_double (x : Nat) : isEven (2 * x) = true := by
induction x with
| zero => simp
| succ x ih =>
unfold isEven
trace_state
rw [Nat.mul_succ, Nat.add_succ]
simp
unfold isOdd
trace_state
rw [Nat.add_succ]
simp
exact ih
theorem isEven_succ_succ (x : Nat) : isEven (x + 2) = isEven x := by
conv => lhs; unfold isEven; rw [Nat.add_succ]; simp; unfold isOdd; rw [Nat.add_succ]; simp