\documentclass{article}
\newtheorem{axiom}{Axiom}
\newtheorem{theorem}{Theorem}
\newtheorem{lemma}{Lemma}
\newtheorem{proposition}{Proposition}
\newtheorem{definition}{Definition}
\newtheorem{example}{Example}
\newtheorem{conjecture}{Conjecture}
\newcommand\unicdcdgdad{\not=}
\newcommand\unicdcdcdbg{\cup}
\newcommand\unicdcdbdgd{\setminus}
\newcommand\unicdcdcdjd{\cap}
\newcommand\unicdcdadad{\forall}
\newcommand\unicdbdjdcd{\Rightarrow}
\newcommand\unicdcdadjd{\notin}
\newcommand\unicdbdjded{\Leftrightarrow}
\newcommand\unicdcdcdid{\lor}
\newcommand\unicdcdcdhd{\land}
\newcommand\uniddcgcg{\lambda}
\newcommand\unicdcdaddd{\exists}
\newcommand\unicdcdidid{\not\subseteq}
\newcommand\preoh[1]{\lnot #1}
\newcommand\mname[1]{{\mathsf{#1}}}
\begin{document}
\title{t26\_rewrite1 (TMaEZEUumfhShtN24jpMcRnbCfQ1TvZMKds)}
\maketitle
Let $ v1\_relat\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ r2\_rewrite1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}}$ be given.
Let $ r1\_rewrite1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}}$ be given.
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  (v1\_relat\_1~X0){\unicdbdjdcd}({\unicdcdadad} X1 .  {\unicdcdadad} X2 .  (r1\_rewrite1~\\
X0~X1~X2){\unicdbdjdcd}((r2\_rewrite1~X0~X1~X2){\unicdcdcdhd}(r2\_rewrite1~X0~X2~X1)))\end{array}
\label{hyp:ehcdfdpfchfghhchjgehfgbd}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{({{v1\_relat\_1}~{X0}})}{\unicdbdjdcd}{({{\unicdcdadad} X1 .  {{{{r1\_rewrite1}~{X0}}~{X1}}~{X1}}})}}}\label{hyp:ehbdcdpfchfghhchjgehfgbd}
\end{equation}
\begin{theorem}\label{thm:ehcdgdpfchfghhchjgehfgbd}
${{\unicdcdadad} X0 .  {{({{v1\_relat\_1}~{X0}})}{\unicdbdjdcd}{({{\unicdcdadad} X1 .  {{{{r2\_rewrite1}~{X0}}~{X1}}~{X1}}})}}}$.
\end{theorem}
\end{document}
