\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{t35\_trees\_9 (TMYWkmdPH9rYabeHMLibUKS9Z7XhZcaSbXs)}
\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 $ m2\_finseq\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k5\_numbers : {\iota}$ be given.
Let $ k1\_funct\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Let $ k5\_trees\_2 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Let $ k1\_xboole\_0 : {\iota}$ be given.
Let $ v1\_xboole\_0 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v1\_finseq\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ k7\_finseq\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Let $ v1\_trees\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ k6\_finseq\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ m1\_finseq\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k8\_finseq\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}}$ be given.
Let $ k9\_xtuple\_0 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k4\_trees\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{({{v1\_xboole\_0}~{X0}})}{\unicdbdjdcd}{({{X0}={k1\_xboole\_0}})}}}\label{hyp:ehgdpfcgpgpgmgfg}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  ((v1\_relat\_1~X0){\unicdcdcdhd}((v1\_funct\_1~X0){\unicdcdcdhd}(v1\_finseq\_1~X0))){\unicdbdjdcd}\\
((k7\_finseq\_1~X0~k1\_xboole\_0=X0){\unicdcdcdhd}(k7\_finseq\_1~k1\_xboole\_0~X0=\\
X0))\end{array}
\label{hyp:ehddedpfggjgogdhfgbhpfbd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  ((\preoh v1\_xboole\_0~X0){\unicdcdcdhd}(v1\_trees\_1~X0)){\unicdbdjdcd}((k1\_xboole\_0 \in \\
X0){\unicdcdcdhd}(k6\_finseq\_1~k5\_numbers \in X0))\end{array}
\label{hyp:ehcdcdpfehchfgfgdhpfbd}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{\unicdcdadad} X1 .  {{({{{m2\_finseq\_1}~{X1}}~{X0}})}{\unicdbdjded}{({{{m1\_finseq\_1}~{X1}}~{X0}})}}}}\label{hyp:chfgegfgggjgogjgehjgpgogpfngcdpfggjgogdhfgbhpfbd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  {\unicdcdadad} X2 .  ((m1\_finseq\_1~X1~X0){\unicdcdcdhd}(m1\_finseq\_1~\\
X2~X0)){\unicdbdjdcd}(k8\_finseq\_1~X0~X1~X2=k7\_finseq\_1~X1~X2)\end{array}
\label{hyp:chfgegfgggjgogjgehjgpgogpflgidpfggjgogdhfgbhpfbd}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{v1\_xboole\_0}~{({{k6\_finseq\_1}~{X0}})}}}\label{hyp:ggdgfdpfggjgogdhfgbhpfbd}
\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 .  (m1\_finseq\_1~X1~X0){\unicdbdjdcd}((v1\_relat\_1~X1){\unicdcdcdhd}(\\
(v1\_funct\_1~X1){\unicdcdcdhd}(v1\_finseq\_1~X1)))\end{array}
\label{hyp:egehpfngbdpfggjgogdhfgbhpfbd}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{{m2\_finseq\_1}~{({{k6\_finseq\_1}~{X0}})}}~{X0}}}\label{hyp:egehpflggdpfggjgogdhfgbhpfbd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  (((v1\_relat\_1~X0){\unicdcdcdhd}((v1\_funct\_1~X0){\unicdcdcdhd}(v3\_trees\_2~\\
X0))){\unicdcdcdhd}(m1\_finseq\_1~X1~k5\_numbers)){\unicdbdjdcd}((v1\_relat\_1~(k5\_trees\_2~\\
X0~X1)){\unicdcdcdhd}((v1\_funct\_1~(k5\_trees\_2~X0~X1)){\unicdcdcdhd}(v3\_trees\_2~(k5\_trees\_2~\\
X0~X1))))\end{array}
\label{hyp:egehpflgfdpfehchfgfgdhpfcd}
\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}\\
({\unicdcdadad} X1 .  (m2\_finseq\_1~X1~k5\_numbers){\unicdbdjdcd}({\unicdcdadad} X2 .  ((v1\_relat\_1~\\
X2){\unicdcdcdhd}((v1\_funct\_1~X2){\unicdcdcdhd}(v3\_trees\_2~X2))){\unicdbdjdcd}((X2=k5\_trees\_2~X0~X1){\unicdbdjded}\\
((k9\_xtuple\_0~X2=k4\_trees\_1~(k9\_xtuple\_0~X0)~X1){\unicdcdcdhd}({\unicdcdadad} X3 .  \\
(m2\_finseq\_1~X3~k5\_numbers){\unicdbdjdcd}((X3 \in k4\_trees\_1~(k9\_xtuple\_0~X0)~\\
X1){\unicdbdjdcd}(k1\_funct\_1~X2~X3=k1\_funct\_1~X0~(k8\_finseq\_1~k5\_numbers~X1~\\
X3))))))))\end{array}
\label{hyp:egbdadpfehchfgfgdhpfcd}
\end{equation}
\begin{theorem}\label{thm:ehddfdpfehchfgfgdhpfjd}
$$\begin{array}{c}{\unicdcdadad} X0 .  ((v1\_relat\_1~X0){\unicdcdcdhd}((v1\_funct\_1~X0){\unicdcdcdhd}(v3\_trees\_2~X0))){\unicdbdjdcd}\\
({\unicdcdadad} X1 .  (m2\_finseq\_1~X1~k5\_numbers){\unicdbdjdcd}(k1\_funct\_1~X0~X1=k1\_funct\_1~\\
(k5\_trees\_2~X0~X1)~k1\_xboole\_0))\end{array}$$
\end{theorem}
\end{document}
