\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{t28\_trees\_1 (TMTTSoies4JZ7LxKuB2P776ghDSzziWtdDr)}
\maketitle
Let $ m1\_subset\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k5\_numbers : {\iota}$ be given.
Let $ r1\_xxreal\_0 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k12\_finseq\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Let $ k2\_trees\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k4\_ordinal1 : {\iota}$ be given.
Let $ k2\_xboole\_0 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Let $ k1\_tarski : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k1\_xboole\_0 : {\iota}$ be given.
Let $ v1\_xboole\_0 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Assume the following.
\begin{equation}
{{k5\_numbers}={k4\_ordinal1}}\label{hyp:chfgegfgggjgogjgehjgpgogpflgfdpfogfhngcgfgchdh}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  (m1\_subset\_1~X0~k5\_numbers){\unicdbdjdcd}(k2\_trees\_1~X0=k2\_xboole\_0~\\
(ReplSep~(toset~({\uniddcgcg} X1 : \iota .  m1\_subset\_1~X1~k5\_numbers))~({\uniddcgcg} X1 : \\
\iota .  \preoh r1\_xxreal\_0~X0~X1)~({\uniddcgcg} X1 : \iota .  k12\_finseq\_1~k5\_numbers~\\
X1))~(k1\_tarski~k1\_xboole\_0))\end{array}
\label{hyp:egedpfehchfgfgdhpfbd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  {\unicdcdadad} X2 .  (X2=k2\_xboole\_0~X0~X1){\unicdbdjded}({\unicdcdadad} X3 .  \\
(X3 \in X2){\unicdbdjded}((X3 \in X0){\unicdcdcdid}(X3 \in X1)))\end{array}
\label{hyp:egddpfihcgpgpgmgfgpfad}
\end{equation}
Assume the following.
\begin{equation}
{{k1\_xboole\_0}={{the}~{({{\uniddcgcg} X0 : {\iota} .  {{v1\_xboole\_0}~{X0}}})}}}\label{hyp:egcdpfihcgpgpgmgfgpfad}
\end{equation}
\begin{theorem}\label{thm:ehcdidpfehchfgfgdhpfbd}
$$\begin{array}{c}{\unicdcdadad} X0 .  (m1\_subset\_1~X0~k5\_numbers){\unicdbdjdcd}({\unicdcdadad} X1 .  (m1\_subset\_1~\\
X1~k5\_numbers){\unicdbdjdcd}((\preoh r1\_xxreal\_0~X1~X0){\unicdbdjdcd}(k12\_finseq\_1~k5\_numbers~\\
X0 \in k2\_trees\_1~X1)))\end{array}$$
\end{theorem}
\end{document}
