Spivak's definition doesn't actually break for functions like yours, like the accepted answer says, due to the logical subtlety (annoyance?) of vacuous truths, which comes from the definition (truth table) of the logical operator (or logical connective, I never know the difference) of logical implication.
Namely, in zeroth-order logic ("propositional logic"), an implication logical statement of the form
$$A \implies B$$
is false iff $A$ is true and $B$ is false; in particular, it is true if the hypothesis $A$ is false, regardless of the truth value of $B$.
In first-order logic ("predicate logic"), an implication logical statement of the form
$$\forall x \left< A(x) \implies B(x) \right>$$
(where $A(x)$ is a logical formula whose truth value depends on the value of the variable $x$, and likewise for $B(x)$) is false iff, for all $x$, $A(x)$ is true and $B(x)$ is false; in particular, it is true if, for all $x$, the hypothesis $A(x)$ is false, regardless of the truth value of $B(x)$. (For nested quantifiers like $\forall\exists\forall$ in the limit definition, the truth value "bubbles up" from the innermost levels to the outermost levels, I think).
In the case of Spivak's limits and your function, the implication logical statement
$$\forall x \in \text{Dom}(f) \left< 0 < |x - a | < \delta \implies |f(x) - f(a)| < \epsilon \right>$$
is true because, for all $x \in \text{Dom}(f)$, the hypothesis $0 < |x - a| < \delta$ is false (because $\text{Dom}(f)$ has single element, namely $1$, and the statement $0 < |1 - 1| < \delta$ is false regardless of the value of $\delta$).
Now imma handwave and say that the entire formula (which is a formula in 2 variables, namely the function $f$ and the number $a$)
$$\forall \epsilon > 0\ \ \exists \delta >0\ \ \forall x \in \text{Dom}(f) \left< 0 < |x - a | < \delta \implies |f(x) - f(a)| < \epsilon \right>$$
is true when you set $f$ to your function and $a$ to be $1 \in \text{Dom}(f)$.
So, by the Spivak definition of limit, the limit of $f$ at $1$ is $1$.
And, by the definition of $f$, $f$ maps 1 to 1.
So, by the Spivak definition of continuity, $f$ is continuous at $1$.
(Disclaimer: I'm not sure of anything I just said.)
(The real complication is not the "annoyance" of the implication logical operator, but the fact that people use it in the first place, and for virtually every statement in math. Why not use the and operator, or the iff operator, instead? I suppose there's a reason, but I don't know what it is. Notice that the implication logical operator is related to the geometry/topology of subsets, while the and logical operator and the iff logical operator are related to the geometry/topology of intersections. (Look at the Venn diagrams.))