\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{t8\_pcs\_0 (TMVPQg4rCpN4H7skvyTY6cAamBAJ9EBSD3g)}
\maketitle
Let $ l1\_orders\_2 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ m1\_subset\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ u1\_struct\_0 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ r1\_relset\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}}}$ be given.
Let $ u1\_orders\_2 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ r1\_orders\_2 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}}$ be given.
Let $ k1\_zfmisc\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k2\_zfmisc\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Let $ r1\_tarski : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k4\_tarski : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  {\unicdcdadad} X2 .  {\unicdcdadad} X3 .  (m1\_subset\_1~X2~(\\
k1\_zfmisc\_1~(k2\_zfmisc\_1~X0~X1))){\unicdbdjdcd}((r1\_relset\_1~X0~X1~X2~X3){\unicdbdjded}(\\
r1\_tarski~X2~X3))\end{array}
\label{hyp:chfgegfgggjgogjgehjgpgogpfchbdpfchfgmgdhfgehpfbd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  (l1\_orders\_2~X0){\unicdbdjdcd}(m1\_subset\_1~(u1\_orders\_2~X0)~(k1\_zfmisc\_1~\\
(k2\_zfmisc\_1~(u1\_struct\_0~X0)~(u1\_struct\_0~X0))))\end{array}
\label{hyp:egehpffhbdpfpgchegfgchdhpfcd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  (l1\_orders\_2~X0){\unicdbdjdcd}({\unicdcdadad} X1 .  (m1\_subset\_1~X1~(u1\_struct\_0~\\
X0)){\unicdbdjdcd}({\unicdcdadad} X2 .  (m1\_subset\_1~X2~(u1\_struct\_0~X0)){\unicdbdjdcd}((r1\_orders\_2~\\
X0~X1~X2){\unicdbdjded}(k4\_tarski~X1~X2 \in u1\_orders\_2~X0))))\end{array}
\label{hyp:egfdpfpgchegfgchdhpfcd}
\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}
\begin{theorem}\label{thm:ehidpfahdgdhpfad}
$$\begin{array}{c}{\unicdcdadad} X0 .  (l1\_orders\_2~X0){\unicdbdjdcd}({\unicdcdadad} X1 .  (l1\_orders\_2~X1){\unicdbdjdcd}({\unicdcdadad} X2 .  \\
(m1\_subset\_1~X2~(u1\_struct\_0~X0)){\unicdbdjdcd}({\unicdcdadad} X3 .  (m1\_subset\_1~X3~\\
(u1\_struct\_0~X0)){\unicdbdjdcd}({\unicdcdadad} X4 .  (m1\_subset\_1~X4~(u1\_struct\_0~X1)){\unicdbdjdcd}\\
({\unicdcdadad} X5 .  (m1\_subset\_1~X5~(u1\_struct\_0~X1)){\unicdbdjdcd}(((r1\_relset\_1~\\
(u1\_struct\_0~X0)~(u1\_struct\_0~X0)~(u1\_orders\_2~X0)~(u1\_orders\_2~\\
X1)){\unicdcdcdhd}((X2=X4){\unicdcdcdhd}((X3=X5){\unicdcdcdhd}(r1\_orders\_2~X0~X2~X3)))){\unicdbdjdcd}(r1\_orders\_2~\\
X1~X4~X5)))))))\end{array}$$
\end{theorem}
\end{document}
