Minimum of a list of natural numbers

Our next example is an algorithm to find the minimum of a non-empty list of natural numbers, with a proof of correctness. The proof of correctness consists of two statements about the algorithm: (1) the minimum is in the list, and (2) the minimum is less than or equal to each element in the list.

To avoid name collisions we will use the name smallest

def smallest (l : List ℕ) : l ≠ [] → ℕ

The smallest element in a non-empty list of natural numbers

Equations

• smallest (head :: tail) x_1 = if c : tail = [] then head else Nat.min head (smallest tail c)

An example

#eval smallest [7, 8, 1,2,3,4,5] (by decide)

theorem smallest_in_list (l : List ℕ) (hyp : l ≠ []) : smallest l hyp ∈ l

the result of smallest applied to a list is a member of that list

def egNat : ℕ

An example of using left and right tactics.

Equations

• egNat = Nat.succ Nat.zero

theorem smallest_le (l : List ℕ) (hyp : l ≠ []) (m : ℕ) : m ∈ l → smallest l hyp ≤ m

smallest is less than or equal to each element in the list