\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{t73\_trees\_3 (TMbPVeyEQDqjuNZPRPjhDkSccAaTYproWJK)}
\maketitle
Let $ v1\_xboole\_0 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v1\_trees\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ k13\_trees\_3 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Let $ v1\_relat\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v1\_funct\_1 : {{\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 $ k12\_finseq\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Let $ k5\_numbers : {\iota}$ be given.
Let $ np\_\_1 : {\iota}$ be given.
Let $ k6\_numbers : {\iota}$ be given.
Let $ m2\_finseq\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ m1\_finseq\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ m1\_subset\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k1\_zfmisc\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k2\_zfmisc\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{\unicdcdadad} X1 .  {{\preoh{{({{X0} \in {X1}})}}}{\unicdcdcdhd}{({{v1\_xboole\_0}~{X1}})}}}}\label{hyp:ehhdpfcgpgpgmgfg}
\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 .  \\
((\preoh v1\_xboole\_0~X1){\unicdcdcdhd}(v1\_trees\_1~X1)){\unicdbdjdcd}({\unicdcdadad} X2 .  ((v1\_relat\_1~\\
X2){\unicdcdcdhd}((v1\_funct\_1~X2){\unicdcdcdhd}(v1\_finseq\_1~X2))){\unicdbdjdcd}((X2 \in X1){\unicdbdjded}(k7\_finseq\_1~\\
(k12\_finseq\_1~k5\_numbers~np\_\_1)~X2 \in k13\_trees\_3~X0~X1))))\end{array}
\label{hyp:ehhdadpfehchfgfgdhpfdd}
\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 .  \\
((\preoh v1\_xboole\_0~X1){\unicdcdcdhd}(v1\_trees\_1~X1)){\unicdbdjdcd}({\unicdcdadad} X2 .  ((v1\_relat\_1~\\
X2){\unicdcdcdhd}((v1\_funct\_1~X2){\unicdcdcdhd}(v1\_finseq\_1~X2))){\unicdbdjdcd}((X2 \in X0){\unicdbdjded}(k7\_finseq\_1~\\
(k12\_finseq\_1~k5\_numbers~k6\_numbers)~X2 \in k13\_trees\_3~X0~X1))))\end{array}
\label{hyp:ehgdjdpfehchfgfgdhpfdd}
\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 .  (m2\_finseq\_1~X1~X0){\unicdbdjdcd}((v1\_funct\_1~X1){\unicdcdcdhd}(\\
(v1\_finseq\_1~X1){\unicdcdcdhd}(m1\_subset\_1~X1~(k1\_zfmisc\_1~(k2\_zfmisc\_1~k5\_numbers~\\
X0)))))\end{array}
\label{hyp:egehpfngcdpfggjgogdhfgbhpfbd}
\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}
\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}((X0=X1){\unicdbdjded}({\unicdcdadad} X2 .  (\\
m2\_finseq\_1~X2~k5\_numbers){\unicdbdjdcd}((X2 \in X0){\unicdbdjded}(X2 \in X1)))))\end{array}
\label{hyp:egbdpfehchfgfgdhpfcd}
\end{equation}
\begin{theorem}\label{thm:ehhdddpfehchfgfgdhpfdd}
$$\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}({\unicdcdadad} X2 .  ((\preoh v1\_xboole\_0~\\
X2){\unicdcdcdhd}(v1\_trees\_1~X2)){\unicdbdjdcd}({\unicdcdadad} X3 .  ((\preoh v1\_xboole\_0~X3){\unicdcdcdhd}(v1\_trees\_1~\\
X3)){\unicdbdjdcd}((k13\_trees\_3~X0~X1=k13\_trees\_3~X2~X3){\unicdbdjdcd}((X0=X2){\unicdcdcdhd}(X1=X3))))))\end{array}$$
\end{theorem}
\end{document}
