proposition: Lemma fold_right_id {A} : forall seq, @List.fold_right (list A) A (fun elem acc => elem :: acc) [] seq = seq.
proof: Proof. induction seq; simpl; try rewrite IHseq; congruence. 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