proposition: Lemma seq_S (start len : nat) : seq (S start) len = map S (seq start len).
proof: Proof. revert start; induction len; [ reflexivity | ]. simpl in *; intros. rewrite IHlen; 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