proposition: Lemma ByteString_f_equal : forall bs bs' (p_eq : padding bs' = padding bs), paddingOK bs = (@eq_rect nat (padding bs') (fun t => lt t 8) (paddingOK bs') _ p_eq) -> front bs = (@eq_rect nat (padding bs') (fun t => word t) (front bs') _ p_eq) -> byteString bs = byteString bs' -> bs = bs'.
proof: Proof. destruct bs; destruct bs'; simpl. intros; subst; reflexivity. 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