proposition: Lemma filter_map_comm': forall A f g (L : list A), (forall x, f x = f (g x)) -> filter f (map g L) = map g (filter f L).
proof: Proof. intros. rewrite filter_map_comm with (f := f); 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