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