proposition: Lemma wnot_inj {sz} : forall w1 w2: word sz, wnot w1 = wnot w2 -> w1 = w2.
proof: Proof. intros w1 w2 H. apply (f_equal (@wnot _)) in H. rewrite !wnot_involutive in H; assumption. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat List Bedrock.Word Coq.ZArith.ZArith Coq.micromega.Psatz NArith NArithRing