Expanding recursive case of function in equational reasoning

Question

Context: I am proving some properties about a Haskell quicksort implementation. The following code is all that is required to define a nondeterministic permute