Module NatList.
Inductive natprod : Type :=
| pair : nat -> nat -> natprod.
Instance dec_natprod (p q : natprod) : Dec (p = q).
Admitted. (* QuickChick surjective_pairing. *)
Admitted. (* QuickChick snd_fst_is_swap. *)
Admitted. (* QuickChick fst_swap_is_snd. *)
Inductive natlist : Type :=
| nil  : natlist
| cons : nat -> natlist -> natlist.
Instance dec_natlist (p q : natlist) : Dec (p = q).
Admitted. (* QuickChick tl_length_pred. *)
Admitted. (* QuickChick app_assoc. *)
Fixpoint rev (l:natlist) : natlist :=
match l with
| nil    => nil
| h :: t => rev t ++ [h]
end.
(* rev_length_firsttry *)

Theorem app_length : forall l1 l2 : natlist,
length (l1 ++ l2) = (length l1) + (length l2).