I won't try to give a specific explanation here because I think that depends highly on the level of knowledge of the student. Rather, I'd like to emphasize some general points that I think are helpful for teachers to keep in mind when explaining and motivating these and related matters about the extension of "number systems" (here the extension from positive to negative integers).
First, it is often helpful to look at the history of how these concepts evolved. For example, we need to have available negative integers, rationals, and (imaginary) quadratic surds in order to give a single (uniform) formula for the solution of a quadratic equation (prior ancient solutions of the quadratic bifurcated into motley cases because they had to avoid working with not yet understood negative or "imaginary" or "irrational" numbers).
Yet, once we have such numbers available, the solution of the quadratic is childs-play, using simple algebra by completing the square. Deserving explicit emphasis about such algebra is that the arithmetical laws used (commutative, associative and distributive laws) hold true for all the types of numbers involved (i.e. they are all commutative rings). Because of the persistence of these laws, even though we may make detours through fractions, "irrational" and "imaginary" numbers, any results we deduce about "natural" integers still hold true. This is one of the primary reasons that we desire to preserve these laws when we make extensions to our number systems. It allows us to give "universal" proofs that work in any of these rings. Further, problems may simplify when passing to extension rings, e.g. nonlinear problems may reduce to linear problems in algebraic extension rings.
In the old days (pre-axiomatic method) the constraint to preserve the laws of arithmetic when we extend our number systems was sometimes called the Permanence Principle, attributed to Hankel or Peacock. Nowadays, with the axiomatic method available, we simply express it in that language, e.g we desire rational, quadratic and complex numbers to be commutative ring extensions of the ring of integers.
This notion of the great utility of the preservation of arithmetical laws can be explained at an elementary level. Doing so yields motivated explanations that are a bit more faithful to the underlying mathematics (and its history) than do alternative "real world" answers to questions like the OP.
For example, below I copy one way I explain the Law of Signs, emphasizing the crucial role played by the distributive law. With a little effort one could simplify the exposition to make it much more elementary, yet still be faithful to the "law preservation" viewpoint.
Law of Signs proof: $\rm\,\ (-x)(-y) = (-x)(-y) + x(\overbrace{-y + y}^{\large =\,0}) = (\overbrace{-x+x}^{\large =\,0})(-y) + xy = xy$
Equivalently, evaluate $\rm\:\overline{(-x)(-y) +} \overline{ \underline {x(-y)}} \underline{ +\,xy}\, $ in 2 ways, noting each over/under term $ = 0$
Said more conceptually, $\rm\:(-x)(-y)\ $ and $\rm\:xy\:$ are both inverses of $\rm\ x(-y)\ $ so they are equal by uniqueness of inverses: if $\,a\,$ has two additive inverses $\,\color{#c00}{-a}\,$ and $\,\color{#0a0}{-a},\,$ then
$$\color{#c00}{-a}\, =\, \color{#c00}{-a}+\overbrace{(a+\color{#0a0}{-a})}^{\large =\,0}\, =\, \overbrace{(\color{#c00}{-a}+a)}^{\large =\,0}+\color{#0a0}{-a}\, =\, \color{#0a0}{-a} $$
This proof of the Law of Signs uses well-known laws of positive integers (esp. the distributive law), so if we require that these laws persist in the larger system of positive and negative integers, then the Law of Signs is a logical consequence of these basic laws of positive integers.
These fundamental laws of "numbers" are axiomatized by the algebraic structure known as a ring, and various specializations thereof. Since the above proof uses only ring laws (most notably the distributive law), the Law of Signs holds true in every ring, e.g. rings of polynomials, power series, matrices, differential operators, etc. In fact every nontrivial ring theorem (i.e. one that does not degenerate to a theorem about the underlying additive group or multiplicative monoid), must employ the distributive law, since that is the only law that connects the additive and multiplicative structures that combine to form the ring structure. Without the distributive law a ring degenerates to a set with two completely unrelated additive and multiplicative structures. So, in a sense, the distributive law is a keystone of the ring structure.