I've used Axler's book in the past as textbook in linear algebra courses I've taught, and I'm familiar with its content. The book is essentially self-contained, so yes, your background should be enough in terms of prerequisites and pace.
More important is certain "mathematical maturity", as the book is fairly theoretical rather than computationally oriented, and you need to be comfortable with proofs. Whether the book will prepare you for later courses is hard to say exactly. You probably want to complement it with another text where there is more emphasis on computational aspects of matrix theory.
In particular, topics that numerical analysts consider fundamental, such as the singular value decomposition of a matrix, or the $QR$ (Francis) algorithm for computing eigenvalues are not really treated by Axler. The key contribution of the book is the development of the basic theory without needing to appeal to the determinant. I believe this is important to actually understand the content of some of the key results. That said, the determinant is an important tool in computations, and this is something Axler does not treat in appropriate depth.
If you are interested in applications of linear algebra beyond the real or complex settings, applications where now the underlying field may be finite, you will need a different book, since Axler does not mention these topics. A sugestion here is Linear Algebra Methods in Combinatorics. With Applications to Geometry and Computer Science, by László Babai, and Péter Frankl. The book was never published, but preliminary notes are available from the Department of Computer Science at the University of Chicago, or elsewhere on the internet.
One last comment: In some of the (future) courses you have mentioned, the linear algebra one encounters takes place on infinite dimensional spaces, where the theory also requires ideas of topology and continuity. The appropriate setting for these topics is a course on functional analysis.
Best Answer
Here are some fun ideas that you might want to explore with your students superficially, without getting bogged down in details:
realising the complex numbers and quaternions through real matrices
solving linear recurrences by means of eigenvalues
on a related note, the look-and-say sequence http://www.nathanieljohnston.com/2010/10/a-derivation-of-conways-degree-71-look-and-say-polynomial/
numerical linear algebra, i.e. algorithms https://people.sc.fsu.edu/~jburkardt/classes/nla_2015/numerical_linear_algebra.pdf
linear algebra in combinatorics https://people.cs.uchicago.edu/~laci/CLASS/HANDOUTS-COMB/BaFrNew.pdf
Jacobians in multivariable calculus
the resultant of pairs of polynomials
$\\$
In undergraduate maths programs, linear algebra leads naturally to modules over rings, representation theory and functional analysis.