proposition: Lemma wminus_WS_pos': forall sz (w1 w2: word (sz + 1)), wordToZ (WS true w1 ^- WS false w2) = (2 * wordToZ (w1 ^- w2) + 1)%Z.
proof: Proof. intro sz. replace (sz + 1) with (S sz) by lia. intros. apply wminus_WS_pos. 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