There is a recent exciting line of work in distributed graph algorithms in the $\mathsf{CONGEST}$ model that exploit expanders. All these algorithms so far are based on two tools: expander decomposition and expander routing. An $(ε,φ)$-expander decomposition removes $ε$-fraction of the edges so that the remaining connected components have conductance at least $φ$, i.e., they are $φ$-expanders, and expander routing allows each vertex $v$ in a $φ$-expander to very quickly exchange $\text{deg}(v)$ messages with any other vertices, not just its local neighbors. In this paper, we give the first efficient deterministic distributed algorithms for both tools. We show that an $(ε,φ)$-expander decomposition can be deterministically computed in $\text{poly}(ε^{-1}) n^{o(1)}$ rounds for $φ= \text{poly}(ε) n^{-o(1)}$, and that expander routing can be performed deterministically in $\text{poly}(φ^{-1})n^{o(1)}$ rounds. Both results match previous bounds of randomized algorithms by [Chang and Saranurak, PODC 2019] and [Ghaffari, Kuhn, and Su, PODC 2017] up to subpolynomial factors. Consequently, we derandomize existing distributed algorithms that exploit expanders. We show that a minimum spanning tree on $n^{o(1)}$-expanders can be constructed deterministically in $n^{o(1)}$ rounds, and triangle detection and enumeration on general graphs can be solved deterministically in $O(n^{0.58})$ and $n^{2/3 + o(1)}$ rounds, respectively. We also give the first polylogarithmic-round randomized algorithm for constructing an $(ε,φ)$-expander decomposition in $\text{poly}(ε^{-1}, \log n)$ rounds for $φ= 1 / \text{poly}(ε^{-1}, \log n)$. The previous algorithm by [Chang and Saranurak, PODC 2019] needs $n^{Ω(1)}$ rounds for any $φ\ge 1/\text{poly}\log n$.