\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{t41\_trees\_3 (TMFX5xyC24vkTw4fz8wQWZP2sHUazVmfnDt)}
\maketitle
Let $ v1\_xboole\_0 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v1\_trees\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ m4\_trees\_3 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k2\_trees\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k6\_numbers : {\iota}$ be given.
Let $ r1\_tarski : {{\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\_tarski : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ v1\_finset\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ m3\_trees\_3 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ m2\_trees\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ m1\_trees\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ 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}
{{\unicdcdadad} X0 .  {{{r1\_tarski}~{k1\_xboole\_0}}~{X0}}}\label{hyp:ehcdpfihcgpgpgmgfgpfbd}
\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}
{{{k2\_trees\_1}~{k6\_numbers}}={{k1\_tarski}~{k1\_xboole\_0}}}\label{hyp:ehcdjdpfehchfgfgdhpfbd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  ((\preoh v1\_xboole\_0~X0){\unicdcdcdhd}((v1\_finset\_1~X0){\unicdcdcdhd}(v1\_trees\_1~\\
X0))){\unicdbdjdcd}({\unicdcdadad} X1 .  (m3\_trees\_3~X1~X0){\unicdbdjded}(m2\_trees\_1~X1~X0))\end{array}
\label{hyp:chfgegfgggjgogjgehjgpgogpfngddpfehchfgfgdhpfdd}
\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\_1~X1~X0){\unicdbdjded}(m1\_subset\_1~X1~X0))\end{array}
\label{hyp:chfgegfgggjgogjgehjgpgogpfngbdpfehchfgfgdhpfbd}
\end{equation}
Assume the following.
\begin{equation}
{{k6\_numbers}={k1\_xboole\_0}}\label{hyp:chfgegfgggjgogjgehjgpgogpflggdpfogfhngcgfgchdh}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {\preoh{{{v1\_xboole\_0}~{({{k1\_tarski}~{X0}})}}}}}\label{hyp:ggdgcdpfihcgpgpgmgfgpfad}
\end{equation}
Assume the following.
\begin{equation}
{{v1\_trees\_1}~{({{k1\_tarski}~{k1\_xboole\_0}})}}\label{hyp:ggdgbdpfehchfgfgdhpfbd}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{v1\_finset\_1}~{({{k1\_tarski}~{X0}})}}}\label{hyp:ggdgbdpfggjgogdhfgehpfbd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  ((\preoh v1\_xboole\_0~X0){\unicdcdcdhd}(v1\_trees\_1~X0)){\unicdbdjdcd}({\unicdcdaddd} X1 .  \\
m2\_trees\_1~X1~X0)\end{array}
\label{hyp:fgihjgdhehfgogdgfgpfngcdpfehchfgfgdhpfbd}
\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\_trees\_1~X1~X0){\unicdbdjdcd}(m1\_trees\_1~X1~X0))\end{array}
\label{hyp:egehpfngcdpfehchfgfgdhpfbd}
\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 .  {\unicdcdadad} X1 .  (X1=k1\_tarski~X0){\unicdbdjded}({\unicdcdadad} X2 .  (X2 \in X1){\unicdbdjded}\\
(X2=X0))\end{array}
\label{hyp:egbdpfehbgchdhlgjg}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  ((\preoh v1\_xboole\_0~X0){\unicdcdcdhd}((v1\_finset\_1~X0){\unicdcdcdhd}(v1\_trees\_1~\\
X0))){\unicdbdjdcd}({\unicdcdadad} X1 .  ((\preoh v1\_xboole\_0~X1){\unicdcdcdhd}(v1\_trees\_1~X1)){\unicdbdjdcd}((m4\_trees\_3~\\
X1~X0){\unicdbdjded}({\unicdcdadad} X2 .  (m1\_trees\_1~X2~X1){\unicdbdjdcd}(\preoh (\preoh X2 \in X0){\unicdcdcdhd}({\unicdcdadad} X3 .  \\
(m3\_trees\_3~X3~X0){\unicdbdjdcd}(\preoh r2\_xboole\_0~X3~X2))))))\end{array}
\label{hyp:egbdedpfehchfgfgdhpfdd}
\end{equation}
\begin{theorem}\label{thm:ehedbdpfehchfgfgdhpfdd}
$$\begin{array}{c}{\unicdcdadad} X0 .  ((\preoh v1\_xboole\_0~X0){\unicdcdcdhd}(v1\_trees\_1~X0)){\unicdbdjdcd}(m4\_trees\_3~\\
X0~(k2\_trees\_1~k6\_numbers))\end{array}$$
\end{theorem}
\end{document}
