proposition: Lemma ByteString_measure_pop_Some : forall (b' : ByteString) (t : bool) (b : ByteString), ByteString_pop b = Some (t, b') -> bin_measure b = bin_measure b' + 1.
proof: Proof. destruct b. unfold ByteString_pop; simpl. destruct padding0. - destruct byteString0. + intros; discriminate. + intros; injections. unfold length_ByteString; simpl. omega. - intros; injections. unfold length_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