proposition: Lemma allp_left': forall {B A: Type} {NA: NatDed A} (x: B) (P Q: B -> A), P |-- Q -> allp P |-- Q x.
proof: Proof. intros. apply (allp_left _ x). apply H. Qed.
imports: VST.msl.Extensionality VST.msl.simple_CCC VST.msl.seplog VST.msl.log_normalize Coq.Lists.List CertiGraph.msl_ext.seplog CertiGraph.msl_ext.abs_addr