We prove some important properties of the p-resolvent mapping recently introduced by B. J. Choi and U. C. Ji, The proximal point algorithm in uniformly convex metric spaces, Commun. Korean Math. Soc. 31 2016, 4, 845–855, in p-uniformly convex metric space. Furthermore, we introduce a modified Mann-type PPA involving nonexpansive mapping and prove that the sequence generated by the algorithm converges to a common solution of a finite family of minimization problems, which is also a fixed point of a nonexpansive mapping in the framework of a complete p-uniformly convex metric space.