proposition: Lemma Subsequence_In: forall A (l1 l2 : list A), Subsequence l1 l2 -> forall x, In x l1 -> In x l2.
proof: Proof. induction 1; simpl; auto. contradiction. destruct 1; auto. Qed.
imports: RelationClasses VST.floyd.proofauto CertiGraph.lib.List_ext CertiGraph.binheap.binary_heap_pro CertiGraph.binheap.binary_heap_malloc_spec CertiGraph.binheap.binary_heap_model CertiGraph.binheap.binary_heap_Zmodel