proposition: Lemma move_wplus_pow2 sz (w1 w2: word (S sz)): w1 = w2 ^+ $(pow2 sz) <-> w1 ^+ $(pow2 sz) = w2.
proof: Proof. split. + intro. apply move_wplus_wminus. rewrite wminus_def. rewrite pow2_wneg. assumption. + intro. apply move_wplus_wminus in H. rewrite <- pow2_wneg. assumption. 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