\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{t21\_trees\_2 (TMSqEoGrHfPXQPGRr1tNpGbzvXC4ZM8oR9U)}
\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 $ m1\_trees\_2 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k1\_trees\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ r1\_tarski : {{\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 $ m2\_finseq\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k5\_numbers : {\iota}$ be given.
Let $ r2\_xboole\_0 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ r3\_xboole\_0 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  {\unicdcdadad} X2 .  ((X0 \in X1){\unicdcdcdhd}(m1\_subset\_1~X1~(k1\_zfmisc\_1~\\
X2))){\unicdbdjdcd}(m1\_subset\_1~X0~X2)\end{array}
\label{hyp:ehedpfdhfhcgdhfgeh}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  (m1\_subset\_1~X0~X1){\unicdbdjdcd}((v1\_xboole\_0~X1){\unicdcdcdid}\\
(X0 \in X1))\end{array}
\label{hyp:ehcdpfdhfhcgdhfgeh}
\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}
\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))){\unicdbdjdcd}((X0 \in k1\_trees\_1~X1){\unicdbdjded}(r2\_xboole\_0~X0~X1)))\end{array}
\label{hyp:ehbdcdpfehchfgfgdhpfbd}
\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 .  {\unicdcdadad} X1 .  (r3\_xboole\_0~X0~X1){\unicdbdjded}((r1\_tarski~X0~X1){\unicdcdcdid}\\
(r1\_tarski~X1~X0))\end{array}
\label{hyp:egjdpfihcgpgpgmgfgpfad}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  (r2\_xboole\_0~X0~X1){\unicdbdjded}((r1\_tarski~X0~X1){\unicdcdcdhd}\\
(X0{\unicdcdgdad}X1))\end{array}
\label{hyp:egidpfihcgpgpgmgfgpfad}
\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\_subset\_1~X1~(k1\_zfmisc\_1~X0)){\unicdbdjdcd}((m1\_trees\_2~X1~X0){\unicdbdjded}({\unicdcdadad} X2 .  \\
(m2\_finseq\_1~X2~k5\_numbers){\unicdbdjdcd}({\unicdcdadad} X3 .  (m2\_finseq\_1~X3~k5\_numbers){\unicdbdjdcd}\\
(((X2 \in X1){\unicdcdcdhd}(X3 \in X1)){\unicdbdjdcd}(r3\_xboole\_0~X2~X3))))))\end{array}
\label{hyp:egddpfehchfgfgdhpfcd}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{\unicdcdadad} X1 .  {{({{X0}={X1}})}{\unicdbdjded}{({{({{{r1\_tarski}~{X0}}~{X1}})}{\unicdcdcdhd}{({{{r1\_tarski}~{X1}}~{X0}})}})}}}}\label{hyp:egbdadpfihcgpgpgmgfgpfad}
\end{equation}
\begin{theorem}\label{thm:ehcdbdpfehchfgfgdhpfcd}
$$\begin{array}{c}{\unicdcdadad} X0 .  ((\preoh v1\_xboole\_0~X0){\unicdcdcdhd}(v1\_trees\_1~X0)){\unicdbdjdcd}({\unicdcdadad} X1 .  \\
((v1\_relat\_1~X1){\unicdcdcdhd}((v1\_funct\_1~X1){\unicdcdcdhd}(v1\_finseq\_1~X1))){\unicdbdjdcd}({\unicdcdadad} X2 .  \\
((v1\_relat\_1~X2){\unicdcdcdhd}((v1\_funct\_1~X2){\unicdcdcdhd}(v1\_finseq\_1~X2))){\unicdbdjdcd}({\unicdcdadad} X3 .  \\
(m1\_trees\_2~X3~X0){\unicdbdjdcd}(\preoh (X1 \in X3){\unicdcdcdhd}((X2 \in X3){\unicdcdcdhd}((\preoh X1 \in k1\_trees\_1~X2){\unicdcdcdhd}\\
(\preoh r1\_tarski~X2~X1)))))))\end{array}$$
\end{theorem}
\end{document}
