proposition: Lemma seq_alt (start len : nat) : seq start len = match len with | 0 => nil | S len' => start :: map S (seq start len') end.
proof: Proof. destruct len; simpl. { reflexivity. } { apply f_equal2. { reflexivity. } { rewrite seq_S. 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