proposition: Lemma empty_padding_ByteString_eq_byteString : forall b paddingOK', padding b = 0 -> b = {| padding := 0; front := WO; paddingOK := paddingOK'; byteString := byteString b |}.
proof: Proof. destruct b; intros; simpl in *; subst. shatter_word front0. simpl; repeat f_equal. apply 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