proposition: Lemma rev_inj {A} : forall (l l' : list A), rev l = rev l' -> l = l'.
proof: Proof. intros; apply (f_equal (@rev _)) in H; rewrite !rev_involutive in H; eauto. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Bedrock.Word Coq.ZArith.ZArith Coq.NArith.NArith Coq.Arith.Arith Coq.Numbers.Natural.Peano.NPeano Coq.Logic.Eqdep_dec Fiat.Narcissus.Common.Specs