\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{t11\_pre\_circ (TMb9TkPnpFTLUH1jF56dBeBZjeZoHG8Ps89)}
\maketitle
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.
Let $ m1\_trees\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ m2\_finseq\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k5\_numbers : {\iota}$ be given.
Let $ k5\_trees\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}}$ be given.
Let $ r1\_tarski : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k8\_finseq\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}}$ be given.
Let $ k2\_xboole\_0 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
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\_finset\_1~X1){\unicdcdcdhd}(v1\_trees\_1~\\
X1))){\unicdbdjdcd}({\unicdcdadad} X2 .  (m1\_trees\_1~X2~X0){\unicdbdjdcd}(k5\_trees\_1~X0~X2~X1=k2\_xboole\_0~\\
(ReplSep~(toset~({\uniddcgcg} X3 : \iota .  m1\_trees\_1~X3~X0))~({\uniddcgcg} X3 : \iota .  \preoh \\
r1\_tarski~X2~X3)~({\uniddcgcg} X3 : \iota .  X3))~(ReplSep~(toset~({\uniddcgcg} X3 : \iota .  \\
m1\_trees\_1~X3~X1))~({\uniddcgcg} X3 : \iota .  True)~({\uniddcgcg} X3 : \iota .  k8\_finseq\_1~\\
k5\_numbers~X2~X3)))))\end{array}
\label{hyp:ehbdadpfahchfgpfdgjgchdg}
\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}
\begin{theorem}\label{thm:ehbdbdpfahchfgpfdgjgchdg}
$$\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\_finset\_1~X1){\unicdcdcdhd}(v1\_trees\_1~\\
X1))){\unicdbdjdcd}({\unicdcdadad} X2 .  (m1\_trees\_1~X2~X0){\unicdbdjdcd}({\unicdcdadad} X3 .  (m2\_finseq\_1~\\
X3~k5\_numbers){\unicdbdjdcd}(\preoh (X3 \in k5\_trees\_1~X0~X2~X1){\unicdcdcdhd}((r1\_tarski~X2~X3){\unicdcdcdhd}\\
({\unicdcdadad} X4 .  (m1\_trees\_1~X4~X1){\unicdbdjdcd}(X3{\unicdcdgdad}k8\_finseq\_1~k5\_numbers~X2~\\
X4)))))))\end{array}$$
\end{theorem}
\end{document}
