proposition: Lemma wordToN_wzero' {sz} : forall w: word sz, wordToN w = 0%N -> w = wzero _.
proof: Proof. intros. apply (f_equal (@NToWord sz)) in H. rewrite NToWord_wordToN, NToWord_zero in H. assumption. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat List Bedrock.Word Coq.ZArith.ZArith Coq.micromega.Psatz NArith NArithRing ZArith ZArithRing Program Coq.micromega.Psatz AlignedByteString Permutation