\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{t26\_trees\_2 (TMK7SGHRq2xggSVbjtx4CyPaD2nALV8xfZK)}
\maketitle
Let $ v1\_xboole\_0 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v1\_trees\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v2\_trees\_2 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ m1\_trees\_2 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k1\_xboole\_0 : {\iota}$ be given.
Let $ m1\_subset\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k1\_zfmisc\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ r1\_tarski : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ m2\_finseq\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k5\_numbers : {\iota}$ be given.
Let $ k1\_tarski : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k1\_trees\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ r2\_xboole\_0 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ 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 .  {\unicdcdadad} X1 .  (m1\_subset\_1~X0~(k1\_zfmisc\_1~X1)){\unicdbdjded}(r1\_tarski~\\
X0~X1)\end{array}
\label{hyp:ehddpfdhfhcgdhfgeh}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{{r1\_tarski}~{k1\_xboole\_0}}~{X0}}}\label{hyp:ehcdpfihcgpgpgmgfgpfbd}
\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 .  \\
(m2\_finseq\_1~X1~k5\_numbers){\unicdbdjdcd}({\unicdcdadad} X2 .  (m2\_finseq\_1~X2~k5\_numbers){\unicdbdjdcd}\\
({\unicdcdadad} X3 .  ((v2\_trees\_2~X3~X0){\unicdcdcdhd}(m1\_trees\_2~X3~X0)){\unicdbdjdcd}(((r1\_tarski~\\
X1~X2){\unicdcdcdhd}(X2 \in X3)){\unicdbdjdcd}(X1 \in X3)))))\end{array}
\label{hyp:ehcdfdpfehchfgfgdhpfcd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  ((\preoh v1\_xboole\_0~X0){\unicdcdcdhd}(v1\_trees\_1~X0)){\unicdbdjdcd}(m1\_trees\_2~\\
(k1\_tarski~k1\_xboole\_0)~X0)\end{array}
\label{hyp:ehcdadpfehchfgfgdhpfcd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  ((\preoh v1\_xboole\_0~X1){\unicdcdcdhd}(v1\_trees\_1~X1)){\unicdbdjdcd}(\\
(X0 \in X1){\unicdbdjdcd}(m2\_finseq\_1~X0~k5\_numbers))\end{array}
\label{hyp:ehbdjdpfehchfgfgdhpfbd}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{\unicdcdadad} X1 .  {{({{{r1\_tarski}~{({{k1\_tarski}~{X0}})}}~{X1}})}{\unicdbdjded}{({{X0} \in {X1}})}}}}\label{hyp:mgbdpfkhggngjgdhdgpfbd}
\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\_2~X1~X0){\unicdbdjdcd}(m1\_subset\_1~X1~(k1\_zfmisc\_1~X0)))\end{array}
\label{hyp:egehpfngbdpfehchfgfgdhpfcd}
\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\_2~X1~X0){\unicdbdjdcd}((v2\_trees\_2~X1~X0){\unicdbdjded}(({\unicdcdadad} X2 .  (m2\_finseq\_1~\\
X2~k5\_numbers){\unicdbdjdcd}((X2 \in X1){\unicdbdjdcd}(r1\_tarski~(k1\_trees\_1~X2)~X1))){\unicdcdcdhd}({\unicdcdadad} X2 .  \\
(m2\_finseq\_1~X2~k5\_numbers){\unicdbdjdcd}(\preoh (X2 \in X0){\unicdcdcdhd}({\unicdcdadad} X3 .  (m2\_finseq\_1~\\
X3~k5\_numbers){\unicdbdjdcd}((X3 \in X1){\unicdbdjdcd}(r2\_xboole\_0~X3~X2))))))))\end{array}
\label{hyp:eghdpfehchfgfgdhpfcd}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{({{v1\_xboole\_0}~{X0}})}{\unicdbdjded}{({{\unicdcdadad} X1 .  {\preoh{{{X1} \in {X0}}}}})}}}\label{hyp:egbdpfihcgpgpgmgfgpfad}
\end{equation}
\begin{theorem}\label{thm:ehcdgdpfehchfgfgdhpfcd}
$$\begin{array}{c}{\unicdcdadad} X0 .  ((\preoh v1\_xboole\_0~X0){\unicdcdcdhd}(v1\_trees\_1~X0)){\unicdbdjdcd}({\unicdcdadad} X1 .  \\
((v2\_trees\_2~X1~X0){\unicdcdcdhd}(m1\_trees\_2~X1~X0)){\unicdbdjdcd}(k1\_xboole\_0 \in X1))\end{array}$$
\end{theorem}
\end{document}
