\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{t13\_sgraph1 (TMKdV8Q3JXCVzYH5w7yYPiymzp6GLpLzKDu)}
\maketitle
Let $ v1\_finset\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ k2\_sgraph1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ r1\_tarski : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k1\_zfmisc\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{{r1\_tarski}~{({{k2\_sgraph1}~{X0}})}}~{({{k1\_zfmisc\_1}~{X0}})}}}\label{hyp:ehjdpfdhhgchbgahigbd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  ((r1\_tarski~X0~X1){\unicdcdcdhd}(v1\_finset\_1~X1)){\unicdbdjdcd}(\\
v1\_finset\_1~X0)\end{array}
\label{hyp:ehbdpfggjgogdhfgehpfbd}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{({{v1\_finset\_1}~{X0}})}{\unicdbdjdcd}{({{v1\_finset\_1}~{({{k1\_zfmisc\_1}~{X0}})}})}}}\label{hyp:ggdgbdhdpfggjgogdhfgehpfbd}
\end{equation}
\begin{theorem}\label{thm:ehbdddpfdhhgchbgahigbd}
${{\unicdcdadad} X0 .  {{({{v1\_finset\_1}~{X0}})}{\unicdbdjdcd}{({{v1\_finset\_1}~{({{k2\_sgraph1}~{X0}})}})}}}$.
\end{theorem}
\end{document}
