proposition: Lemma ByteString_measure_dequeue_Some : forall (b' : ByteString) (t : bool) (b : ByteString), ByteString_dequeue b = Some (t, b') -> bin_measure b = bin_measure b' + 1.
proof: Proof. intros ? ? ?; rewrite (ByteString_into_queue_eq b), ByteString_dequeue_into_BitString. destruct (ByteString_into_queue b); intros; try discriminate; injections. simpl. rewrite !length_ByteString_queue_into_ByteString; simpl; omega. 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