proposition: Lemma ByteString_dequeue_ByteStringToBoundedByteString_eq : forall (b' : Core.ByteString), ByteString_dequeue (ByteStringToBoundedByteString b') = Ifopt (Core.ByteString_dequeue b') as bbs Then Some (fst bbs, ByteStringToBoundedByteString (snd bbs)) Else None.
proof: Proof. intros; rewrite (Core.ByteString_into_queue_eq b'). rewrite ByteStringToBoundedByteString_into_queue_eq. rewrite ByteString_dequeue_into_BitString. rewrite Core.ByteString_dequeue_into_BitString. destruct (Core.ByteString_into_queue b'); simpl; rewrite <- ?ByteStringToBoundedByteString_into_queue_eq; 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 Fiat.Narcissus.BinLib.Core Fiat.Narcissus.Formats.ByteBuffer