Vernacstate.LemmaStackval pop : t -> Declare.Proof.t * t optionval push : t option -> Declare.Proof.t -> tval map : f:( Declare.Proof.t -> Declare.Proof.t ) -> t -> tval map_top : f:( Declare.Proof.t -> Declare.Proof.t ) -> t -> tval with_top : t -> f:( Declare.Proof.t -> 'a ) -> 'aval get_top : t -> Declare.Proof.tval get_all_proof_names : t -> Names.Id.t list