proposition: Lemma cleanup_aligned_encoder_init {cache S2}: forall (sz : nat) (v : t Core.char sz) idx (r : S2) ch, forall (f: @AlignedEncodeM cache _ sz) (g: @AlignedEncodeM cache S2 sz) (h: forall sz, @AlignedEncodeM cache _ sz) (h': @AlignedEncodeM cache S2 sz), (h' = h sz) -> (AppendAlignedEncodeM f g) v idx r ch = h' v idx r ch -> (AppendAlignedEncodeM f g) v idx r ch = h sz v idx r ch.
proof: Proof. intros; congruence. Qed.
imports: Coq.ZArith.ZArith Coq.Strings.String Coq.Vectors.Vector Fiat.Computation Fiat.Narcissus.Common.Specs Fiat.Narcissus.Common.WordFacts Fiat.Narcissus.Common.ComposeIf Fiat.Narcissus.Common.ComposeOpt Fiat.Narcissus.Automation.Solver Fiat.Narcissus.Automation.AlignedAutomation Fiat.Narcissus.BinLib Fiat.Narcissus.Formats Fiat.Narcissus.Stores.EmptyStore Fiat.Narcissus.BaseFormats Fiat.Common.EnumType Fiat.Narcissus.Formats.EnumOpt