proposition: Lemma app_cons_app_app_cons {A} : forall (a c: list A) b, (a ++ b :: nil) ++ c = a ++ b :: c.
proof: Proof. intros; rewrite <- app_assoc; reflexivity. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Fiat.CertifiedExtraction.Extraction.Extraction Fiat.CertifiedExtraction.Extraction.BinEncoders.Basics Fiat.CertifiedExtraction.Extraction.BinEncoders.Wrappers Fiat.CertifiedExtraction.Extraction.BinEncoders.Properties Coq.Program.Program Coq.Lists.List Bedrock.Platform.Facade.examples.QsADTs