lean2/tests/lean/run/eq18.lean

import data.examples.vector
open nat vector

definition last {A : Type} : Π {n}, vector A (succ n) → A
| last (a :: nil) := a
| last (a :: v)   := last v

theorem last_cons_nil {A : Type} {n : nat} (a : A) : last (a :: nil) = a :=
rfl

theorem last_cons {A : Type} {n : nat} (a : A) (v : vector A (succ n)) : last (a :: v) = last v :=
rfl
refactor(library/data): move vector as indexed family to examples folder 2015-08-12 15:05:14 -07:00			`import data.examples.vector`
test(tests/lean/run) define vector last and unzip functions using recursive equations 2015-01-05 16:52:30 -08:00			`open nat vector`

feat(frontends/lean): ML-like notation for match and recursive equations 2015-02-25 16:20:44 -08:00			`definition last {A : Type} : Π {n}, vector A (succ n) → A`
			`\| last (a :: nil) := a`
			`\| last (a :: v) := last v`
test(tests/lean/run) define vector last and unzip functions using recursive equations 2015-01-05 16:52:30 -08:00
			`theorem last_cons_nil {A : Type} {n : nat} (a : A) : last (a :: nil) = a :=`
			`rfl`

			`theorem last_cons {A : Type} {n : nat} (a : A) (v : vector A (succ n)) : last (a :: v) = last v :=`
			`rfl`