lean4-htt/old_tests/tests/lean/run/eq6.lean
2018-04-10 12:56:55 -07:00

14 lines
380 B
Text

open list
definition appd {A : Type} : list A → list A → list A
| nil l := l
| (h :: t) l := h :: (appd t l)
theorem appd_nil {A : Type} (l : list A) : appd nil l = l :=
rfl
theorem appd_cons {A : Type} (h : A) (t l : list A) : appd (h :: t) l = h :: (appd t l) :=
rfl
example : appd ((1:nat) :: 2 :: nil) (3 :: 4 :: 5 :: nil) = (1 :: 2 :: 3 :: 4 :: 5 :: nil) :=
rfl