Fixed point results are used in program verification, semantics of programming languages and recursive function theory, where multiple mappings may represent different processes or transformations. We established a common fixed-point theorem in Parametric metric space, utilizing weakly compatible mappings and implicit relations. By moving to Parametric Metric spaces, it covers cases where the distance function is Dynamic, which is not addressed in classical settings. These findings generalizes and enhances the existing common fixed point theorems based on the implicit relation. The use of implicit relations generalizes traditional contractive conditions, encompassing a wider range of possible inequalities and making the theorem applicable to diverse settings.