proposition: Lemma app_cons_assoc {A} : forall a (l l' : list A), l ++ (a :: l') = (l ++ [a]) ++ l'.
proof: Proof. intros; rewrite <- app_assoc; reflexivity. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Bedrock.Word Coq.ZArith.ZArith Coq.NArith.NArith Coq.Arith.Arith Coq.Numbers.Natural.Peano.NPeano Coq.Logic.Eqdep_dec Fiat.Narcissus.Common.Specs