proposition: Lemma outlier_rep_single_rep: forall outlier p, In p outlier -> outlier_rep outlier |-- single_outlier_rep p * TT.
proof: Proof. intros. unfold outlier_rep. apply (in_map single_outlier_rep) in H. apply log_normalize.fold_right_andp in H. destruct H as [Q ?]. rewrite H. apply andp_left1. cancel. Qed.
imports: VST.veric.compcert_rmaps VST.msl.shares VST.msl.wand_frame VST.concurrency.conclib CertiGraph.lib.List_ext CertiGraph.msl_ext.log_normalize CertiGraph.msl_ext.ramification_lemmas CertiGraph.graph.graph_model CertiGraph.CertiGC.GCGraph CertiGraph.CertiGC.env_graph_gc CertiGraph.msl_ext.iter_sepcon Coq.Lists.List