\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{t2\_trees\_3 (TMXLupZuGdWcQjfzkABe4E2SZ5fELGFyci5)}
\maketitle
Let $ v2\_trees\_3 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ r1\_tarski : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k2\_trees\_3 : {\iota}$ be given.
Let $ m1\_subset\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k1\_zfmisc\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k1\_trees\_3 : {\iota}$ be given.
Let $ v1\_xboole\_0 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v1\_finset\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v1\_trees\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Assume the following.
\begin{equation}
{{{m1\_subset\_1}~{k2\_trees\_3}}~{({{k1\_zfmisc\_1}~{k1\_trees\_3}})}}\label{hyp:egehpflgcdpfehchfgfgdhpfdd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  (v2\_trees\_3~X0){\unicdbdjded}({\unicdcdadad} X1 .  (X1 \in X0){\unicdbdjdcd}((\preoh v1\_xboole\_0~\\
X1){\unicdcdcdhd}((v1\_finset\_1~X1){\unicdcdcdhd}(v1\_trees\_1~X1))))\end{array}
\label{hyp:egedpfehchfgfgdhpfdd}
\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}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  (m1\_subset\_1~X0~(k1\_zfmisc\_1~k1\_trees\_3)){\unicdbdjdcd}((X0=k2\_trees\_3){\unicdbdjded}\\
({\unicdcdadad} X1 .  (X1 \in X0){\unicdbdjded}((\preoh v1\_xboole\_0~X1){\unicdcdcdhd}((v1\_finset\_1~X1){\unicdcdcdhd}(\\
v1\_trees\_1~X1)))))\end{array}
\label{hyp:egcdpfehchfgfgdhpfdd}
\end{equation}
\begin{theorem}\label{thm:ehcdpfehchfgfgdhpfdd}
${{\unicdcdadad} X0 .  {{({{v2\_trees\_3}~{X0}})}{\unicdbdjded}{({{{r1\_tarski}~{X0}}~{k2\_trees\_3}})}}}$.
\end{theorem}
\end{document}
