proposition: Lemma queue_into_ByteString_inj : forall l1 l2, queue_into_ByteString l1 = queue_into_ByteString l2 -> l1 = l2.
proof: Proof. intros. apply queue_into_ByteString_inj. rewrite !BoundedByteStringToByteString_into_queue_eq. rewrite H; 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 Fiat.Narcissus.BinLib.Core Fiat.Narcissus.Formats.ByteBuffer Coq.Strings.String Coq.Vectors.Vector Fiat.Narcissus.Formats.WordOpt Fiat.Common.Equality