proposition: Lemma wmsb_combine: forall sz1 sz2 (w1: word sz1) (w2: word sz2) b1 b2, sz2 <> 0 -> wmsb (combine w1 w2) b1 = wmsb w2 b2.
proof: Proof. dependent induction w1; cbn; intros. - auto using wmsb_default. - auto using IHw1. 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