proposition: Lemma in_map_rev A B (f : A -> B) x ls : List.In x (List.map f (List.rev ls)) <-> List.In x (List.map f ls).
proof: Proof. rewrite map_rev, <- in_rev; reflexivity. 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