Addition and multiplication are commutative. Denoting $\circ$ as either such operation, we have $$x \circ y = z \Leftrightarrow y \circ x = z.$$ Subtraction and division have a similar property, where $$x \circ y = z \Leftrightarrow x \circ z = y.$$ Is there a name for this latter property?
I would like to teach my child, who has learned about commutativity and who has observed the second property casually. Giving the property a name would make it more explicit.
This is "left involution". ("left" because it doesn't work when you try it on the right.) \begin{align*} x \circ y &= z & \\ x \circ (x\circ y) &= x \circ z & [\text{apply $x \circ -$}] \\ y &= x \circ z & [\text{simplify the involution}] \text{.} \end{align*}
I would be shocked to see anyone use that term outside of some very narrow niches. In ring theory, an involution is an antiisomorphism, which brings us around to the anticommutativity mentioned in comments and other answers.
I have never seen a name for this property specifically. When I was in grade school, I recall learning about Fact Families, which are generated by this property. The idea is that a fact family is all of the arithmetic equations generated by the same numbers.
This property in particular is really just a consequence that subtraction is the inverse of addition which is commutative. You can see this (using algebra, so probably not appropriate for a young child) by adding y to both sides. You then have your commutativity example above. This is not anti-commutativity as one comment said, although subtraction is anti-commutative.
As there is not a common name for this property (other than a reference to fact families), I agree with the suggestion @Ben Crowell to let your child give it a name.
A helpful way to rewrite that statement would be (assuming subtraction for simplicity):
$x - y - z ⇔ x - z - y$
We are observing how swapping y and z does not change the value of the expression. While it may initially look like there is a useful property behind this, the example is showing an easy case of what you are allowed to swap. Here is a visual representation of what swaps are allowed.
These are expression trees. The filled in circles can be swapped with other circles that are filled in with the same color. The first tree shows the original case of $x - y - z$ and shows how $y$ and $z$ can be swapped. The next tree represents $(a - b) - (c - d)$. The third tree is another full binary tree, but with twice as many variables and represents $((a - b) - (c - d)) - ((e - f) - (g - h))$. You can normalize the first tree into the second by replacing $z$ in the original expression with $z - 0$.
If you just look at the first tree it may seem like you should be able to swap children on the right side, but once you start looking at the other trees, you should notice that the pattern is no longer quite as simple. One way to describe the pattern would be that a node's right child is able to swap with that node's other child's right child. This may be more restrictive than you initially expected when comparing this property to commutativity.
I do not know a name for this property, but it is not as useful as commutativity due to the number of restrictions on being able to swap nodes. If you run into this you may want to try and find a different approach that can use commutativity such as converting subtraction into addition of negative number, or by trying to make as many nodes of the tree swapable by for example not allowing parenthesis to be used.
I don't know if this word is used specifically to describe this phenomenon, but the term "complement" is used in general to refer to two things that combine to make some third thing, so this applies here. When we subtract $b$ from $a$, we're basically asking what $b$'s (additive) complement with respect to $a$ is.
Another term that could be considered to apply is "conjugate".
