proposition: Lemma fold_left_id {A} : forall seq, @List.fold_left (list A) A (fun acc elem => elem :: acc) seq [] = rev seq.
proof: Proof. intros. rewrite <- fold_left_rev_right. apply fold_right_id. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.ZArith.ZArith Coq.Lists.List Coq.Lists.SetoidList Coq.Bool.Bool Fiat.Common Fiat.Common.List.Operations Fiat.Common.Equality Fiat.Common.List.FlattenList Fiat.Common.LogicFacts