Let and be sets. If there are injections and , then there is a bijection .
The Schröder-Bernstein theorem is useful for proving many results about cardinality, since it replaces one hard problem (finding a bijection between and ) with two generally easier problems (finding two injections).