\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{t2\_orders\_1 (TMdXco8kWEU5U9w2LiH6TBBhs9ZbF4G35N5)}
\maketitle
Let $ v1\_xboole\_0 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ r1\_tarski : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k1\_orders\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ m1\_subset\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k1\_zfmisc\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k9\_setfam\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k7\_subset\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}}$ be given.
Let $ k4\_xboole\_0 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Let $ k1\_xboole\_0 : {\iota}$ be given.
Let $ k1\_tarski : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  (m1\_subset\_1~X0~(k1\_zfmisc\_1~X1)){\unicdbdjded}(r1\_tarski~\\
X0~X1)\end{array}
\label{hyp:ehddpfdhfhcgdhfgeh}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{\unicdcdadad} X1 .  {{{r1\_tarski}~{X0}}~{X0}}}}\label{hyp:chfgggmgfgihjgghjgehjhpfchbdpfehbgchdhlgjg}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{{k9\_setfam\_1}~{X0}}={{k1\_zfmisc\_1}~{X0}}}}\label{hyp:chfgegfgggjgogjgehjgpgogpflgjdpfdhfgehggbgngpfbd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  {\unicdcdadad} X2 .  (m1\_subset\_1~X1~(k1\_zfmisc\_1~\\
X0)){\unicdbdjdcd}(k7\_subset\_1~X0~X1~X2=k4\_xboole\_0~X1~X2)\end{array}
\label{hyp:chfgegfgggjgogjgehjgpgogpflghdpfdhfhcgdhfgehpfbd}
\end{equation}
Assume the following.
\begin{equation}
{{v1\_xboole\_0}~{k1\_xboole\_0}}\label{hyp:ggdgbdpfihcgpgpgmgfgpfad}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {\preoh{{{v1\_xboole\_0}~{({{k1\_zfmisc\_1}~{X0}})}}}}}\label{hyp:ggdgbdpfdhfhcgdhfgehpfbd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  {\unicdcdadad} X2 .  (X2=k4\_xboole\_0~X0~X1){\unicdbdjded}({\unicdcdadad} X3 .  \\
(X3 \in X2){\unicdbdjded}((X3 \in X0){\unicdcdcdhd}(\preoh X3 \in X1)))\end{array}
\label{hyp:egfdpfihcgpgpgmgfgpfad}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  k1\_orders\_1~X0=k7\_subset\_1~(k1\_zfmisc\_1~X0)~(k9\_setfam\_1~\\
X0)~(k1\_tarski~k1\_xboole\_0)\end{array}
\label{hyp:egcdpfpgchegfgchdhpfbd}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{({{v1\_xboole\_0}~{X0}})}{\unicdbdjded}{({{\unicdcdadad} X1 .  {\preoh{{{X1} \in {X0}}}}})}}}\label{hyp:egbdpfihcgpgpgmgfgpfad}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  (X1=k1\_tarski~X0){\unicdbdjded}({\unicdcdadad} X2 .  (X2 \in X1){\unicdbdjded}\\
(X2=X0))\end{array}
\label{hyp:egbdpfehbgchdhlgjg}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  ((\preoh v1\_xboole\_0~X0){\unicdbdjdcd}((m1\_subset\_1~X1~X0){\unicdbdjded}\\
(X1 \in X0))){\unicdcdcdhd}((v1\_xboole\_0~X0){\unicdbdjdcd}((m1\_subset\_1~X1~X0){\unicdbdjded}(v1\_xboole\_0~\\
X1)))\end{array}
\label{hyp:egbdpfdhfhcgdhfgehpfbd}
\end{equation}
\begin{theorem}\label{thm:ehcdpfpgchegfgchdhpfbd}
$$\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  (\preoh v1\_xboole\_0~X1){\unicdbdjdcd}((r1\_tarski~X1~X0){\unicdbdjded}(\\
X1 \in k1\_orders\_1~X0))\end{array}$$
\end{theorem}
\end{document}
