The following result is relevant here: If $f_n : \mathbb{R} \to \mathbb{R} $ is a sequence of continuously differentiable functions, uniformly convergent to $f$ and the sequence $f'_n$ converges uniformly to $g$, then $f$ is differentiable and $f'=g.$
So we can check that $F$ and $G$ are smooth by checking that we can keep on differentiating them, which we do by applying the above theorem, the Weierstrass M-test and the fact that Schwarz functions decay very quickly.
Both the Euler-Maclaurin formula and Poisson summation are basic examples of deeper ideas. But at their core, the underlying ideas are very different.
The Euler-Maclaurin formula can be thought of as coming from repeated integration by parts, regarding the initial sum as a Rieman-Stieltjes integral
$$ \sum f(n) = \int_a^b f(t) d \lfloor t \rfloor, $$
where the constant terms in the antiderivatives appearing in the integrations by parts are chosen to minimize some cross error. This turns out to be the same view as estimating the expected error in an iterated composite trapezoidal rule for estimating an integral.
At its core, Euler-Maclaurin concerns estimating the difference between the discrete and continuous sums of a nice function $f(t)$. To that end, there exist generalizations to higher dimensions, and in particular to functions on polytopes. See this MO question for more on this connection, but the theme remains that one estimates a discretized sum (which is often quite hard to understand, but easier to actually compute) with an integral (which is often much easier to understand properties of, but can be hard to actually compute).
Many examples from elementary and analytic number theory of successes of Euler-Maclaurin formulas arise from computing high accuracy estimates of discrete sums of extremely well-behaved functions, such as computing
$$ \sum \log n, \quad \sum \frac{1}{x}.$$
In these cases, the smoothness properties of the function $f$ are more easily viewed from the integral.
Conversely, Euler-Maclaurin formulas are used to give high accuracy estimates of integrals in standard numerical analysis methods, as discrete sums with understandable error terms are actually computable and estimable. Note that when approximating an integral $\int_1^b f(x) dx$, the error comes in the form of high derivatives of $f$, so this still leverages smoothness properties of $f$, but in a different way.
Poisson summation is very different in nature. Poisson summation concerns Fourier series, or perhaps stated more fundamentally, the Fourier transform. The underlying big picture concerns the structure of $\mathbb{R}$ and $\mathbb{Z}$, and how $\mathbb{Z}$ behaves inside $\mathbb{R}$ as a discrete subgroup.
One can study Poisson summation for $\mathbb{Z}^n$ sitting within $\mathbb{R}^n$, or more general group quotients. Carrying this to one extreme leads to the Selberg Trace Formula (and in fact, one can directly view regular Poisson summation as a "trivial" trace formula. This point of view is apparent in the introductory chapter of Bump's Automorphic Forms and Representations, as a way of motivating eventual progress towards discussion trace formulas). From this point of view, it is clear that Poisson summation is fundamentally a consequence of representation-theoretic information.
Although over $\mathbb{R}/\mathbb{Z}$, this looks superficially similar to the integrals in Euler-Maclaurin summation, I would say that the underlying ideas are substantively different.
Best Answer
Question 1: Define the function $f$ by $$ f(x) := \sum_{m\in\mathbb{Z}} \phi(x+m). $$ Observe that $$ f(x+1) = \sum_{m\in\mathbb{Z}} \phi((x+1)+m) = \sum_{m\in\mathbb{Z}} \phi( x + (m+1) ) = \sum_{m'\in\mathbb{Z}} \phi(x+m') = f(x), $$ where $m' = m+1$. Thus $f$ is a $1$-periodic function. Since $f$ is a $1$-periodic function, we may compute its $n$-th Fourier coefficient using the usual integration, i.e. $$ \hat{f}(n) = \int_{0}^{1} f(x) \mathrm{e}^{-2\pi inx}\,\mathrm{d}x= \int_{0}^{1} f(x) \mathrm{e}^{-2\pi inx}\,\mathrm{d}x = \int_{0}^{1} \sum_{m\in\mathbb{Z}} \phi(x+m) \mathrm{e}^{-2\pi inx}\,\mathrm{d}x, $$ which answers your first question.
Question 2: This is a fairly straight-forward change of variables. Let $y = x+m$. Then (using the usual shorthand) $\mathrm{d}y = \mathrm{d}x$, which gives us \begin{align} \sum_{m\in\mathbb{Z}} \int_{0}^{1} \phi(x+m) \mathrm{e}^{-2\pi inx} \,\mathrm{d}x &= \sum_{m\in\mathbb{Z}} \int_{m}^{m+1} \phi(y) \mathrm{e}^{-2\pi in(y-m)} \,\mathrm{d}y && (\text{change of variables}) \\ &= \sum_{m\in\mathbb{Z}} \int_{m}^{m+1} \phi(y)\, \mathrm{e}^{-2\pi iny}\mathrm{e}^{2\pi inm}\, \mathrm{d}y \\ &= \sum_{m\in\mathbb{Z}} \int_{m}^{m+1} \phi(y) \mathrm{e}^{-2\pi iny}\, \mathrm{d}y. && (\text{since $\mathrm{e}^{2\pi ik} = 1 \forall k\in\mathbb{Z}$}) \end{align} This seems to answer your second question.