\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{t15\_trees\_9 (TMKzvFnMU6xb6QM1668wY9iH5hS5C7vDz1c)}
\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 $ k4\_tarski : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Let $ k1\_xboole\_0 : {\iota}$ be given.
Let $ k6\_trees\_9 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ v1\_xboole\_0 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v1\_trees\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ k6\_finseq\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k5\_numbers : {\iota}$ be given.
Let $ k5\_trees\_2 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Let $ m1\_subset\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ m1\_trees\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k9\_xtuple\_0 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k6\_numbers : {\iota}$ be given.
Let $ k2\_tarski : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Let $ k1\_tarski : {{\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 .  ((\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}
\begin{array}{c}{\unicdcdadad} X0 .  ((v1\_relat\_1~X0){\unicdcdcdhd}((v1\_funct\_1~X0){\unicdcdcdhd}(v3\_trees\_2~X0))){\unicdbdjdcd}\\
(k5\_trees\_2~X0~(k6\_finseq\_1~k5\_numbers)=X0)\end{array}
\label{hyp:ehbdpfehchfgfgdhpfjd}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{\unicdcdadad} X1 .  {{({{X0} \in {X1}})}{\unicdbdjdcd}{({{{m1\_subset\_1}~{X0}}~{X1}})}}}}\label{hyp:ehbdpfdhfhcgdhfgeh}
\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}((X0 \in k6\_trees\_9~X1){\unicdbdjded}({\unicdcdaddd} X2 .  (m1\_trees\_1~X2~(k9\_xtuple\_0~\\
X1)){\unicdcdcdhd}(X0=k4\_tarski~X2~(k5\_trees\_2~X1~X2))))\end{array}
\label{hyp:ehbdedpfehchfgfgdhpfjd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  ((\preoh v1\_xboole\_0~X0){\unicdcdcdhd}(v1\_trees\_1~X0)){\unicdbdjdcd}({\unicdcdadad} X1 .  \\
(m1\_trees\_1~X1~X0){\unicdbdjded}(m1\_subset\_1~X1~X0))\end{array}
\label{hyp:chfgegfgggjgogjgehjgpgogpfngbdpfehchfgfgdhpfbd}
\end{equation}
Assume the following.
\begin{equation}
{{k6\_numbers}={k1\_xboole\_0}}\label{hyp:chfgegfgggjgogjgehjgpgogpflggdpfogfhngcgfgchdh}
\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){\unicdbdjdcd}((v3\_trees\_2~X0){\unicdbdjded}((\preoh v1\_xboole\_0~\\
(k9\_xtuple\_0~X0)){\unicdcdcdhd}(v1\_trees\_1~(k9\_xtuple\_0~X0))))\end{array}
\label{hyp:egidpfehchfgfgdhpfcd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  k4\_tarski~X0~X1=k2\_tarski~(k2\_tarski~X0~\\
X1)~(k1\_tarski~X0)\end{array}
\label{hyp:egfdpfehbgchdhlgjg}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{\unicdcdadad} X1 .  {{{{k2\_tarski}~{X0}}~{X1}}={{{k2\_tarski}~{X1}}~{X0}}}}}\label{hyp:dgpgngngfhehbgehjgghjgehjhpflgcdpfehbgchdhlgjg}
\end{equation}
\begin{theorem}\label{thm:ehbdfdpfehchfgfgdhpfjd}
$$\begin{array}{c}{\unicdcdadad} X0 .  ((v1\_relat\_1~X0){\unicdcdcdhd}((v1\_funct\_1~X0){\unicdcdcdhd}(v3\_trees\_2~X0))){\unicdbdjdcd}\\
(k4\_tarski~k1\_xboole\_0~X0 \in k6\_trees\_9~X0)\end{array}$$
\end{theorem}
\end{document}
