Some clausal form transformation algorithms used in SAT solving cannot be used in MaxSAT solving because they preserve satisfiability but do not preserve the minimum number of unsatisfied formulas. In this paper we define three different MaxSAT clausal form transformations, inspired on the transformations applied in SAT, that derive a multiset of clauses ψ from a multiset of arbitrary propositional formulas φ in such a way that the minimum number of unsatisfied clauses in ψ is equal to the minimum number of unsatisfied formulas in φ.