proposition: Lemma fold_left_cons {A B} : forall (f : B -> A -> B) (l : list A) (b : B) (a : A), fold_left f l (f b a) = fold_left f (a :: l) b.
proof: Proof. 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 Fiat.Narcissus.BinLib.Core Fiat.Narcissus.Formats.ByteBuffer