Polynomial maps from the same complex vector space to itself have this property according to the Ax–Grothendieck theorem. A proof technique named for this property was used by Heinz Prüfer to prove Cayley’s formula, which counts the number of spanning trees of a complete graph. One of these functions exist between the rationals and the integers, meaning that they are both (*) countably infinite, and have the same cardinality. (10[1])A homomorphism with this property is an isomorphism. Functions with this property of a set to itself are also permutations. Functions that are both injective and surjective also have this property. Inverse exists for functions with, for 10 points, what property of a function, in which one element of the domain is paired with exactly one element of the codomain. ■END■