\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{t16\_trees\_9 (TMXd8Fd6xTVVFfMfDmao9hLNuf4aJxLFDaY)}
\maketitle
Let $ v1\_relat\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v1\_funct\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v3\_trees\_2 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ k6\_trees\_9 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k4\_tarski : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Let $ k1\_xboole\_0 : {\iota}$ be given.
Let $ m1\_trees\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k9\_xtuple\_0 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k5\_trees\_2 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Let $ k2\_tarski : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Let $ k1\_tarski : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ v1\_xboole\_0 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  {\unicdcdadad} X2 .  {\unicdcdadad} X3 .  (k4\_tarski~X0~X1=\\
k4\_tarski~X2~X3){\unicdbdjdcd}((X0=X2){\unicdcdcdhd}(X1=X3))\end{array}
\label{hyp:ehbdpfihehfhahmgfgpfad}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  ((v1\_relat\_1~X0){\unicdcdcdhd}((v1\_funct\_1~X0){\unicdcdcdhd}(v3\_trees\_2~X0))){\unicdbdjdcd}\\
(k4\_tarski~k1\_xboole\_0~X0 \in k6\_trees\_9~X0)\end{array}
\label{hyp:ehbdfdpfehchfgfgdhpfjd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  ((v1\_relat\_1~X0){\unicdcdcdhd}((v1\_funct\_1~X0){\unicdcdcdhd}(v3\_trees\_2~X0))){\unicdbdjdcd}\\
(k6\_trees\_9~X0=ReplSep~(toset~({\uniddcgcg} X1 : \iota .  m1\_trees\_1~X1~(k9\_xtuple\_0~\\
X0)))~({\uniddcgcg} X1 : \iota .  True)~({\uniddcgcg} X1 : \iota .  k4\_tarski~X1~(k5\_trees\_2~\\
X0~X1)))\end{array}
\label{hyp:egidpfehchfgfgdhpfjd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  k4\_tarski~X0~X1=k2\_tarski~(k2\_tarski~X0~\\
X1)~(k1\_tarski~X0)\end{array}
\label{hyp:egfdpfehbgchdhlgjg}
\end{equation}
Assume the following.
\begin{equation}
{{k1\_xboole\_0}={{the}~{({{\uniddcgcg} X0 : {\iota} .  {{v1\_xboole\_0}~{X0}}})}}}\label{hyp:egcdpfihcgpgpgmgfgpfad}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{\unicdcdadad} X1 .  {{{{k2\_tarski}~{X0}}~{X1}}={{{k2\_tarski}~{X1}}~{X0}}}}}\label{hyp:dgpgngngfhehbgehjgghjgehjhpflgcdpfehbgchdhlgjg}
\end{equation}
\begin{theorem}\label{thm:ehbdgdpfehchfgfgdhpfjd}
$$\begin{array}{c}{\unicdcdadad} X0 .  ((v1\_relat\_1~X0){\unicdcdcdhd}((v1\_funct\_1~X0){\unicdcdcdhd}(v3\_trees\_2~X0))){\unicdbdjdcd}\\
({\unicdcdadad} X1 .  ((v1\_relat\_1~X1){\unicdcdcdhd}((v1\_funct\_1~X1){\unicdcdcdhd}(v3\_trees\_2~X1))){\unicdbdjdcd}\\
((k6\_trees\_9~X0=k6\_trees\_9~X1){\unicdbdjdcd}(X0=X1)))\end{array}$$
\end{theorem}
\end{document}
