proposition: Lemma not_In_app: forall A x (L1 L2 : list A), ~ In x (L1 ++ L2) -> ~ In x L1 /\ ~ In x L2.
proof: Proof. split; intro; apply H; apply in_or_app; 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