proposition: Lemma whd_word_1_refl' : forall (b : word 1), decides true (WS (whd b) WO = b).
proof: Proof. intros; destruct (shatter_word_S b) as [? [? ?] ]; subst. rewrite (shatter_word_0 x0); reflexivity. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.Bool.Bool Coq.ZArith.ZArith Coq.Lists.List Fiat.Common.DecideableEnsembles Fiat.Common.EnumType Fiat.Common.BoundedLookup Fiat.Common Fiat.Common.ilist Fiat.Common.Tactics.CacheStringConstant Fiat.Common.IterateBoundedIndex Fiat.Computation Bedrock.Word