Sorry. Here is my next attempt:
"Suppose function f maps values of type J to values of type K, and suppose g is a function that maps values of type K to values of type J. suppose further that f and g are inverses. That is, suppose that, for all j\inJ and k\inK, (f.j=k) \equiv (j=g.k)
\langle...
Hi
I am doing a course on Program verification and am having trouble with the properties of summation, more specifically the rule of translation:
"Suppose function f maps values of type J to values of type K, and suppose g is a function that maps values of type K to values of type J. suppose...