proposition: Lemma wand_wone : forall sz (w : word sz) b, WS b w ^& wone _ = WS b (wzero _).
proof: Proof. intros. compute [wone natToWord wand]. simpl. fold natToWord. change (natToWord sz 0) with (wzero sz). rewrite andb_true_r. rewrite wand_comm, wand_wzero. reflexivity. Qed.
imports: Coq.Classes.Morphisms Coq.Classes.Morphisms_Prop Coq.Classes.Equivalence Coq.Arith.PeanoNat Coq.ZArith.BinInt  Coq.Arith.Arith Coq.NArith.NArith Coq.Bool.Bool Coq.ZArith.ZArith Coq.Logic.Eqdep_dec Coq.Logic.EqdepFacts Coq.Program.Tactics Coq.Program.Equality Coq.setoid_ring.Ring Coq.setoid_ring.Ring_polynom bbv.Nomega bbv.ZLib bbv.NatLib bbv.NLib bbv.N_Z_nat_conversions bbv.DepEq bbv.DepEqNat bbv.ReservedNotations Coq.micromega.Lia