We prove that the definition of supersimplicity in metric structures from [Ben Yaacov, Uncountable dense categoricity in cats] is equivalent to an textit{a priori} stronger variant. This stronger variant is then used to prove that if $T$ is a supersimple Hausdorff cat then so is its theory of lovely pairs.