I am looking at the proof of the following proposition.
Here $A$ is a closed linear operator on $L$, that is, the graph of $A$ is closed subspace of $L \times L$. And $\lambda$ is said to belong to the resolvent set $\rho(A)$ of $A$, if $\lambda - A(\equiv \lambda I-A)$ is one-to-one, Range($\lambda - A)=L$, and $(\lambda - A)^{-1}$ is a bounded linear operator on $L$.
In the proof, as shown below, (2.6) shows that $\lambda-A$ is one-to-one on $\mathcal{D}(A)$, which is a dense subset of the vector space $L$ by a theorem preceding this. However, I don't see how this fact directly means that $\lambda - A$ is one-to-one on $L$. If a closed linear operator is one to one on a dense set, then is it one to one on the whole set? I would greatly appreciate any explanation on this line of the proof.


You have
$$D(\lambda - A)=\{x\in L:\lambda x - Ax \in L\} = \{x\in L : Ax\in L\}=D(A)$$
because $\lambda x - Ax$ lies in $L$ iff $Ax$ lies in $L$.
So you only need it to be injective on $D(A)$. $U_{\lambda}$ takes care of both its surjectivity and injectivity.
Finally, once that's done it is autumatically invertible. This is applies to slightly more general case:
Clearly if it is invertible then it is bijective onto $X$. So the converse is interesting one;
Let $G(A)$ denote its graph, and suppose that $A$ is bijective onto $X$. Then its algebraic inverse exists, call it $B$. Then the map $(x,y)\mapsto (y,x)$ from $G(A)$ bijective onto $G(B)$ is a homeomorhpism, so $G(A)$ closed implies $G(B)$ is closed. Now as $X$ is complete, and $B$ is a bijection from $X$ onto $D(A)$, by closed graph theorem $B$ is bounded. So $A$ is invertible