proposition: Lemma wtl_eq_rect : forall n w Heq Heq', wtl (eq_rect (S n) word w (S (n + 0)) Heq) = eq_rect n word (wtl w) (n + 0) Heq'.
proof: Proof. intros. generalize dependent Heq. rewrite <- Heq'; simpl; intros. rewrite <- (eq_rect_eq_dec eq_nat_dec). 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