let f:X->Y be an arbitrary mapping with B as a subset of Y. Then the properties of the inverse of f "are satisfyingly complete, and can be stated as follows: [g = inverse of f] g(empty set) = empty set; g(Y)=X; B1 a subset of B2 implies g(B1) subset g(B2); g(union Bi) = union (g (Bi)); g(intersection Bi) = intersection (g (Bi)); g( complement B) = complement (g(B)).