proposition: Lemma BitString_into_ByteString_append : forall b b', ByteString_into_BitString (ByteString_append b b') = app (ByteString_into_BitString b) (ByteString_into_BitString b').
proof: Proof. intros. rewrite (ByteString_into_BitString_eq b), (ByteString_into_BitString_eq b'). rewrite ByteString_mappend_BitString_into. rewrite <- !ByteString_into_BitString_eq. rewrite BitString_into_ByteString_eq; 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