This comes from the textbook: Edward A. Scheinerman - Mathematics: A Discrete Introduction-Cengage Learning (2012)
I understand everything in the proof except for why Dr. Scheinerman defined the set $B$ as he did. Informally, he says that B is a set that $f$ "misses", i.e. there is no $a \in A $ such that $f(a) = B$. How does the formal definition of $B$ he gives capture this idea?
The definition of $B$ is
$B = \{x \in A: x \notin f(x) \}$, which I read as: "$B$ is the set of all elements $x$ in $A$ that are not in the subsets they map to under $f$". Is that an accurate reading? If so, how does that definition encapsulate all the sets that $f$ "misses"?
