\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{t5\_trees\_2 (TMVZuksS7ua91Zh5KEFGMZckrVVY4t9SF8i)}
\maketitle
Let $ v1\_xboole\_0 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v1\_trees\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ m2\_finseq\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k5\_numbers : {\iota}$ be given.
Let $ r1\_tarski : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
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 .  {\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}
{{\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:ehfdpfehchfgfgdhpfcd}
$$\begin{array}{c}{\unicdcdadad} X0 .  ((\preoh v1\_xboole\_0~X0){\unicdcdcdhd}(v1\_trees\_1~X0)){\unicdbdjdcd}({\unicdcdadad} X1 .  \\
((\preoh v1\_xboole\_0~X1){\unicdcdcdhd}(v1\_trees\_1~X1)){\unicdbdjdcd}(({\unicdcdadad} X2 .  (m2\_finseq\_1~\\
X2~k5\_numbers){\unicdbdjdcd}((X2 \in X0){\unicdbdjded}(X2 \in X1))){\unicdbdjdcd}(X0=X1)))\end{array}$$
\end{theorem}
\end{document}
