\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{t69\_trees\_3 (TMda5LfWMjNg7U33Dg8WBqAMKDixM62M6NS)}
\maketitle
Let $ v1\_xboole\_0 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v1\_trees\_1 : {{\iota}{\unicdbdjdcd}{o}}$ 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 $ k6\_numbers : {\iota}$ be given.
Let $ k13\_trees\_3 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Let $ k1\_xboole\_0 : {\iota}$ be given.
Let $ v4\_trees\_3 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ k3\_finseq\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k11\_trees\_3 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k9\_finseq\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k5\_finseq\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k1\_card\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ m1\_finseq\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ v4\_relat\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ v5\_relat\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ v1\_finset\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v1\_trees\_3 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v2\_trees\_3 : {{\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.
Let $ v1\_card\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ k10\_finseq\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Let $ v5\_trees\_3 : {{\iota}{\unicdbdjdcd}{o}}$ 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}\\
({\unicdcdadad} X1 .  ((v1\_relat\_1~X1){\unicdcdcdhd}((v1\_funct\_1~X1){\unicdcdcdhd}((v1\_finseq\_1~\\
X1){\unicdcdcdhd}(v4\_trees\_3~X1)))){\unicdbdjdcd}({\unicdcdadad} X2 .  ((v1\_relat\_1~X2){\unicdcdcdhd}((v1\_funct\_1~\\
X2){\unicdcdcdhd}((v1\_finseq\_1~X2){\unicdcdcdhd}(v4\_trees\_3~X2)))){\unicdbdjdcd}({\unicdcdadad} X3 .  ((\preoh v1\_xboole\_0~\\
X3){\unicdcdcdhd}(v1\_trees\_1~X3)){\unicdbdjdcd}((X0 \in X3){\unicdbdjded}(k7\_finseq\_1~(k12\_finseq\_1~k5\_numbers~\\
(k3\_finseq\_1~X1))~X0 \in k11\_trees\_3~(k7\_finseq\_1~(k7\_finseq\_1~X1~\\
(k9\_finseq\_1~X3))~X2))))))\end{array}
\label{hyp:ehfdbdpfehchfgfgdhpfdd}
\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}
{{\unicdcdadad} X0 .  {{{k9\_finseq\_1}~{X0}}={{k5\_finseq\_1}~{X0}}}}\label{hyp:chfgegfgggjgogjgehjgpgogpflgjdpfggjgogdhfgbhpfbd}
\end{equation}
Assume the following.
\begin{equation}
{{k6\_numbers}={k1\_xboole\_0}}\label{hyp:chfgegfgggjgogjgehjgpgogpflggdpfogfhngcgfgchdh}
\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}\\
(k3\_finseq\_1~X0=k1\_card\_1~X0)\end{array}
\label{hyp:chfgegfgggjgogjgehjgpgogpflgddpfggjgogdhfgbhpfbd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdaddd} X1 .  (m1\_finseq\_1~X1~X0){\unicdcdcdhd}((v1\_relat\_1~X1){\unicdcdcdhd}(\\
(v4\_relat\_1~X1~k5\_numbers){\unicdcdcdhd}((v5\_relat\_1~X1~X0){\unicdcdcdhd}((v1\_funct\_1~\\
X1){\unicdcdcdhd}((v1\_xboole\_0~X1){\unicdcdcdhd}((v1\_finset\_1~X1){\unicdcdcdhd}(v1\_finseq\_1~X1)))))))\end{array}
\label{hyp:chdgcdpfggjgogdhfgbhpfbd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdaddd} X0 .  (\preoh v1\_xboole\_0~X0){\unicdcdcdhd}((v1\_finset\_1~X0){\unicdcdcdhd}((v1\_trees\_3~\\
X0){\unicdcdcdhd}(v2\_trees\_3~X0)))\end{array}
\label{hyp:chdgbdpfehchfgfgdhpfdd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  {\unicdcdaddd} X2 .  (m1\_subset\_1~X2~(k1\_zfmisc\_1~\\
(k2\_zfmisc\_1~X0~X1))){\unicdcdcdhd}((v1\_xboole\_0~X2){\unicdcdcdhd}((v1\_relat\_1~X2){\unicdcdcdhd}((\\
v4\_relat\_1~X2~X0){\unicdcdcdhd}(v5\_relat\_1~X2~X1))))\end{array}
\label{hyp:chdgbdpfchfgmgdhfgehpfbd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  ((\preoh v1\_xboole\_0~X0){\unicdcdcdhd}(v1\_trees\_1~X0)){\unicdbdjdcd}((\preoh v1\_xboole\_0~\\
(k5\_finseq\_1~X0)){\unicdcdcdhd}(v4\_trees\_3~(k5\_finseq\_1~X0)))\end{array}
\label{hyp:ggdgjdpfehchfgfgdhpfdd}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{v1\_finseq\_1}~{({{k5\_finseq\_1}~{X0}})}}}\label{hyp:ggdghdpfggjgogdhfgbhpfbd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  (v1\_xboole\_0~X0){\unicdbdjdcd}((v1\_xboole\_0~(k1\_card\_1~X0)){\unicdcdcdhd}(\\
v1\_card\_1~(k1\_card\_1~X0)))\end{array}
\label{hyp:ggdgbdpfdgbgchegpfbd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  (v1\_relat\_1~(k9\_finseq\_1~X0)){\unicdcdcdhd}(v1\_funct\_1~(k9\_finseq\_1~\\
X0))\end{array}
\label{hyp:egehpflgjdpfggjgogdhfgbhpfbd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  k10\_finseq\_1~X0~X1=k7\_finseq\_1~(k9\_finseq\_1~\\
X0)~(k9\_finseq\_1~X1)\end{array}
\label{hyp:egjdpfggjgogdhfgbhpfbd}
\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}(k13\_trees\_3~X0~X1=k11\_trees\_3~\\
(k10\_finseq\_1~X0~X1)))\end{array}
\label{hyp:egbdhdpfehchfgfgdhpfdd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  ((\preoh v1\_xboole\_0~X0){\unicdcdcdhd}(v2\_trees\_3~X0)){\unicdbdjdcd}({\unicdcdadad} X1 .  \\
(m1\_finseq\_1~X1~X0){\unicdbdjdcd}(v5\_trees\_3~X1))\end{array}
\label{hyp:dgdgbdgdpfehchfgfgdhpfdd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  ((v1\_relat\_1~X0){\unicdcdcdhd}((v1\_funct\_1~X0){\unicdcdcdhd}(v5\_trees\_3~X0))){\unicdbdjdcd}\\
((v1\_relat\_1~X0){\unicdcdcdhd}((v1\_funct\_1~X0){\unicdcdcdhd}(v4\_trees\_3~X0)))\end{array}
\label{hyp:dgdgbdedpfehchfgfgdhpfdd}
\end{equation}
\begin{theorem}\label{thm:ehgdjdpfehchfgfgdhpfdd}
$$\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}$$
\end{theorem}
\end{document}
