\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{t9\_bintree1 (TMFuGzfKbSe9C5HFu18LqDrCz5XYFw7tHDT)}
\maketitle
Let $ v1\_relat\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v1\_funct\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v3\_trees\_2 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v2\_bintree1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ k6\_trees\_4 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}}$ be given.
Let $ v1\_xboole\_0 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v1\_trees\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v1\_bintree1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ k13\_trees\_3 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Let $ k9\_xtuple\_0 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  ((\preoh v1\_xboole\_0~X0){\unicdcdcdhd}(v1\_trees\_1~X0)){\unicdbdjdcd}({\unicdcdadad} X1 .  \\
((\preoh v1\_xboole\_0~X1){\unicdcdcdhd}(v1\_trees\_1~X1)){\unicdbdjdcd}(((v1\_bintree1~X0){\unicdcdcdhd}(v1\_bintree1~\\
X1)){\unicdbdjded}(v1\_bintree1~(k13\_trees\_3~X0~X1))))\end{array}
\label{hyp:ehidpfcgjgogehchfgfgbd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  ((v1\_relat\_1~X1){\unicdcdcdhd}((v1\_funct\_1~X1){\unicdcdcdhd}(v3\_trees\_2~\\
X1))){\unicdbdjdcd}({\unicdcdadad} X2 .  ((v1\_relat\_1~X2){\unicdcdcdhd}((v1\_funct\_1~X2){\unicdcdcdhd}(v3\_trees\_2~\\
X2))){\unicdbdjdcd}(k9\_xtuple\_0~(k6\_trees\_4~X0~X1~X2)=k13\_trees\_3~(k9\_xtuple\_0~\\
X1)~(k9\_xtuple\_0~X2)))\end{array}
\label{hyp:ehbdedpfehchfgfgdhpfed}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  ((v1\_relat\_1~X0){\unicdcdcdhd}((v1\_funct\_1~X0){\unicdcdcdhd}(v3\_trees\_2~X0))){\unicdbdjdcd}\\
((\preoh v1\_xboole\_0~(k9\_xtuple\_0~X0)){\unicdcdcdhd}(v1\_trees\_1~(k9\_xtuple\_0~X0)))\end{array}
\label{hyp:ggdgcdpfehchfgfgdhpfcd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  {\unicdcdadad} X2 .  (((v1\_relat\_1~X1){\unicdcdcdhd}((v1\_funct\_1~\\
X1){\unicdcdcdhd}(v3\_trees\_2~X1))){\unicdcdcdhd}((v1\_relat\_1~X2){\unicdcdcdhd}((v1\_funct\_1~X2){\unicdcdcdhd}(v3\_trees\_2~\\
X2)))){\unicdbdjdcd}((v1\_relat\_1~(k6\_trees\_4~X0~X1~X2)){\unicdcdcdhd}((v1\_funct\_1~(k6\_trees\_4~\\
X0~X1~X2)){\unicdcdcdhd}(v3\_trees\_2~(k6\_trees\_4~X0~X1~X2))))\end{array}
\label{hyp:egehpflggdpfehchfgfgdhpfed}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  ((v1\_relat\_1~X0){\unicdcdcdhd}((v1\_funct\_1~X0){\unicdcdcdhd}(v3\_trees\_2~X0))){\unicdbdjdcd}\\
((v2\_bintree1~X0){\unicdbdjded}(v1\_bintree1~(k9\_xtuple\_0~X0)))\end{array}
\label{hyp:egddpfcgjgogehchfgfgbd}
\end{equation}
\begin{theorem}\label{thm:ehjdpfcgjgogehchfgfgbd}
$$\begin{array}{c}{\unicdcdadad} X0 .  ((v1\_relat\_1~X0){\unicdcdcdhd}((v1\_funct\_1~X0){\unicdcdcdhd}(v3\_trees\_2~X0))){\unicdbdjdcd}\\
({\unicdcdadad} X1 .  ((v1\_relat\_1~X1){\unicdcdcdhd}((v1\_funct\_1~X1){\unicdcdcdhd}(v3\_trees\_2~X1))){\unicdbdjdcd}\\
({\unicdcdadad} X2 .  ((v2\_bintree1~X0){\unicdcdcdhd}(v2\_bintree1~X1)){\unicdbdjded}(v2\_bintree1~\\
(k6\_trees\_4~X2~X0~X1))))\end{array}$$
\end{theorem}
\end{document}
