proposition: Lemma ByteString_f_equal : forall bs bs' (p_eq : padding bs' = padding bs) (numBytes_eq : numBytes bs' = numBytes bs), front bs = eq_rect (padding bs') (fun t : nat => word t) (front bs') (padding bs) p_eq -> byteString bs = eq_rect (numBytes bs') _ (byteString bs') (numBytes bs) numBytes_eq -> bs = bs'.
proof: Proof. destruct bs; destruct bs'; simpl; intros. subst. f_equal. apply le_uniqueness_proof. 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 Fiat.Narcissus.BinLib.Core Fiat.Narcissus.Formats.ByteBuffer