\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{t49\_trees\_9 (TMQB9tV7nNWEX9tUiJ7Vix1wYXbgvoW621C)}
\maketitle
Let $ v1\_xboole\_0 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v1\_trees\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v1\_trees\_9 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v1\_finset\_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 $ r1\_tarski : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  ((\preoh v1\_xboole\_0~X0){\unicdcdcdhd}((v1\_trees\_1~X0){\unicdcdcdhd}(v1\_trees\_9~\\
X0))){\unicdbdjdcd}(\preoh (\preoh v1\_finset\_1~X0){\unicdcdcdhd}({\unicdcdadad} X1 .  (m1\_trees\_2~X1~X0){\unicdbdjdcd}(v1\_finset\_1~\\
X1)))\end{array}
\label{hyp:ehedidpfehchfgfgdhpfjd}
\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}({\unicdcdaddd} X2 .  ((v2\_trees\_2~X2~X0){\unicdcdcdhd}(m1\_trees\_2~\\
X2~X0)){\unicdcdcdhd}(r1\_tarski~X1~X2)))\end{array}
\label{hyp:ehcdidpfehchfgfgdhpfcd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  ((r1\_tarski~X0~X1){\unicdcdcdhd}(v1\_finset\_1~X1)){\unicdbdjdcd}(\\
v1\_finset\_1~X0)\end{array}
\label{hyp:ehbdpfggjgogdhfgehpfbd}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{({\preoh{{{v1\_finset\_1}~{X0}}}})}{\unicdbdjdcd}{({\preoh{{{v1\_xboole\_0}~{X0}}}})}}}\label{hyp:dgdgbdpfdgbgchegpffd}
\end{equation}
\begin{theorem}\label{thm:ehedjdpfehchfgfgdhpfjd}
$$\begin{array}{c}{\unicdcdadad} X0 .  ((\preoh v1\_xboole\_0~X0){\unicdcdcdhd}((v1\_trees\_1~X0){\unicdcdcdhd}(v1\_trees\_9~\\
X0))){\unicdbdjdcd}(\preoh (\preoh v1\_finset\_1~X0){\unicdcdcdhd}({\unicdcdadad} X1 .  ((v2\_trees\_2~X1~X0){\unicdcdcdhd}(\\
m1\_trees\_2~X1~X0)){\unicdbdjdcd}(v1\_finset\_1~X1)))\end{array}$$
\end{theorem}
\end{document}
