proposition: Lemma NoDup_sub_permutation: forall A (l1 l2 : list A), sub_permutation l1 l2 -> NoDup l2 -> NoDup l1.
proof: Proof. intros A l1 l2 [l2' [? ?]] ?. eapply NoDup_Subsequence; eauto. symmetry in H. eapply Permutation_NoDup; eauto. 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