(* QuickChick Prelude *)
Set Warnings "-extraction-opaque-accessed,-extraction".
Set Warnings "-notation-overridden,-parsing".
Set Bullet Behavior "Strict Subproofs".
(* End prelude *)
Require Export Lists.
Inductive list (X:Type) : Type :=
| nil : list X
| cons : X -> list X -> list X.
Instance dec_list' {A} (p q : list A)
(D : forall (x y : A), Dec (x = y)) : Dec (p = q).

(* Specifications: *)
Theorem app_assoc : forall A (l m n:list A),
l ++ m ++ n = (l ++ m) ++ n.