Show that the diagram: $$\require{AMScd} \begin{CD} A @>f>> Y \\ @ViVV @VVV \\ X @>>> X \amalg_f Y \end{CD}$$ where $i : A \hookrightarrow X$ is an inclusion is a pushout in $\mathbf{Top}$.
I can prove that $g_1 : Y \rightarrow X \coprod_fY$, and $g_2 : X \rightarrow X\coprod_f Y$ is a solution of the graph, but I'm going in circles trying to show that any additional solution $(D, h_1, h_2)$ must have a unique morphism $\phi : X\coprod_f Y \rightarrow D$ that makes the diagram commute.
$X \coprod_f Y = (X \coprod Y) / \sim$, where $\sim$ is the equivalence relation generated by $\{(a,f(a)) \in (X \coprod Y) \times (X \coprod Y): a \in A, \text{ where $A$ is a closed subset of $X$} \}$
Anyone have any ideas?
\coprod
(search “coproduct latex”). $\endgroup$ – Idéophage Aug 3 '17 at 15:57