(* * Maximum element in a list *)
From Undecidability Require Export TM.Util.Prelim TM.Util.ArithPrelim.
(* ** Basic lemmas about upper bounds *)
(* ** Tail Recursive Definition *)
(* Compute the maximum of a list and a start-value tail-recursively *)
Fixpoint max_list_rec (s : nat) (xs : list nat) { struct xs } : nat :=
match xs with
| nil => s
| x :: xs' => max_list_rec (max x s) xs'
end.

(* We can remove the tail-recursion *)
Lemma max_list_rec_max (xs : list nat) (s1 s2 : nat) :
max_list_rec (max s1 s2) xs = max (max_list_rec s1 xs) (max_list_rec s2 xs).