\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\_3 (TMHDRrbSRmjamU1c9H6Pc1a6R6ozzEW27Av)}
\maketitle
Let $ v1\_xboole\_0 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ r1\_tarski : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k5\_trees\_3 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k4\_trees\_3 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ m1\_trees\_3 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ v1\_relat\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v5\_relat\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ v1\_funct\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v3\_trees\_2 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  (\preoh v1\_xboole\_0~X0){\unicdbdjdcd}({\unicdcdadad} X1 .  (m1\_trees\_3~X1~X0){\unicdbdjdcd}\\
(\preoh v1\_xboole\_0~X1))\end{array}
\label{hyp:egehpfngbdpfehchfgfgdhpfdd}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{({\preoh{{{v1\_xboole\_0}~{X0}}}})}{\unicdbdjdcd}{({{{m1\_trees\_3}~{({{k5\_trees\_3}~{X0}})}}~{X0}})}}}\label{hyp:egehpflgfdpfehchfgfgdhpfdd}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{({\preoh{{{v1\_xboole\_0}~{X0}}}})}{\unicdbdjdcd}{({{{m1\_trees\_3}~{({{k4\_trees\_3}~{X0}})}}~{X0}})}}}\label{hyp:egehpflgedpfehchfgfgdhpfdd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  (\preoh v1\_xboole\_0~X0){\unicdbdjdcd}({\unicdcdadad} X1 .  (m1\_trees\_3~X1~X0){\unicdbdjdcd}\\
((X1=k4\_trees\_3~X0){\unicdbdjded}({\unicdcdadad} X2 .  ((v1\_relat\_1~X2){\unicdcdcdhd}((v5\_relat\_1~\\
X2~X0){\unicdcdcdhd}((v1\_funct\_1~X2){\unicdcdcdhd}(v3\_trees\_2~X2)))){\unicdbdjdcd}(X2 \in X1))))\end{array}
\label{hyp:eghdpfehchfgfgdhpfdd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  (\preoh v1\_xboole\_0~X0){\unicdbdjdcd}({\unicdcdadad} X1 .  (\preoh v1\_xboole\_0~X1){\unicdbdjdcd}\\
((m1\_trees\_3~X1~X0){\unicdbdjded}({\unicdcdadad} X2 .  (X2 \in X1){\unicdbdjdcd}((v1\_relat\_1~X2){\unicdcdcdhd}((\\
v5\_relat\_1~X2~X0){\unicdcdcdhd}((v1\_funct\_1~X2){\unicdcdcdhd}(v3\_trees\_2~X2)))))))\end{array}
\label{hyp:eggdpfehchfgfgdhpfdd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  (r1\_tarski~X0~X1){\unicdbdjded}({\unicdcdadad} X2 .  (X2 \in X0){\unicdbdjdcd}\\
(X2 \in X1))\end{array}
\label{hyp:egddpfehbgchdhlgjg}
\end{equation}
\begin{theorem}\label{thm:ehcdbdpfehchfgfgdhpfdd}
$$\begin{array}{c}{\unicdcdadad} X0 .  (\preoh v1\_xboole\_0~X0){\unicdbdjdcd}(r1\_tarski~(k5\_trees\_3~X0)~(k4\_trees\_3~\\
X0))\end{array}$$
\end{theorem}
\end{document}
